Measuring the Cost of Online Load-Balancing in Distributed Range-Queriable Systems

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 and analyze the two basic methodologies used to achieve load-balancing: Iterative key re-distribution between neighbors and node migration. Based on this analysis, we propose 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. As a case study, we offer an implementation on top of a Skip Graph, where we validate our findings in a variety of workloads. Our experimental analysis shows that the hybrid method converges 10% faster than simple neighbor item exchanges and is more than 70% bandwidth efficient compared to simple node migrations.

• Type: Conference
• Year: 2009
• Where: P2P
• Authors: Ioannis Konstantinou, Dimitrios Tsoumakos, Nectarios Koziris
• Keywords: Distributed Systems, Node Migrations, P2P 2009, Peer-to-Peer Computing, Range Queries