Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Ramesh, Dharavatha; * | Dey, Swetaa | Bhukya, Rajub
Affiliations: [a] Department of Computer Science and Engineering, Indian Institute of Technology, Dhanbad, Jharkhand, India | [b] Department of Computer Science and Engineering, National Institute of Technology, Warangal, Telangana, India
Correspondence: [*] Corresponding author: Dharavath Ramesh, Department of Computer Science and Engineering, Indian Institute of Technology (ISM), Dhanbad, Jharkhand, India. E-mail: drramesh@iitism.ac.in.
Abstract: Cloud computing is an integrated service, which provides a new versatile of programming paradigm with a good number of features to dynamically migrate virtualized computing services between physical servers of various cloud data centers. This technology made the users and cloud service providers (CSPs) to manage the loads as per the demand. The effective management of loads in the cloud environment gives a rise to introduce new management methods, which are responsible for equally distributing the incoming workloads among all the available VMs in an effective way for a given period of time. To achieve this requirement various schemes have been proposed. However, many of them are not suitable to find the optimal information about required resources to fulfil the user demands. To accommodate this, in this paper, an approach named heuristic and fair-queuing based VM load balancing (HFQ-LB) has been introduced. With the help of fair-queuing, an efficient strategy has been designed. This configures the number of incoming loads for finding an appropriate VM for the assignment to satisfy the goal, i.e., it maximizes the utilization of resources according to the user demand. With the help of CloudSim, the proposed algorithm is validated in terms of makespan, waiting time, CPU utilization, and VM utilization by creating a multiple number of data centers. The proposed algorithm is also compared with other existing eight algorithms. Experimental results show that the proposed algorithm outperforms these existing algorithms in terms of makespan, waiting time, CPU utilization, and VM utilization.
Keywords: Resource utilization, resource management, load balancing, heuristic rules, fair-queuing
DOI: 10.3233/MGS-190300
Journal: Multiagent and Grid Systems, vol. 15, no. 1, pp. 19-38, 2019
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl