When Multi-Hop Peer-to-Peer Routing Matters

Download: ps, pdf.

“When Multi-Hop Peer-to-Peer Routing Matters” by Rodrigo Rodrigues and Charles Blake. In 3rd International Workshop on Peer-to-Peer Systems (IPTPS), Feb. 2004.

Abstract

Distributed hash tables have been around for a long time. A number of recent projects propose peerto- peer DHTs, based on multi-hop lookup optimizations. Some of these systems also require data permanence. This paper presents an analysis of when these optimizations are useful. We conclude that the multihop optimizations make sense only for truly vast and very dynamic peer networks. We also observe that resource trends indicate this scale is on the rise.

Download: ps, pdf.

BibTeX entry:

@inproceedings{rodrigues04multihop,
   author = {Rodrigo Rodrigues and Charles Blake},
   title = {When Multi-Hop Peer-to-Peer Routing Matters},
   booktitle = {3rd International Workshop on Peer-to-Peer Systems (IPTPS)},
   month = feb,
   year = {2004}
}