load balancing for optimal sharing of network bandwidth
S.Hilda Thabitha,S.Pallavi,P.Jesu Jayarin
Published in International Journal of Advanced Research in Computer Science Engineering and Information Technology
ISSN: 2321-3337 Impact Factor:1.521 Volume:3 Issue:1 Year: 26 June,2014 Pages:375-383
Abstract
Peers participating in a DHT are able to balance their loads in the virtual servers. In decentralized load balance algorithm in DHT the peers which are participating should be Asymmetric which introduces another load imbalance problem. In our paper, the symmetric load balancing algorithm where each peers independently reallocates. Our proposal exhibits analytical performance in terms of load balance factor and the algorithmic convergence rate and it will not introduce any load imbalance problem due to algorithmic workload.
Kewords
LOAD IMBALANCE, Packet Dispatcher
Reference
[1] S. Ajmani, D. Clarke, C.-H. Moh, and S. Richman, “ConChord: Cooperative SDSI certificate storage and name resolution,” in Proc. 1st Int. Workshop Peer-to-Peer Systems, Cambridge, MA, Mar. 2002. [2] A. Bakker, E. Amade, G. Ballintijn, I. Kuz, P. Verkaik, W. I. van der, M. van Steen, and A. Tanenbaum, “The globe distribution network,” in Proc. 2000 USENIX Annu. Conf. (FREENIX Track), San Diego, CA, June 2000, pp. 141–152. STOICA et al.: CHORD: SCALABLE PEER-TO-PEER LOOKUP PROTOCOL 31 [3] Y. Chen, J. Edler, A. Goldberg, A. Gottlieb, S. Sobti, and P. Yianilos, “A prototype implementation of archival intermemory,” in Proc. 4th ACM Conf. Digital Libraries, Berkeley, CA, Aug. 1999, pp. 28–37. [4] I. Clarke, “A distributed decentralised information storage and retrievalsystem,” Master’s thesis, Univ. Edinburgh, Edinburgh, U.K., 1999. [5] I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong, “Freenet: A distributed anonymous information storage and retrieval system,” in Proc. ICSI Workshop Design Issues in Anonymity and Unobservability, Berkeley, CA, June 2000, [Online]. Available: http://freenet.sourceforge. net. [6] R. Cox, A. Muthitacharoen, and R. Morris, “Serving DNS using Chord,”in Proc. 1st Int. Workshop Peer-to-Peer Systems, Cambridge, MA, Mar2002. [7] F. Dabek, F. Kaashoek, D. R. Karger, R. Morris, and I. Stoica, “Wide-area cooperative storage with CFS,” in Proc. ACM Symp. Operating Systems Principles, Banff, Canada, 2001, pp. 202–215. [8] G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels, “Dynamo: Amazon’s Highly Available Key-value Store,” in Proc 21st ACM Symp. Operating Systems Principles (SOSP’07), Oct. 2007, pp. 205–220. [9] Gnutella. [Online]. Available: http://gnutella.wego.com/ [10] J. Li, J. Jannotti, D. De Couto, D. R. Karger, and R. Morris, “A scalable location service for geographic ad hoc routing,” in Proc. 6th ACM Int. Conf. Mobile Computing and Networking, Boston, MA, Aug. 2000, pp. 120–130. [11] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A scalable content-addressable network,” in Proc. ACM SIGCOMM, San Diego, CA, Aug. 2001, pp. 161–172. [12] A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,” LNCS 2218, pp. 161–172, Nov. 2001. [13] I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger,M. F. Kaashoek,F. Dabek, and H. Balakrishnan, “Chord: a Scalable Peer-to-Peer Lookup Protocol for Internet Applications,” IEEE/ACM Trans. Netw., vol. 11, no. 1, pp. 17–21, Feb. 2003. [14] J. Stribling, E. Sit, M. F. Kaashoek, J. Li, and R. Morris, “Don’t Give Up on Distributed File Systems,” in Proc. 6th Int’l Workshop Peer-to-Peer Systems (IPTPS’07), Feb. 2007. [15] A Symmetric Load Balancing Algorithm with Performance guarantees with Distributed Hash Table by Hung-Chang Hsiao†, Che-Wei Chang
