SkipNet: A Scalable Overlay Network with Practical Locality Properties

4th USENIX Symposium on Internet Technologies and Systems, USITS 2003

Volumn , Issue , 2003, Pages

  Harvey, Nicholas J A ^a,b   Jones, Michael B ^a   Saroiu, Stefan ^b   Theimer, Marvin ^a   Wolman, Alec ^a  

^a MICROSOFT RESEARCH   (United States)

^b University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OVERLAY NETWORKS;

COARSE-GRAINED; DATA PLACEMENT; FINE GRAINED; PEER-TO-PEER SYSTEM; ROUTING PATH; SKIP-NET; SUB TREES;

PEER TO PEER NETWORKS;

EID: 85018056423     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. J. Aspnes and G. Shah. Skip Graphs. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, Jan. 2003.
2. L. F. Cabrera, M. B. Jones, and M. Theimer. Herald: Achieving a global event notification service. In HotOS VIII, May 2001.
3. M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. Wallach. Security for peer-to-peer routing overlays. In Proceedings of the Fifth OSDI, Dec. 2002.
4. M. Castro, P. Druschel, Y. C. Hu, and A. Rowstron. Topology-aware routing in structured peer-to-peer overlay networks. Technical Report MSR-TR-2002-82, Microsoft Research, 2002.
5. Y.-H. Chu, S. G. Rao, and H. Zhang. A case for end system multicast. In ACM SIGMETRICS 2000, pages 1–12, June 2000.
6. I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong. Freenet: A Distributed Anonymous Information Storage and Retrieval System. In Workshop on Design Issues in Anonymity and Unobservability, pages 311–320, July 2000.
7. F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In 18th Symposium on Operating Systems Principles, Oct. 2001.
8. J. R. Douceur. The Sybil Attack. In First International Workshop on Peer-to-Peer Systems (IPTPS’02), Mar. 2002.
9. 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 22nd ICDCS, July 2002.
10. Gnutella. http://www.gnutelliums.com/.
11. S. Gribble, E. Brewer, J. Hellerstein, and D. Culler. Scalable, distributed data structures for Internet service construction. In Proceedings of the Fourth OSDI, Oct. 2000.
12. N. J. A. Harvey, J. Dunagan, M. B. Jones, S. Saroiu, M. Theimer, and A. Wolman. SkipNet: A Scalable Overlay Network with Practical Locality Properties. Technical Report MSR-TR-2002-92, Microsoft Research, 2002.
13. N. J. A. Harvey, M. B. Jones, M. Theimer, and A. Wolman. Efficient Recovery From Organizational Disconnects in SkipNet. In Second International Workshop on Peer-to-Peer Systems (IPTPS ’03), Feb. 2003.
14. S. Iyer, A. Rowstron, and P. Druschel. Squirrel: A decentralized, peer-to-peer web cache. In Proceedings of the 21st Annual PODC, July 2002.
15. D. Karger, E. Lehman, F. Leighton, M. Levine, D. Lewin, and R. Panigraphy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the 29th Annual STOC, May 1997.
16. P. Keleher, S. Bhattacharjee, and B. Silaghi. Are Virtualized Overlay Networks Too Much of a Good Thing? In First International Workshop on Peer-to-Peer Systems (IPTPS’02), Mar. 2002.
17. C. Labovitz and A. Ahuja. Experimental Study of Internet Stability and Wide-Area Backbone Failures. In Fault-Tolerant Computing Symposium (FTCS), June 1999.
18. D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: A Scalable and Dynamic Emulation of the Butterfly. In Proceedings of the 21st Annual PODC, July 2002.
19. D. Oppenheimer, A. Ganapathi, and D. A. Patterson. Why do Internet services fail, and what can be done about it? In Proceedings of 4th USITS, Mar. 2003.
20. W. Pugh. Skip Lists: A Probabilistic Alternative to Balanced Trees. In Workshop on Algorithms and Data Structures, 1989.
21. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-Addressable Network. In Proceedings of ACM SIGCOMM, Aug. 2001.
22. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker. Application-level Multicast using Content-Addressable Networks. In Proceedings of the Third International Workshop on Networked Group Communication, Nov. 2001.
23. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In International Conference on Distributed Systems Platforms (Middleware), pages 329–350, Heidelberg, Germany, Nov. 2001.
24. A. Rowstron and P. Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In 18th Symposium on Operating Systems Principles, Oct. 2001.
25. A. Rowstron, A.-M. Kermarrec, M. Castro, and P. Druschel. Scribe: The design of a large-scale event notification infrastructure. In Third International Workshop on Networked Group Communications, Nov 2001.
26. 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, San Jose, CA, USA, Jan. 2002.
27. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications. In Proceedings of ACM SIGCOMM, Aug. 2001.
28. H. Tangmunarunkit, R. Govindan, S. Shenker, and D. Estrin. The Impact of Routing Policy on Internet Paths. In Proceedings of IEEE INFOCOM 2001, April 2001.
29. M. Theimer and M. B. Jones. Overlook: Scalable Name Service on an Overlay Network. In Proceedings of the 22nd ICDCS, July 2002.
30. A. Vahdat, J. Chase, R. Braynard, D. Kostic, and A. Rodriguez. Self-Organizing Subsets: From Each According to His Abilities, To Each According to His Needs. In First International Workshop on Peer-to-Peer Systems (IPTPS’02), March 2002.
31. E. W. Zegura, K. L. Calvert, and S. Bhattacharjee. How to Model an Internetwork. In Proceedings of IEEE Infocom’96, April 1996.
32. B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An Infrastructure for Fault-Resilient Wide-area Location and Routing. Technical Report UCB//CSD-01-1141, UC Berkeley, April 2001.