论文信息 - A Common Protocol for Implementing Various DHT Algorithms - 字舞流文

A Common Protocol for Implementing Various DHT Algorithms

This document defines DHT-independent and DHT-dependent features of DHT algorithms and presents a comparison of Chord, Pastry and Kademlia. It then describes key DHT operations and their information requirements.

Henning Schulzrinne | Salman A. Baset | Eunsoo Shim

[1] David Mazières,et al. Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[2] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

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

[4] William Pugh,et al. Skip Lists: A Probabilistic Alternative to Balanced Trees , 1989, WADS.

[5] David R. Karger,et al. Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[6] Ben Y. Zhao,et al. Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[7] David R. Karger,et al. Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.

[8] David R. Karger,et al. Looking up data in P2P systems , 2003, CACM.

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

[10] Brighten Godfrey,et al. OpenDHT: a public DHT service and its uses , 2005, SIGCOMM '05.

[11] Ben Y. Zhao,et al. Towards a Common API for Structured Peer-to-Peer Overlays , 2003, IPTPS.

[12] John Kubiatowicz,et al. Handling churn in a DHT , 2004 .