Network Coordinates in the Wild

Network coordinates provide a mechanism for selecting and placing servers efficiently in a large distributed system. This approach works well as long as the coordinates continue to accurately reflect network topology. We conducted a long-term study of a subset of a million-plus node coordinate system and found that it exhibited some of the problems for which network coordinates are frequently criticized, for example, inaccuracy and fragility in the presence of violations of the triangle inequality. Fortunately, we show that several simple techniques remedy many of these problems. Using the Azureus BitTorrent network as our testbed, we show that live, large-scale network coordinate systems behave differently than their tame PlanetLab and simulation-based counterparts. We find higher relative errors, more triangle inequality violations, and higher churn. We present and evaluate a number of techniques that, when applied to Azureus, efficiently produce accurate and stable network coordinates.

[1]  Yuval Shavitt,et al.  Big-bang simulation for embedding network distances in Euclidean space , 2004, IEEE/ACM Transactions on Networking.

[2]  Walid Dabbous,et al.  Virtual networks under attack: disrupting internet coordinate systems , 2006, CoNEXT '06.

[3]  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.

[4]  David Mazières,et al.  OASIS: Anycast for Any Service , 2006, NSDI.

[5]  Kirk L. Johnson,et al.  Overcast: reliable multicasting with on overlay network , 2000, OSDI.

[6]  Jon Crowcroft,et al.  On the accuracy of embeddings for internet coordinate systems , 2005, IMC '05.

[7]  Playing Vivaldi in Hyperbolic Space , 2006 .

[8]  Robert Tappan Morris,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM '04.

[9]  Randy H. Katz,et al.  On the stability of network distance estimation , 2002, PERV.

[10]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[11]  David Wetherall,et al.  Scriptroute: A Public Internet Measurement Facility , 2003, USENIX Symposium on Internet Technologies and Systems.

[12]  Arthur R. Butz,et al.  Alternative Algorithm for Hilbert's Space-Filling Curve , 1971, IEEE Transactions on Computers.

[13]  Margo I. Seltzer,et al.  Network-Aware Operator Placement for Stream-Processing Systems , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[14]  Margo I. Seltzer,et al.  Stable and Accurate Network Coordinates , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[15]  Sonia Fahmy,et al.  A Hierarchical Approach to Internet Distance Prediction , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[16]  Eng Keong Lua,et al.  Internet Routing Policies and Round-Trip-Times , 2005, PAM.

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

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

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

[20]  Emin Gün Sirer,et al.  Meridian: a lightweight network location service without virtual coordinates , 2005, SIGCOMM '05.

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

[22]  Nathan Linial,et al.  On metric ramsey-type phenomena , 2003, STOC '03.

[23]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[24]  Margo I. Seltzer,et al.  Network-Aware Overlays with Network Coordinates , 2006, 26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06).

[25]  Jon M. Kleinberg,et al.  Metric embeddings with relaxed guarantees , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[26]  Margo I. Seltzer,et al.  Supporting Network Coordinates on PlanetLab , 2005, WORLDS.

[27]  David Peleg,et al.  Sparse communication networks and efficient routing in the plane , 2001, Distributed Computing.

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

[29]  William Chan,et al.  Improving Traffic Locality in BitTorrent via Biased Neighbor Selection , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[30]  Yuval Shavitt,et al.  On the curvature of the Internet and its usage for overlay construction and distance estimation , 2004, IEEE INFOCOM 2004.

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

[32]  Bruce M. Maggs,et al.  Globally Distributed Content Delivery , 2002, IEEE Internet Comput..

[33]  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.

[34]  Akihiro Nakao,et al.  A routing underlay for overlay networks , 2003, SIGCOMM '03.

[35]  David E. Culler,et al.  A blueprint for introducing disruptive technology into the Internet , 2003, CCRV.

[36]  Fabián E. Bustamante,et al.  Friendships that Last: Peer Lifespan and its Role in P2P Protocols , 2003, WCW.

[37]  Ittai Abraham,et al.  Compact routing on euclidian metrics , 2004, PODC '04.