CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Water-Filling: A Novel Approach of Load Rebalancing for File Systems in Cloud

by Divya Diwakar, Sushil Chaturvedi, S.K. Shrivastava
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 126 - Number 14
Year of Publication: 2015
Authors: Divya Diwakar, Sushil Chaturvedi, S.K. Shrivastava
10.5120/ijca2015906306

Divya Diwakar, Sushil Chaturvedi, S.K. Shrivastava . Water-Filling: A Novel Approach of Load Rebalancing for File Systems in Cloud. International Journal of Computer Applications. 126, 14 ( September 2015), 28-33. DOI=10.5120/ijca2015906306

@article{ 10.5120/ijca2015906306,
author = { Divya Diwakar, Sushil Chaturvedi, S.K. Shrivastava },
title = { Water-Filling: A Novel Approach of Load Rebalancing for File Systems in Cloud },
journal = { International Journal of Computer Applications },
issue_date = { September 2015 },
volume = { 126 },
number = { 14 },
month = { September },
year = { 2015 },
issn = { 0975-8887 },
pages = { 28-33 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume126/number14/22623-2015906306/ },
doi = { 10.5120/ijca2015906306 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:17:44.714968+05:30
%A Divya Diwakar
%A Sushil Chaturvedi
%A S.K. Shrivastava
%T Water-Filling: A Novel Approach of Load Rebalancing for File Systems in Cloud
%J International Journal of Computer Applications
%@ 0975-8887
%V 126
%N 14
%P 28-33
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

File systems serves as the backend for cloud computing and load balancing is the relevant issue in context of resource utilization for distributed file systems in cloud. Prior to this, it is fruitful to identify the load on the storage servers (nodes) which is equivalent to number of file chunks it stored. Here is an extension of load balancing i.e. water-filling load rebalancing operated on distributed approach based on water-filling methodology, contrasting all the earlier algorithms that were grounded on centralized and distributed approaches, is used for balancing the load on servers by distributing file chunks making it more amplified to perform map reducing tasks. Water-filling approach enhances the scope of algorithm by calculating the total load exchange cost and rejoining cost in terms of file chunks migrated. Besides this, distributed approach, which employs self reliant load balancing on each node, is preferred due to its effortlessness. In distributed approach the node having highest and the lowest load is preferred to exchange chunks but often not on least possible load exchange cost. In this paper, an improved load distribution task based on physical network locality significance is calculated by water-filling algorithm, is used as metric for minimizing the load exchange cost to improve the load balancing for overcoming the shortcomings of centralized and distributed approach. Experimental results reports that water-filling load balancing algorithm is 81% better in load distribution than distributed load rebalancing, coagulates less load movement cost and even predicting reduced rejoining cost for migration of chunks in the panoptic environment of cloud.

References
  1. J. Dean and S. Ghemawat Dec. 2004. “MapReduce: Simplified Data Processing on Large Clusters,” In Proc. 6th Symp. Operating System Design and Implementation (OSDI’04), 137–150.
  2. “Hadoop Distributed File System”, http:// hadoop. apache. org/hdfs/.
  3. “VMware”, http://www.vmware.com/.
  4. “Hadoop Distributed File System”, “Rebalancing Blocks,”http://developer.yahoo.com/hadoop/tutorial/module2.html#rebalancing.
  5. S. Ghemawat, H. Gobioff, and S.-T. Leung Oct. 2003, “The Google File System,” In Proc. 19th ACM Symp. Operating Systems Principles (SOSP’03), 29–43.
  6. D. Karger and M. Ruhl June 2004. “Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems,” In Proc. 16th ACM Symp. Parallel Algorithms and Architectures (SPAA’04), 36–43.
  7. J. W. Byers, J. Considine, and M. Mitzenmacher Feb. 2003. “Simple Load Balancing for Distributed Hash Tables,” In Proc. 1st Int’l Workshop Peer-to-Peer Systems (IPTPS’03), 80–87.
  8. G. S. Manku July 2004. “Balanced Binary Trees for ID Management and Load Balance in Distributed Hash Tables,” In Proc. 23rd ACM Symp. Principles Distributed Computing (PODC’04), 197-205.
  9. Q. H. Vu, B. C. Ooi, M. Rinard, and K.-L. Tan, Jan. 1959. “Histogram-Based Global Load Balancing in Structured Peer-to-Peer Systems,” IEEE Transactions on Knowledge and Data Engineering, 11(1), 34–39.
  10. I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan Feb. 2003. “Chord: a Scalable Peer-to-Peer Lookup Protocol for Internet Applications,” IEEE/ACM Transactions on Networks, 11(1), 17–21.
  11. A. Rowstron and P. Druschel Nov. 2001. “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,” LNCS 2218, 161–172.
  12. G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian Oct. 2007. P. Vosshall, and W. Vogels, “Dynamo: Amazon’s Highly Available Key-value Store,” In Proc. 21st ACM Symp. Operating Systems Principles (SOSP’07), 205–220.
  13. Daniel Pérez Palomar, Member, and Javier Rodríguez Fonollosa Feb 2005. “Practical Algorithms for a Family of Waterfilling Solutions,” IEEE Transactions on signals processing, 53(2), 686-695.
  14. A. Rao, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica Feb. 2003. “Load Balancing in Structured P2P Systems,” In Proc. 2nd Int’l Workshop Peerto- Peer Systems (IPTPS’02), 68–79.
  15. H. Shen and C.-Z. Xu June 2007. “Locality-Aware and Churn-Resilient Load Balancing Algorithms in Structured P2P Networks,” IEEE Transactions on Parallel and Distributed Systems, 18(6), 849–862.
  16. Y. Zhu and Y. Hu Apr. 2005. “Efficient, Proximity-Aware Load Balancing for DHTBased P2P Systems,” IEEE Transactions on Parallel and Distributed Systems, 16(4), 349–361.
  17. S. Surana, B. Godfrey, K. Lakshminarayanan, R. Karp, and I. Stoica Mar. 2006. “Load Balancing in Dynamic Structured P2P Systems,” Performance Evaluation, 63(6), 217–240.
  18. Hung-Chang Hsiao, Hsueh-Yi Chung, HaiyingShen, and Yu-Chang Chao May 2013. “Load Rebalancing for Distributed File Systems in Clouds,” IEEE Transactions on Parallel and Distributed Systems, 24(5), 951-961.
  19. Revathy R, A.Illayarajaa May. 2013. “Efficient Load Re Balancing Algorithm for Distributed File Systems,” International Journal of Innovative Technology and Exploring Engineering, 2(6), 135-138.
  20. Tao Wang, Xin Lv, Fang Yang, Wenhuan Zhou, Rongzhi Qi, HuaiZhi Su Nov 2014 . “A Load balancing scheme for distributed key-value caching system in cloud environment,” In Proc. 13th Symp. Distributed Computing and Applications to Business, Engineering and Science (DCABES’14), 63-67.
  21. H. Sagan 1994. “Space-Filling curves,” Springer.
  22. M. Jelasity, A. Montresor, and O. Babaoglu Aug. 2005. “Gossip-Based Aggregation in Large Dynamic Networks,” ACM Transactions on Computer Systems, 23(3), 219–252.
Index Terms

Computer Science
Information Sciences

Keywords

Cloud computing distributed file systems load balance water-filling.

Powered by PhDFocusTM