z-logo
open-access-imgOpen Access
An Efficient Adaptive Load Balancing Algorithm for Cloud Computing Under Bursty Workloads
Author(s) -
Sally F. Issawi,
Alaa Al Halees,
Mohammed Radi
Publication year - 2015
Publication title -
engineering, technology and applied science research/engineering, technology and applied science research
Language(s) - English
Resource type - Journals
eISSN - 2241-4487
pISSN - 1792-8036
DOI - 10.48084/etasr.554
Subject(s) - computer science , load balancing (electrical power) , cloud computing , distributed computing , network load balancing services , round robin dns , algorithm , the internet , grid , computer network , server , operating system , geometry , mathematics , domain name system
Cloud computing is a recent, emerging technology in the IT industry. It is an evolution of previous models such as grid computing. It enables a wide range of users to access a large sharing pool of resources over the internet. In such complex system, there is a tremendous need for an efficient load balancing scheme in order to satisfy peak user demands and provide high quality of services. One of the challenging problems that degrade the performance of a load balancing process is bursty workloads. Although there are a lot of researches proposing different load balancing algorithms, most of them neglect the problem of bursty workloads. Motivated by this problem, this paper proposes a new burstness-aware load balancing algorithm which can adapt to the variation in the request rate by adopting two load balancing algorithms: RR in burst and Random in non-burst state. Fuzzy logic is used in order to assign the received request to a balanced VM. The algorithm has been evaluated and compared with other algorithms using Cloud Analyst simulator.  Results show that the proposed algorithm improves the average response time and average processing time in comparison with other algorithms.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here