A Lightweight Approach to Network Positioning

This paper describes a peer-to-peer overlay network for performing location-aware node and path selection in largescale distributed systems. Our system, Meridian, provides a simple, lightweight and scalable framework for keeping track of locationinformation for participating nodes. The framework is based on local, relative coordinate systems in multi-resolution rings, direct measurement with scalable node-to-node handoff, and gossip protocols for dissemination. Large scale simulations and an implementation deployed on PlanetLab show that the framework can locate the closest node to given target with less than a 5ms median error, and the simplicity of the approach lends itself to a compact implementation.

[1]  J. Bourgain.  On lipschitz embedding of finite metric spaces in Hilbert space , 1985 .

[2]  Doug Terry,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[3]  Michael F. Schwartz,et al.  Locating nearby copies of replicated Internet servers , 1995, SIGCOMM '95.

[4]  Mark Crovella,et al.  Server selection using dynamic path characterization in wide-area networks , 1997, Proceedings of INFOCOM '97.

[5]  Ellen W. Zegura,et al.  A novel server selection technique for improving the response time of a replicated service , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[6]  Stefan Savage,et al.  The end-to-end effects of Internet path selection , 1999, SIGCOMM '99.

[7]  Mark Crovella,et al.  On the network impact of dynamic server selection , 1999, Comput. Networks.

[8]  Paul Francis,et al.  IDMaps: a global internet host distance estimation service , 2001, TNET.

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

[10]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

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

[12]  Bobby Bhattacharjee,et al.  Finding close friends on the Internet , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[13]  David R. Karger,et al.  Wide-area cooperative storage with CFS , 2001, SOSP.

[14]  Antony I. T. Rowstron,et al.  Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility , 2001, SOSP.

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

[16]  Kirk L. Johnson,et al.  The measured performance of content distribution networks , 2001, Comput. Commun..

[17]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[18]  Mark Handley,et al.  Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[19]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[20]  Randy H. Katz,et al.  Backup path allocation based on a correlated link failure probability model in overlay networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[21]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..

[22]  David R. Karger,et al.  Finding nearest neighbors in growth-restricted metrics , 2002, STOC '02.

[23]  Peter Druschel,et al.  Exploiting network proximity in peer-to-peer overlay networks , 2002 .

[24]  Krishna P. Gummadi,et al.  King: estimating latency between arbitrary internet end hosts , 2002, IMW '02.

[25]  Hui Zhang,et al.  Predicting Internet network distance with coordinates-based approaches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[26]  John Kubiatowicz,et al.  Introspective failure analysis: avoiding correlated failures in peer-to-peer systems , 2002, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings..

[27]  Mark Crovella,et al.  Virtual landmarks for the internet , 2003, IMC '03.

[28]  Jon Crowcroft,et al.  Lighthouses for Scalable Distributed Location , 2003, IPTPS.

[29]  Yuval Shavitt,et al.  Big-Bang simulation for embedding network distances in Euclidean space , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[30]  Peter Druschel,et al.  Proximity Neighbor Selection in Tree-Based Structured Peer-to-Peer Overlays , 2003 .

[31]  Mary Baker,et al.  Preserving peer replicas by rate-limited sampled voting , 2003, SOSP '03.

[32]  Hui Zhang,et al.  A Network Positioning System for the Internet , 2004, USENIX Annual Technical Conference, General Track.

[33]  Miguel Castro,et al.  PIC: practical Internet coordinates for distance estimation , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[34]  Richard Lawrence.  Running Massively Multiplayer Games as a Business , 2004, NSDI.

[35]  David E. Culler,et al.  Operating Systems Support for Planetary-Scale Network Services , 2004, NSDI.

[36]  Ben Y. Zhao,et al.  Distributed Object Location in a Dynamic Network , 2004, Theory of Computing Systems.

[37]  Robert Tappan Morris,et al.  Practical, distributed network coordinates , 2004, Comput. Commun. Rev..

[38]  Hyuk Lim,et al.  Constructing Internet coordinate system based on delay measurement , 2003, IEEE/ACM Transactions on Networking.