The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (2011 vol.22)
pp: 634-649
Hung-Chang Hsiao , National Cheng-Kung University, Tainan
Hao Liao , National Cheng-Kung University, Tainan
Ssu-Ta Chen , National Cheng-Kung University, Tainan
Kuo-Chan Huang , National Cheng-Kung University, Tainan
ABSTRACT
With 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. The existing and decentralized load balance algorithms designed for the heterogeneous, structured P2P networks either explicitly construct auxiliary networks to manipulate global information or implicitly demand the P2P substrates organized in a hierarchical fashion. Without relying on any auxiliary networks and independent of the geometry of the P2P substrates, we present, in this paper, a novel load balancing algorithm that is unique in that each participating peer is based on the partial knowledge of the system to estimate the probability distributions of the capacities of peers and the loads of virtual servers, resulting in imperfect knowledge of the system state. With the imperfect system state, peers can compute their expected loads and reallocate their loads in parallel. Through extensive simulations, we compare our proposal to prior load balancing algorithms.
INDEX TERMS
Peer-to-peer systems, load balance, heterogeneity.
CITATION
Hung-Chang Hsiao, Hao Liao, Ssu-Ta Chen, Kuo-Chan Huang, "Load Balance with Imperfect Information in Structured Peer-to-Peer Systems", IEEE Transactions on Parallel & Distributed Systems, vol.22, no. 4, pp. 634-649, April 2011, doi:10.1109/TPDS.2010.105
REFERENCES
[1] 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. Networking, vol. 11, no. 1, pp. 17-21, Feb. 2003.
[2] A. Rowstron 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.
[3] S. Surana, B. Godfrey, K. Lakshminarayanan, R. Karp, and I. Stoica, "Load Balancing in Dynamic Structured P2P Systems," Performance Evaluation, vol. 63, no. 6, pp. 217-240, Mar. 2006.
[4] Y. Zhu and Y. Hu, "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.
[5] H. Shen 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.
[6] L.M. Ni and K. Hwang, "Optimal Load Balancing in a Multiple Processor System with Many Job Classes," IEEE Trans. Software Eng., vol. 11, no. 5, pp. 491-496, May 1985.
[7] L.M. Ni, C.-W. Xu, and T.B. Gendreau, "A Distributed Drafting Algorithm for Load Balancing," IEEE Trans. Software Eng., vol. 11, no. 10, pp. 1153-1161, Oct. 1985.
[8] C. Chen and K.-C. Tsai, "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.
[9] 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.
[10] Y. Zhu, "Load Balancing in Structured P2P Networks," Handbook of Peer-to-Peer Networking, Springer, July 2009.
[11] 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.
[12] 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.
[13] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., 1979.
[14] F. Dabek, M.F. Kaashoek, D. Karger, R. Morris, and I. Stoica, "Wide-Area Cooperative Storage with CFS," Proc. 18th ACM Symp. Operating Systems Principles (SOSP '01), pp. 202-215, Oct. 2001.
[15] G.H. Gonnet, "Expected Length of the Longest Probe Sequence in Hash Code Searching," J. ACM, vol. 28, no. 2, pp. 289-304, Apr. 1981.
[16] D. Eastlake and P. Jones, "US Secure Hash Algorithm 1 (SHA1)," RFC 3174, Sept. 2001.
[17] N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, and E. Teller, "Equations of State Calculations by Fast Computing Machines," J. Chemical Physics, vol. 21, no. 6, pp. 1087-1092, June 1953.
[18] W.K. Hastings, "Monte Carlo Sampling Methods Using Markov Chains and Their Applications," Biometrika, vol. 57, no. 1, pp. 97-109, Apr. 1970.
[19] S.M. Ross, "Markov Chains," Introduction to Probability Models, ninth ed., pp. 185-280, Academic Press, 2007.
[20] M. Mitzenmacher and E. Upfal, "Coupling of Markov Chains," Probability and Computing: Randomized Algorithms and Probabilistic Analysis, pp. 271-294, Cambridge Univ. Press, 2005.
[21] P. Diaconis and D. Stroock, "Geometric Bounds for Eigenvalues of Markov Chains," The Annals of Applied Probability, vol. 1, no. 1, pp. 36-61, Feb. 1991.
[22] A. Sinclair, "Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow," Combinatorics, Probability and Computing, vol. 1, no. 4, pp. 351-370, Dec. 1992.
[23] H. Chernoff, "A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations," Annals of Math. Statistics, vol. 23, no. 4, pp. 493-507, 1952.
[24] 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.
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool