Achieving one-hop DHT lookup and strong stabilization by passing tokens

@article{Leong2004AchievingOD,
  title={Achieving one-hop DHT lookup and strong stabilization by passing tokens},
  author={Ben Leong and Ji Li},
  journal={Proceedings. 2004 12th IEEE International Conference on Networks (ICON 2004) (IEEE Cat. No.04EX955)},
  year={2004},
  volume={1},
  pages={344-350 vol.1}
}
Recent research has demonstrated that if network churn is not excessively high, it becomes entirely reasonable for a distributed hash table (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… CONTINUE READING
Highly Cited
This paper has 32 citations. REVIEW CITATIONS