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

Proceedings - IEEE International Conference on Networks, ICON

Volumn 1, Issue , 2004, Pages 344-350

  Leong, Ben ^a   Li, Ji ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADDRESS SPACE; BASIC LOOKUP ALGORITHM; DISTRIBUTED HASH TABLES (DHT); PASSING TOKENS;

ALGORITHMS; BANDWIDTH; CRYPTOGRAPHY; NETWORK PROTOCOLS; PROBABILITY; TELECOMMUNICATION TRAFFIC;

COMPUTER NETWORKS;

EID: 21644457932     PISSN: 15312216     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICON.2004.1409167     Document Type: Conference Paper

References (24)

1. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, "Chord: A scalable Peer-To-Peer lookup service for internet applications," in Proceedings of the 2001 ACM SIGCOMM Conference, August 2001, pp. 149-160.
2. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content-addressable network," in Proceedings of the 2001 ACM SIGCOMM Conference, August 2001.
3. B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph, "Tapestry: An infrastructure for fault-tolerant wide-area location and routing," UC Berkeley, Tech. Rep. UCB/CSD-01-1141, April 2001.
4. A. Rowstron and P. Druschel, "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems," in Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001), November 2001.
5. A. Gupta, B. Liskov, and R. Rodrigues, "Efficient routing for peerto-peer overlays," in Proceedings of the 1st Symposium on Networked Systems Design and Implementation (NSDI2004), March 2004, pp. 113-126.
6. R. Rodrigues and C. Blake, "When multi-hop peer-to-peer routing matters," in Proceedings of the 3rd International Workshop on Peer-to-Peer Systems (IPTPS '04), February 2004.
7. L. Zhou and R. van Renesse, "P6P: A peer-to-peer approach to internet infrastructure," in Proceedings of the 3rd International Workshop on Peer-to-Peer Systems (IPTPS '04), San Diego, CA, February 2004.
8. R. Cox, A. Muthitacharoen, and R. Morris, "Serving DNS using a peer-to-peer lookup service," in Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), MIT Faculty Club, Cambridge, MA, March 2002.
9. V. Ramasubramanian and E. G. Sirer, "Beehive: Exploiting power law query distributions for O(1) lookup performance in peer to peer overlays," in Proceedings of the 1st Symposium on Networked Systems Design and Implementation (NSDI 2004), March 2004.
10. I. Stoica, R. Morris, D. Liben-Nowell, D. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup service for internet applications," MIT LCS, Tech. Rep., 2002.
11. "FIPS 180-1. secure hash standard," US Department of Commerce/NIST, Tech. Rep., April 1995.
12. J. Byers, J. Considine, and M. Mitzenmacher, "Informed content delivery across adaptive overlay networks," in Proceedings of the 2002 ACM SIGCOMM Conference, August 2002, pp. 47-60.
13. _, "Fast approximate reconciliation of set differences," Boston University, Tech. Rep. TR 2002-019, 2002.
14. Y. Minsky and A. Trachtenberg, "Scalable set reconciliation," in Proceedings of the 40th Annual Allerton Conference on Communication, Control, and Computing, October 2002.
15. C. Villamizar, R. Chandra, and R. Govindan, "BGP route flap damping," November 1998.
16. S. Saroiu, P. K. Gummadi, and S. D. Gribble, "A measurement study of peer-to-peer file sharing systems," in Proceedings of Multimedia Computing and Networking 2002 (MMCN '02), San Jose, CA, USA, January 2002.
17. K. P. Gummadi, R. J. Dunn, S. Saroiu, S. D. Gribble, and J. Z. Henry M. Levy, "Measurement, modeling, and analysis of a peer-to-peer file-sharing workload," in Proceedings of the 19th ACM Symposium on Operating Systems Principles (SOSP '01), Bolton Landing, NY, USA, October 2003.
18. T. M. Gil, F. Kaashoek, J. Li, R. Morris, and J. Stribling, p2psim: a simulator for peer-to-peer protocols. [Online]. Available: http://www.pdos.lcs. mit.edu/p2psim
19. R. Rodrigues, B. Liskov, and L. Shrira, "The design of a robust peer-to-peer system," in Proceedings of the 10th ACM SIGOPS European Workshop, September 2002.
20. J. R. Douceur, A. Adya, W. J. Bolosky, D. Simon, and M. Theimer, "Reclaiming space from duplicate files in a serverless distributed file system," in Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02). IEEE Computer Society, 2002, p. 617.
21. A. Mizrak, Y. Cheng, V. Kumar, and S. Savage, "Structured superpeers: Leveraging heterogeneity to provide constant-time lookup," in Proceedings of the 4th IEEE Workshop on Internet Applications, June 2003.
22. I. Gupta, K. Birman, P. Linga, A. Demers, and R. van Renesse, "Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead," in Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03), February 2003.
23. M. Harchol-Balter, T. Leighton, and D. Lewin, "Resource discovery in distributed networks," in Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing. ACM Press, 1999, pp. 229-237.
24. B. Leong, B. Liskov, and E. D. Demaine, "Epichord: Parallelizing the chord lookup algorithm with reactive routing state management," MIT, Cambridge, MA, Technical Report MIT-LCS-TR-963, August 2004.