Efficient Equalization Work in Peer-to-Peer System
DOI:
https://doi.org/10.51983/ajcst-2012.1.1.1667Keywords:
Peer-to-peer systems, load balance, heterogeneity, Distributed Hash TableAbstract
Peer-to-peer (P2P) architectures present benefits like scalability, load balancing and fault tolerance when compared to Client/Server architectures. Structured P2P systems furthermore feature efficient lookup mechanisms: an exact search is usually performed with logarithmic complexity relative to the number of peers in the system. The notion of virtual servers, peers participating in a heterogeneous, structured peer-to-peer (P2P) network may host different numbers of virtual servers, and by migrating virtual servers, peers can balance their loads proportional to their capacities close by in the address space. Load balancing is a critical issue for the efficient operation of peer-to-peer networks.This project include a simple protocol that balances load by moving nodes to arbitrary locations “where they are needed.”
References
Chen..C and. Tsai K.C, “The Server Reassignment Problem for Load Balancing in Structured P2P Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 2, pp. 234-246, Feb. 2008.
Gendreau T.B and L.M. Ni, C.-W. Xu, and, “A Distributed Drafting Algorithm for Load Balancing,” IEEE Trans. Software Eng., vol. 11, no. 10, pp. 1153-1161, Oct. 1985.
Rowstron .A and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,”Lecture Notes in Computer Science, pp. 161-172, Springer, Nov. 2001.
Shen .H and C.-Z. Xu, “Locality-Aware and Churn-Resilient Load Balancing Algorithms in Structured P2P Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 6, pp. 849-862, June 2007.
Zhu.Y and Hu.Y, “Efficient, Proximity-Aware Load Balancing for DHT-Based P2P Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 4, pp. 349-361, Apr. 2005.
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. Networking, vol. 11, no. 1, pp. 17-21, Feb. 2003.
T.L. Casavant and J.G. Kuhl, “A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems,” IEEE Trans. Software Eng., vol. 14, no. 2, pp. 141-154, Feb. 1988.
D. Karger and M. Ruhl, “Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems,” Proc. 16th ACM Symp. Parallel Algorithms and Architectures (SPAA ’04), pp. 36-43, June 2004.
S. Saroiu, P.K. Gummadi, and S.D. Gribble, “Measurement Study of Peer-to-Peer File Sharing Systems,” Proc. Multimedia Computing and Networking (MMCN ’02), Jan. 2002.
A. Rao, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica, “Load Balancing in Structured P2P Systems,” Proc. Second Int’l Workshop Peer-to-Peer Systems (IPTPS ’02), pp. 68-79, Feb. 2003.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2012 The Research Publication
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
