Load-Balancing performance of consistent hashing: asymptotic analysis of random node join

DMCA

Load-Balancing performance of consistent hashing: asymptotic analysis of random node join (2007)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Xiaoming Wang , Dmitri Loguinov

Venue:	IN IEEE/ACM TRANS. ON NETWORKING
Citations:	8 - 1 self

BibTeX

@INPROCEEDINGS{Wang07load-balancingperformance,
    author = {Xiaoming Wang and Dmitri Loguinov},
    title = {Load-Balancing performance of consistent hashing: asymptotic analysis of random node join},
    booktitle = {IN IEEE/ACM TRANS. ON NETWORKING},
    year = {2007},
    publisher = {}
}

OpenURL

Abstract

Balancing of structured peer-to-peer graphs, including their zone sizes, has recently become an important topic of distributed hash table (DHT) research. To bring analytical understanding into the various peer-join mechanisms based on consistent hashing, we study how zone-balancing decisions made during the initial sampling of the peer space affect the resulting zone sizes and derive several asymptotic bounds for the maximum and minimum zone sizes that hold with high probability. Several of our results contradict those of prior work and shed new light on the theoretical performance limitations of consistent hashing. We use simulations to verify our models and compare the performance of the various methods using the example of recently proposed de

Keyphrases

consistent hashing load-balancing performance random node join asymptotic analysis zone size structured peer-to-peer graph new light analytical understanding zone-balancing decision various peer-join mechanism prior work various method important topic initial sampling peer space derive several asymptotic bound high probability theoretical performance limitation minimum zone distributed hash table

DMCA