Close category search window
 

An Adaptive Load Balancing Algorithm in Object-Based Storage Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ling-Jun Qin ; Key Lab. of Data Storage Syst., Minist. of Educ. of China ; Dan Feng

Load balancing is a key issue in large-scale object-based storage systems. Many data replication and migration algorithms have been proposed for load balancing in distributed systems. However, the two operations, data replication and migration, are studied separately. An adaptive load balancing algorithm is presented in this paper, which combines replication and migration in a uniform model. Furthermore, this algorithm uses a hybrid load metric which reflects short-term and long-term load status. To solve the online problem with a changing workload, the algorithm employs an adaptive mechanism to keep track of the characteristics of workloads. The simulation results show that the algorithm with object replication and migration can markedly reduce the overall response time

Published in:
Machine Learning and Cybernetics, 2006 International Conference on

Date of Conference: 13-16 Aug. 2006

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.