论文信息 - When Multi-Hop Peer-to-Peer Routing Matters

When Multi-Hop Peer-to-Peer Routing Matters

Distributed hash tables have been around for a long time [1, 2]. A number of recent projects propose peer-to-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 multi-hop 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.

Rodrigo Rodrigues | Charles Blake

[1] Anjali Gupta,et al. Efficient Routing for Peer-to-Peer Overlays , 2004, NSDI.

[2] Rodrigo Rodrigues,et al. Proceedings of Hotos Ix: the 9th Workshop on Hot Topics in Operating Systems Hotos Ix: the 9th Workshop on Hot Topics in Operating Systems High Availability, Scalable Storage, Dynamic Peer Networks: Pick Two , 2022 .

[3] Witold Litwin,et al. LH* - Linear Hashing for Distributed Files , 1993, SIGMOD Conference.

[4] Stefan Savage,et al. Understanding Availability , 2003, IPTPS.

[5] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM '01.

[6] Peter Druschel,et al. Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[7] Ben Y. Zhao,et al. Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination , 2001, NOSSDAV '01.

[8] David Mazières,et al. Sloppy Hashing and Self-Organizing Clusters , 2003, IPTPS.

[9] David E. Culler,et al. Scalable, distributed data structures for internet service construction , 2000, OSDI.

[10] Anne-Marie Kermarrec,et al. Scribe: A Large-Scale and Decentralized , 2002 .

[11] Mark Handley,et al. Application-Level Multicast Using Content-Addressable Networks , 2001, Networked Group Communication.