Issue No. 08 - August (2011 vol. 22)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2010.200
Ioannis Konstantinou , National Technical University of Athens, Athens
Dimitrios Tsoumakos , National Technical University of Athens, Athens
Nectarios Koziris , National Technical University of Athens, Athens
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  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.
Peer-to-peer systems, load-balancing, range queries.
I. Konstantinou, D. Tsoumakos and N. Koziris, "Fast and Cost-Effective Online Load-Balancing in Distributed Range-Queriable Systems," in IEEE Transactions on Parallel & Distributed Systems, vol. 22, no. , pp. 1350-1364, 2010.