Vivaldi: a decentralized network coordinate system

@inproceedings{Dabek2004VivaldiAD,
  title={Vivaldi: a decentralized network coordinate system},
  author={Frank Dabek and Russ Cox and M. Frans Kaashoek and Robert Tappan Morris},
  booktitle={Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication},
  year={2004}
}
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… 

Figures from this paper

A Decentralized Network Coordinate System for Robust Internet Distance

  • Li-wei H. LehmanS. Lerman
  • Computer Science
    Third International Conference on Information Technology: New Generations (ITNG'06)
  • 2006
Simulation results suggest that, even under an extremely challenging flash-crowd scenario where 1740 hosts simultaneously join the system, PCoord with a 5-dimensional Euclidean model is able to converge to 11% median prediction error in 10 coordinate updates per host on average.

Performance Improvement of a Distributed Internet Coordinates System

  • S. NarayananE. Shim
  • Computer Science
    2007 4th IEEE Consumer Communications and Networking Conference
  • 2007
An improved scheme in which hosts dynamically change the set of neighbors with which they measure distances is proposed in which Vivaldi is used, and a new metric named relative delay loss (rdl) is introduced that captures how well the coordinate system picks the closest node between two given nodes.

Meridian: A Lightweight Framework for Network Positioning without Virtual Coordinates

The system, Meridian, provides a lightweight, accurate and scalable framework for keeping track of location information for participating nodes that is scalable with logarithmic convergence when Internet latencies are modeled as a growth-constrained metric, a low-dimensional Euclidian metric, or a metric of low doubling dimension.

A Unified Network Coordinate System for Bandwidth and Latency

This paper argues based on intuition and analysis of three real-world datasets why bandwidth and latency can be represented as tree metrics, and presents Sequoia, an accurate and light-weight system that provides virtual network positions by embedding bandwidth or latency on trees.

Where Is My Peer? Evaluation of the Vivaldi Network Coordinate System in Azureus

A crawler is developed that allows to obtain from the network coordinates over one hundred thousand peers running Azureus and to measure the network and application level round trip times to these peers, confirming that network coordinates allow to correctly estimate the round trip time between two peers.

Scrubbing the Vivaldi network coordinate system

Over the last years network coordinate systems have gained much attention as they allow for an elegant estimation of distances between peer-to-peer endsystems. The most prominent representative of

Estimating Hop Distance Between Arbitrary Host Pairs

This paper describes a methodology for estimating an important characteristic of Internet topology - the hop distance between arbitrary pairs of end hosts and develops a novel multidimensional scaling algorithm that can be applied to both the passive and active measurements to generate pairwise hop distance estimates.

A View from inside a Distributed Internet Coordinate System

The main finding is that a stable cluster of nodes always exists and is grouping most of the nodes in the Vivaldi system, and it is proposed to track a simple signal, which is the size of this biggest stable cluster.

WDCS: A Weight-Based Distributed Coordinate System

WDCS is proposed, a novel distributed NCS scheme that uses a well-designed algorithm to select an appropriate set of landmarks and employs the W_RUN_PACE method to eliminate the impact of measurement errors or outliers and outperforms the state-of-the-art NCS schemes in terms of prediction accuracy and convergence speed.

A Distributed Measurement Scheme for Internet Latency Estimation

This paper proposes a new decentralized coordinate-based solution to the problem of Internet delay measurement and simulation results demonstrate that the proposed system provides relatively accurate estimations.
...

References

SHOWING 1-10 OF 33 REFERENCES

Practical, distributed network coordinates

This paper evaluates Vivaldi through simulations of 750 hosts, with a matrix of inter-host latencies derived from measurements between 750 real Internet hosts, and finds synthetic coordinates that predict the measured latencies with a median relative error of 14 percent.

Learning euclidean coordinates for internet hosts

A different algorithm is proposed, based on a physical simulation of a system of springs, which runs much faster than the simplex algorithm and produces similarly accurate results.

Predicting Internet network distance with coordinates-based approaches

  • T. NgHui Zhang
  • Computer Science
    Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies
  • 2002
This work proposes using coordinates-based mechanisms in a peer-to-peer architecture to predict Internet network distance (i.e. round-trip propagation and transmission delay), and proposes the GNP approach, based on absolute coordinates computed from modeling the Internet as a geometric space.

King: estimating latency between arbitrary internet end hosts

The accuracy of King is significantly better than the accuracy of IDMaps, and that King tends to preserve order among its latency estimates, as well as a variety of measurement studies and applications that could benefit from the tool.

Efficient topology-aware overlay network

Mithos is introduced, an content-addressable overlay network that only uses minimal routing information and is directly suitable as an underlay network for P2P systems, both using traditional and DHT addressing.

Virtual landmarks for the internet

This paper develops a faster method based on dimensionality reduction of the Lipschitz embedding that is reasonably accurate, even when applied to measurements spanning the Internet, and that it naturally leads to a scalable measurement strategy based on the notion of virtual landmarks.

PIC: practical Internet coordinates for distance estimation

PIC is introduced, a practical coordinate-based mechanism to estimate Internet network distance that does not rely on infrastructure nodes and it can compute accurate coordinates even when some peers are malicious.

IDMaps: a global internet host distance estimation service

It is shown that IDMaps can indeed provide useful distance estimations to applications such as nearest mirror selection, and is suggested a scalable Internet-wide architecture, called IDMaps, which measures and disseminates distance information on the global Internet.

Designing a DHT for Low Latency and High Throughput

New techniques that resulted from this exploration include use of latency predictions based on synthetic co-ordinates, efficient integration of lookup routing and data fetching, and a congestion control mechanism suitable for fetching data striped over large numbers of servers.

An investigation of geographic mapping techniques for internet hosts

Whether it is possible to build an IP address to geographic location mapping service for Internet hosts to enable a large and interesting class of location-aware applications is asked and three distinct techniques for determining the geographic location of Internet hosts are presented and evaluated.