DMCA
Fast and Cost-Effective Online Load-Balancing in Distributed Range-Queriable Systems
Cached
Download Links
| Citations: | 3 - 1 self |
BibTeX
@MISC{Konstantinou_fastand,
author = {Ioannis Konstantinou and Dimitrios Tsoumakos and Nectarios Koziris},
title = {Fast and Cost-Effective Online Load-Balancing in Distributed Range-Queriable Systems},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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 re-distribution 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. 1
Keyphrases
range query distributed range-queriable system cost-effective online load-balancing index term peer relative advantage balanced state iterative key re-distribution overloaded peer large number load balancing uneven load allocation abstract distributed system hybrid method case study distributed system item exchange basic methodology realistic workload skip graph peer-to-peer overlay node migration key mechanism experimental analysis show cost-effective load-balancing
