Vivaldi: a decentralized network coordinate system

Large-scale Internet applications can benefit from an ability to predict round-trip times to other hosts without having to contact them first. Explicit measurements are often unattractive because the cost of measurement can outweigh the benefits of exploiting proximity information. Vivaldi is a simple, light-weight algorithm that assigns synthetic coordinates to hosts such that the distance between the coordinates of two hosts accurately predicts the communication latency between the hosts. Vivaldi is fully distributed, requiring no fixed network infrastructure and no distinguished hosts. It is also efficient: a new host can compute good coordinates for itself after collecting latency information from only a few other hosts. Because it requires little com-munication, Vivaldi can piggy-back on the communication patterns of the application using it and scale to a large number of hosts. An evaluation of Vivaldi using a simulated network whose latencies are based on measurements among 1740 Internet hosts shows that a 2-dimensional Euclidean model with height vectors embeds these hosts with low error (the median relative error in round-trip time prediction is 11 percent).

[1]  Chris Savarese LOCATIONING IN DISTRIBUTED AD-HOC WIRELESS SENSOR NETWORKS , 2001 .

[2]  Lakshminarayanan Subramanian,et al.  An investigation of geographic mapping techniques for internet hosts , 2001, SIGCOMM.

[3]  Marcel Waldvogel,et al.  Efficient topology-aware overlay network , 2003, CCRV.

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

[5]  Erik D. Demaine,et al.  Anchor-Free Distributed Localization in Sensor Networks , 2003 .

[6]  Scott Shenker,et al.  Geographic routing without location information , 2003, MobiCom '03.

[7]  WaldvogelMarcel,et al.  Efficient topology-aware overlay network , 2003 .

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

[9]  Kenneth L. Calvert,et al.  Modeling Internet topology , 1997, IEEE Commun. Mag..

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

[11]  Marcel Waldvogel,et al.  Routing and Data Location in Overlay Peer-to-Peer Networks , 2002 .

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

[13]  Jeffrey C. Mogul,et al.  Efficient use of workstations for passive monitoring of local area networks , 1990, SIGCOMM '90.

[14]  Hari Balakrishnan,et al.  6th ACM/IEEE International Conference on on Mobile Computing and Networking (ACM MOBICOM ’00) The Cricket Location-Support System , 2022 .

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

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

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

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

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

[20]  Frank Dabek,et al.  Learning euclidean coordinates for internet hosts , 2002 .

[21]  Robert Tappan Morris,et al.  Designing a DHT for Low Latency and High Throughput , 2004, NSDI.

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

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

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

[25]  Tony DeRose,et al.  Surface reconstruction from unorganized points , 1992, SIGGRAPH.