“Achieving One-Hop DHT Lookup and Strong Stabilization by Passing Tokens” by Ben Leong and Ji Li. In 12th International Conference on Networks (ICON), (Singapore), Nov. 2004.
Recent research has demonstrated that if network churn is not excessively high, it becomes entirely reasonable for a DHT to store a global lookup table at every node to achieve one-hop lookup. We present a novel algorithm for maintaining global lookup state in a DHT with a Chord-like circular address space. In our DHT, events are disseminated with a parallelized token-passing algorithm using dynamically-constructed dissemination trees rooted at the source of the events. We show that we are able to achieve good one- and two-hop routing performance at a modest cost in terms of bandwidth. Furthermore, our scheme is bandwidth-adaptive, and automatically detects and repairs global address space inconsistencies.
BibTeX entry:
@inproceedings{leong04achieving,
author = {Ben Leong and Ji Li},
title = {Achieving One-Hop DHT Lookup and Strong Stabilization by
Passing Tokens},
booktitle = {12th International Conference on Networks (ICON)},
address = {Singapore},
month = nov,
year = {2004}
}
Programming Methodology Group