The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (2011 vol.22)
pp: 1350-1364
Ioannis Konstantinou , National Technical University of Athens, Athens
Dimitrios Tsoumakos , National Technical University of Athens, Athens
Nectarios Koziris , National Technical University of Athens, Athens
ABSTRACT
Distributed systems such as Peer-to-Peer overlays have been shown to efficiently support the processing of range queries over large numbers of participating hosts. In such systems, uneven load allocation has to be effectively tackled in order to minimize overloaded peers and optimize their performance. In this work, we detect the two basic methodologies used to achieve load-balancing: Iterative key redistribution between neighbors and node migration. We identify these two key mechanisms and describe their relative advantages and disadvantages. Based on this analysis, we propose NIXMIG, a hybrid method that adaptively utilizes these two extremes to achieve both fast and cost-effective load-balancing in distributed systems that support range queries. We theoretically prove its convergence and as a case study, we offer an implementation on top of a Skip Graph, where we thoroughly validate our findings in a variety of static, dynamic and realistic workloads. We compare NIXMIG with an existing load-balancing algorithm proposed by Karger and Ruhl [1] and our experimental analysis shows that, NIXMIG can be as much as three times faster, requiring only one sixth and one third of message and item exchanges, respectively, to bring the system to a balanced state.
INDEX TERMS
Peer-to-peer systems, load-balancing, range queries.
CITATION
Ioannis Konstantinou, Dimitrios Tsoumakos, Nectarios Koziris, "Fast and Cost-Effective Online Load-Balancing in Distributed Range-Queriable Systems", IEEE Transactions on Parallel & Distributed Systems, vol.22, no. 8, pp. 1350-1364, August 2011, doi:10.1109/TPDS.2010.200
REFERENCES
[1] D.R. Karger and M. Ruhl, "Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems," Theory of Computing Systems, vol. 39, pp. 787-804, Nov. 2006.
[2] M. Cha, H. Kwak, P. Rodriguez, Y. Ahn, and S. Moon, "I Tube, You Tube, Everybody Tubes: Analyzing the World's Largest User Generated Content Video System," Proc. Seventh ACM SIGCOMM Conf. Internet Measurement, 2007.
[3] S. Sen and J. Wong, "Analyzing Peer-to-Peer Traffic Across Large Networks," Proc. ACM SIGCOMM Internet Measurements Workshop, 2002.
[4] J. Jung, B. Krishnamurthy, and M. Rabinovich, "Flash Crowds and Denial of Service Attacks: Characterization and Implications for CDNs and Web Sites," Proc. Int'l Conf. World Wide Web (WWW), 2002.
[5] Y. Vigfusson, A. Silberstein, B.F. Cooper, and R. Fonseca, "Adaptively Parallelizing Distributed Range Queries," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2009.
[6] B. Knutsson, H. Lu, W. Xu, and B. Hopkins, "Peer-to-Peer Support for Massively Multiplayer Games," Proc. IEEE INFOCOM, 2004.
[7] Q. Luo and J.F. Naughton, "Form-Based Proxy Caching for Database-Backed Web Sites," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 191-200, 2001.
[8] S.Y. Lee, T.W. Ling, and H.-G. Li, "Hierarchical Compact Cube for Range-Max Queries," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 232-241, 2000.
[9] F. Dabek, M.F. Kaashoek, D. Karger, R. Morris, and I. Stoica, "Wide-Area Cooperative Storage with CFS," ACM SIGOPS Operating Systems Rev., vol. 35, no. 5, pp. 202-215, 2001.
[10] 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), pp. 68-79, 2003.
[11] S. Surana, B. Godfrey, K. Lakshminarayanan, R. Karp, and I. Stoica, "Load Balancing in Dynamic Structured Peer-to-Peer Systems," Performance Evaluation, vol. 63, no. 3, pp. 217-240, 2006.
[12] 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.
[13] C. Chen and K. Tsai, "The Server Reassignment Problem for Load Balancing in Structured P2P Systems," IEEE Trans. Parallel and Distributed Systems, vol. 19, no. 2, pp. 234-246, Feb. 2008.
[14] D. Li, J. Cao, X. Lu, and K. Chen, "Efficient Range Query Processing in Peer-to-Peer Systems," IEEE Trans. Knowledge and Data Eng., vol. 21, no. 1, pp. 78-91, Jan. 2009.
[15] P. Ganesan, M. Bawa, and H. Garcia-Molina, "Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 444-455, 2004.
[16] J. Aspnes, J. Kirsch, and A. Krishnamurthy, "Load Balancing and Locality in Range-Queriable Data Structures," Proc. Ann. ACM Symp. Principles of Distributed Computing (PODC), pp. 115-124, 2004.
[17] A.R. Bharambe, M. Agrawal, and S. Seshan, "Mercury: Supporting Scalable Multi-Attribute Range Queries," ACM SIGCOMM Computer Comm. Rev., vol. 34, no. 4, pp. 353-366, 2004.
[18] Q.H. Vu, B.C. Ooi, M. Rinard, and K.L. Tan, "Histogram-Based Global Load Balancing in Structured Peer-to-Peer Systems," IEEE Trans. Knowledge and Data Eng., vol. 21, no. 4, pp. 595-608, Apr. 2009.
[19] H. Shen and C.Z. Xu, "Locality-Aware and Churn-Resilient Load-Balancing Algorithms in Structured Peer-to-Peer Networks," IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 6, pp. 849-862, June 2007.
[20] H. Shen and C. Xu, "Hash-Based Proximity Clustering for Efficient Load Balancing in Heterogeneous DHT Networks," J. Parallel and Distributed Computing, vol. 68, no. 5, pp. 686-702, 2008.
[21] Y.J. Joung, "Approaching Neighbor Proximity and Load Balance for Range Query in P2P Networks," Computer Networks, vol. 52, no. 7, pp. 1451-1472, 2008.
[22] I. Konstantinou, D. Tsoumakos, and N. Koziris, "Measuring the Cost of Online Load-Balancing in Distributed Range-Queriable Systems," Proc. IEEE Ninth Int'l Conf. Peer-to-Peer Computing (P2P), pp. 135-138, 2009.
[23] J. Aspnes and G. Shah, "Skip Graphs," ACM Trans. Algorithms, vol. 3, p. 37, 2007.
[24] P. Berenbrink, T. Friedetzky, and Z. Hu, "A New Analytical Method for Parallel, Diffusion-Type Load Balancing," J. Parallel and Distributed Computing, vol. 69, no. 1, pp. 54-61, 2009.
[25] G. Cybenko, "Dynamic Load Balancing for Distributed Memory Multiprocessors," J. Parallel and Distributed Computing, vol. 7, no. 2, pp. 279-301, 1989.
[26] B. Ghosh and S. Muthukrishnan, "Dynamic Load Balancing by Random Matchings," J. Computer and System Sciences, vol. 53, no. 3, pp. 357-370, Dec. 1996.
[27] C. Damgaard and J. Weiner, "Describing Inequality in Plant Size or Fecundity," Ecology, vol. 81, no. 4, pp. 1139-1142, 2000.
[28] T. Pitoura, N. Ntarmos, and P. Triantafillou, "Replication, Load Balancing and Efficient Range Query Processing in DHTs," Proc. 10th Int'l Conf. Extending Database Technology (EDBT), pp. 131-148, 2006.
[29] I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications," SIGCOMM Comput. Comm. Rev., vol. 31, pp. 149-160, 2001.
[30] G.S. Manku, "Balanced Binary Trees for ID Management and Load Balance in Distributed Hash Tables," Proc. Ann. ACM Symp. Principles of Distributed Computing (PODC), pp. 197-205, 2004.
[31] P.B. Godfrey and I. Stoica, "Heterogeneity and Load Balance in Distributed Hash Tables," Proc. IEEE INFOCOM, vol. 1, pp. 596-606, 2005.
27 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool