On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks (2003)

by Jun Xu
Citations:65 - 2 self

Documents Related by Co-Citation

3473 Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications – Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan - 2001
297 Viceroy: A Scalable and Dynamic Emulation of the Butterfly – Dahlia Malkhi, Moni Naor, David Ratajczak - 2002
2700 A Scalable Content-Addressable Network – Sylvia Ratnasamy , Paul Francis, Mark Handley, Richard Karp, Scott Shenker - 2001
1697 Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems – Antony Rowstron, Peter Druschel - 2001
104 Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience – Dmitri Loguinov, Anuj Kumar, Vivek Rai, Sai Ganesh - 2003
443 Tapestry: A Resilient Global-scale Overlay for Service Deployment – Ben Y. Zhao, Ling Huang, Jeremy Stribling, Sean C. Rhea, Anthony D. Joseph, John D. Kubiatowicz - 2004
1039 Tapestry: An infrastructure for fault-tolerant wide-area location and routing – Ben Y. Zhao, John Kubiatowicz, Anthony D. Joseph, Ben Y. Zhao, John Kubiatowicz, Anthony D. Joseph - 2001
560 Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications – Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger, M. Frans Kaashoek, Frank Dabek, Hari Balakrishnan - 2001
170 Koorde: A simple degree-optimal distributed hash table – M. Frans Kaashoek , David R. Karger - 2003
562 Kademlia: A Peer-to-peer Information System Based on the XOR Metric РPetar Maymounkov, David Mazi̬res - 2002
247 The Impact of DHT Routing Geometry on Resilience and Proximity – Krishna Gummadi, Ramakrishna Gummadi, Steve Gribble, Sylvia Ratnasamy, Scott Shenker, Ion Stoica - 2003
89 Koorde: A Simple Degree-optimal Hash Table – F Kaashoek, D R Karger - 2003
133 Routing Algorithms for DHTs: Some Open Questions – Sylvia Ratnasamy, Scott Shenker, Ion Stoica - 2002
1425 Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems – Antony Rowstron, Peter Druschel - 2001
104 Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead – Indranil Gupta, Ken Birman, Prakash Linga, Al Demers, Robbert van Renesse - 2003
529 Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web – David Karger, Eric Lehman, Tom Leighton, Matthew Levine, Daniel Lewin, Rina Panigrahy Abstract - 1997
143 Novel Architectures for P2P Applications: the Continuous-Discrete Approach – Moni Naor, Udi Wieder - 2007
191 Analysis of the Evolution of Peer-to-Peer Systems – David Liben-nowell, Hari Balakrishnan, David Karger - 2002
337 Handling Churn in a DHT – Sean Rhea, Dennis Geels, Timothy Roscoe, John Kubiatowicz - 2004