Article

SkipNet: a scalable overlay network with practical locality properties

Authors:

Nicholas J. A. Harvey,

Michael B. Jones,

Marvin Theimer,

Alec WolmanAuthors Info & Claims

USITS'03: Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4

Page 9

Published: 26 March 2003 Publication History

Abstract

Scalable overlay networks such as Chord, CAN, Pastry, and Tapestry have recently emerged as flexible infrastructure for building large peer-to-peer systems. In practice, such systems have two disadvantages: They provide no control over where data is stored and no guarantee that routing paths remain within an administrative domain whenever possible. SkipNet is a scalable overlay network that provides controlled data placement and guaranteed routing locality by organizing data primarily by string names. SkipNet allows for both fine-grained and coarse-grained control over data placement: Content can be placed either on a pre-determined node or distributed uniformly across the nodes of a hierarchical naming sub-tree. An additional useful consequence of SkipNet's locality properties is that partition failures, in which an entire organization disconnects from the rest of the system, can result in two disjoint, but well-connected overlay networks.

References

[1]

{1} J. Aspnes and G. Shah. Skip Graphs. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, Jan. 2003.]]

[2]

{2} L. F. Cabrera, M. B. Jones, and M. Theimer. Herald: Achieving a global event notification service. In HotOS VIII, May 2001.]]

[3]

{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]

{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]

{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]

{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]

{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]

{8} J. R. Douceur. The Sybil Attack. In First International Workshop on Peer-to-Peer Systems (IPTPS '02), Mar. 2002.]]

[9]

{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]

{10} Gnutella. http://www.gnutelliums.com/.]]

[11]

{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]

{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]

{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]

{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]

{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]

{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]

{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]

{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]

{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]

{20} W. Pugh. Skip Lists: A Probabilistic Alternative to Balanced Trees. In Workshop on Algorithms and Data Structures, 1989.]]

[21]

{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]

{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]

{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]

{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]

{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]

{26} S. Saroiu, P. K. Gummadi, and S. D. Gribble. A measurement study of peer-to-peer file sharing systems. In Proceedings of Multi-media Computing and Networking, San Jose, CA, USA, Jan. 2002.]]

[27]

{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]

{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]

{29} M. Theimer and M. B. Jones. Overlook: Scalable Name Service on an Overlay Network. In Proceedings of the 22nd ICDCS, July 2002.]]

[30]

{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]

{31} E. W. Zegura, K. L. Calvert, and S. Bhattacharjee. How to Model an Internetwork. In Proceedings of IEEE Infocom '96, April 1996.]]

[32]

{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.]]

Cited By

Wang LZhang YXu JXue GNoh SWelch B(2020)MAPXProceedings of the 18th USENIX Conference on File and Storage Technologies10.5555/3386691.3386693(1-12)Online publication date: 24-Feb-2020
https://dl.acm.org/doi/10.5555/3386691.3386693
Thomas SMendes HRobinson PEllen F(2019)Layering Data Structures over Skip Graphs for Increased NUMA LocalityProceedings of the 2019 ACM Symposium on Principles of Distributed Computing10.1145/3293611.3331576(422-424)Online publication date: 16-Jul-2019
https://dl.acm.org/doi/10.1145/3293611.3331576
Kryukov ADemichev A(2018)Decentralized Data StoragesProgramming and Computing Software10.1134/S036176881805006744:5(303-315)Online publication date: 1-Sep-2018
https://dl.acm.org/doi/10.1134/S0361768818050067
Show More Cited By

Index Terms

SkipNet: a scalable overlay network with practical locality properties

Recommendations

Deterministic SkipNet

We present a deterministic scalable overlay network. In contrast, most previous overlay networks use randomness or hashing (pseudo-randomness) to achieve a uniform distribution of data and routing traffic.
Routing algorithm using skipnet and small-world for peer-to-peer system
GCC'05: Proceedings of the 4th international conference on Grid and Cooperative Computing

In this paper, we design a new routing algorithm using SkipNet and Small-World for peer-to-peer system. The algorithm divides the routing space into two layers, SkipNet layer and Small-World layer. In the SkipNet layer, the routing method using numeric ...
An efficient and secure overlay network for general peer-to-peer systems

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

USITS'03: Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4

March 2003

284 pages

Publisher

USENIX Association

United States

Publication History

Published: 26 March 2003

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

146
Total Citations
View Citations
58
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Wang LZhang YXu JXue GNoh SWelch B(2020)MAPXProceedings of the 18th USENIX Conference on File and Storage Technologies10.5555/3386691.3386693(1-12)Online publication date: 24-Feb-2020
https://dl.acm.org/doi/10.5555/3386691.3386693
Thomas SMendes HRobinson PEllen F(2019)Layering Data Structures over Skip Graphs for Increased NUMA LocalityProceedings of the 2019 ACM Symposium on Principles of Distributed Computing10.1145/3293611.3331576(422-424)Online publication date: 16-Jul-2019
https://dl.acm.org/doi/10.1145/3293611.3331576
Kryukov ADemichev A(2018)Decentralized Data StoragesProgramming and Computing Software10.1134/S036176881805006744:5(303-315)Online publication date: 1-Sep-2018
https://dl.acm.org/doi/10.1134/S0361768818050067
Andriopoulou FBirkos KLymberopoulos D(2017)A Novel Hierarchical Group-Based Overlay Healthcare NetworkInternational Journal of E-Health and Medical Communications10.4018/IJEHMC.20171001058:4(81-102)Online publication date: 1-Oct-2017
https://dl.acm.org/doi/10.4018/IJEHMC.2017100105
Schmid SAvin CScheideler CBorokhovich MHaeupler BLotker Z(2016)SplayNetIEEE/ACM Transactions on Networking10.1109/TNET.2015.241031324:3(1421-1433)Online publication date: 1-Jun-2016
https://dl.acm.org/doi/10.1109/TNET.2015.2410313
Chen CJacobsen HVitenberg R(2016)Algorithms based on divide and conquer for topic-based publish/subscribe overlay designIEEE/ACM Transactions on Networking10.1109/TNET.2014.236934624:1(422-436)Online publication date: 1-Feb-2016
https://dl.acm.org/doi/10.1109/TNET.2014.2369346
Hong C(2016)A locality-aware resource management scheme for the hierarchical P2P systemMultimedia Tools and Applications10.1007/s11042-014-1854-075:9(5013-5027)Online publication date: 1-May-2016
https://dl.acm.org/doi/10.1007/s11042-014-1854-0
Gu YBoukerche ADe Grande R(2016)Supporting multidimensional range queries in Hierarchically Distributed TreeConcurrency and Computation: Practice & Experience10.1002/cpe.316028:6(1848-1869)Online publication date: 25-Apr-2016
https://dl.acm.org/doi/10.1002/cpe.3160
Eikel MScheideler C(2015)IRISACM Transactions on Parallel Computing10.1145/28098062:3(1-33)Online publication date: 2-Nov-2015
https://dl.acm.org/doi/10.1145/2809806
Vasilomanolakis EKaruppayah SMühlhäuser MFischer M(2015)Taxonomy and Survey of Collaborative Intrusion DetectionACM Computing Surveys10.1145/271626047:4(1-33)Online publication date: 11-May-2015
https://dl.acm.org/doi/10.1145/2716260
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Table of Contents