A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Measuring the cost of online load-balancing in distributed range-queriable systems
2009
2009 IEEE Ninth International Conference on Peer-to-Peer Computing
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
doi:10.1109/p2p.2009.5284544
dblp:conf/p2p/KonstantinouTK09
fatcat:o6va3dxb7ndcxg5yl6l7w2nymu