Round Robin Approach For Better VM Load Balancing in Cloud Computing
Round Robin Approach For Better VM Load Balancing in Cloud Computing
the total waiting time of the resources. In cloud computing Initialize hash map with no entries;
load balancing are uses for balancing the load on virtual While (new request are recived by the Data Centre
machine and cloud resources. Controller)
Do
{
Data Center Controller queue the requests;
Data Centre Controller removes a request from
the beginning of the queue;
If(hash map contain any entry of a VM corresponding to
the current requesting user base && VM allocation status
== AVAILABLE)
{
The VM is reallocated to the user base request;
}
Else
{
Fig.5. Cloud load balancer
Allocate a VM to the user base request using Round Robin
Algorithm;
Existing Scheduling Algorithm in Cloud Computing
Update the entry of the user base and the VM in the hash
Virtual machine enables the abstraction of an OS and
map and the VM state list;
Application running on it from hardware there are three
}
types of VM Load Balancer that is Round Robin,
}
Throttled and active monitoring load balancing algorithms.
}
1. Round Robin Load Balancer – uses a simple Round
Robin algorithm to allocate VMs.
2. Active Monitoring Load Balancer – this version load V. RESULT ANALYSIS
balances the tasks between available VMs in a way that
evens out the number of active tasks on each VM at any The proposed algorithm (i.e. the Round Robin Load
given time. Balancer Algorithm) implemented for simulation. Java
3. Throttled Load Balancer – this ensures that only a pre- language is used for implementing VM load balancing
defined number of Internet Cloudlets are allocated to a algorithm. Table 3 shows the result based on Round Robin
single VM at any given time. If more request groups are VM Load Balancing algorithm for overall response time
present than the number of available VMs at a data center, of the cloud. In this min(ms) time, max (ms) time to
some of the requests will be queued until the next VM different number of virtual machines are analysed. Table 4
becomes available. shows the result based on Round Robin VM Load
One of the common problem with the above algorithms Balancing algorithm for Data Centre processing time of
is that they do not save the state of the previous allocation the cloud. In this min (ms) time, max(ms) time to different
of a VM to a request from given Userbase. As such, every number of virtual machines are analyzed.
time a request is received from the same Userbase the Table 1: For overall response time for Round Robin Load
algorithm needs to be run again, which increases the total Balancing
response of the requests. In this paper, we have addressed
this problem for the Round Robin VM load balancer.
The Proposed Algorithm- Round Robin VM Load
Balancing.
The proposed algorithm is an improvement over the
Round Robin VM Load Balancing algorithm. The Round
Robin algorithm does not save the state of previous
allocation of a VM to a request from a given user base
while the same state is saved in RR VM load balancer.
The Round Robin VM Load balancer maintains two data Table 2: For Data Centre processing time for Round
structure which is discussed below. Robin Load Balancing
o Hash Map- in which it stores the entry for the last VM
allocated to a request from a given user base.
o VM State List- this stores the allocation status (i.e. busy
available) of each VM.
ALGORITHM is-
Round_Robin_Load_Balancing ()
{
Initialize all the VM allocation status to
AVAILABLE in the VM state list;
Copyright © 2014 IJEIR, All right reserved
501
International Journal of Engineering Innovation & Research
Volume 3, Issue 4, ISSN: 2277 – 5668