Practical, distributed network coordinates

Russ Cox, Frank Dabek, Frans Kaashoek, Jinyang Li, Robert Morris

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Vivaldi is a distributed algorithm that assigns synthetic coordinates to Internet hosts, so that the Euclidean distance between two hosts' coordinates predicts the network latency between them. Each node in Vivaldi computes its coordinates by simulating its position in a network of physical springs. Vivaldi is both distributed and efficient: no fixed infrastructure need be deployed and a new host can compute useful coordinates after collecting latency information from only a few other hosts. Vivaldi can rely on piggy-backing latency information on application traffic instead of generating extra traffic by sending its own probe packets. This paper evaluates Vivaldi through simulations of 750 hosts, with a matrix of inter-host latencies derived from measurements between 750 real Internet hosts. Vivaldi finds synthetic coordinates that predict the measured latencies with a median relative error of 14 percent. The simulations show that a new host joining an existing Vivaldi system requires fewer than 10 probes to achieve this accuracy. Vivaldi is currently used by the Chord distributed hash table to perform proximity routing, replica selection, and retransmission timer estimation.

Original languageEnglish (US)
Title of host publicationComputer Communication Review
Pages113-118
Number of pages6
Volume34
Edition1
DOIs
StatePublished - Jan 2004

Fingerprint

Internet
Parallel algorithms
Joining

ASJC Scopus subject areas

  • Information Systems

Cite this

Cox, R., Dabek, F., Kaashoek, F., Li, J., & Morris, R. (2004). Practical, distributed network coordinates. In Computer Communication Review (1 ed., Vol. 34, pp. 113-118) https://doi.org/10.1145/972374.972394

Practical, distributed network coordinates. / Cox, Russ; Dabek, Frank; Kaashoek, Frans; Li, Jinyang; Morris, Robert.

Computer Communication Review. Vol. 34 1. ed. 2004. p. 113-118.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cox, R, Dabek, F, Kaashoek, F, Li, J & Morris, R 2004, Practical, distributed network coordinates. in Computer Communication Review. 1 edn, vol. 34, pp. 113-118. https://doi.org/10.1145/972374.972394
Cox R, Dabek F, Kaashoek F, Li J, Morris R. Practical, distributed network coordinates. In Computer Communication Review. 1 ed. Vol. 34. 2004. p. 113-118 https://doi.org/10.1145/972374.972394
Cox, Russ ; Dabek, Frank ; Kaashoek, Frans ; Li, Jinyang ; Morris, Robert. / Practical, distributed network coordinates. Computer Communication Review. Vol. 34 1. ed. 2004. pp. 113-118
@inproceedings{22ec598e385447f98718bb0aaf75bf33,
title = "Practical, distributed network coordinates",
abstract = "Vivaldi is a distributed algorithm that assigns synthetic coordinates to Internet hosts, so that the Euclidean distance between two hosts' coordinates predicts the network latency between them. Each node in Vivaldi computes its coordinates by simulating its position in a network of physical springs. Vivaldi is both distributed and efficient: no fixed infrastructure need be deployed and a new host can compute useful coordinates after collecting latency information from only a few other hosts. Vivaldi can rely on piggy-backing latency information on application traffic instead of generating extra traffic by sending its own probe packets. This paper evaluates Vivaldi through simulations of 750 hosts, with a matrix of inter-host latencies derived from measurements between 750 real Internet hosts. Vivaldi finds synthetic coordinates that predict the measured latencies with a median relative error of 14 percent. The simulations show that a new host joining an existing Vivaldi system requires fewer than 10 probes to achieve this accuracy. Vivaldi is currently used by the Chord distributed hash table to perform proximity routing, replica selection, and retransmission timer estimation.",
author = "Russ Cox and Frank Dabek and Frans Kaashoek and Jinyang Li and Robert Morris",
year = "2004",
month = "1",
doi = "10.1145/972374.972394",
language = "English (US)",
volume = "34",
pages = "113--118",
booktitle = "Computer Communication Review",
edition = "1",

}

TY - GEN

T1 - Practical, distributed network coordinates

AU - Cox, Russ

AU - Dabek, Frank

AU - Kaashoek, Frans

AU - Li, Jinyang

AU - Morris, Robert

PY - 2004/1

Y1 - 2004/1

N2 - Vivaldi is a distributed algorithm that assigns synthetic coordinates to Internet hosts, so that the Euclidean distance between two hosts' coordinates predicts the network latency between them. Each node in Vivaldi computes its coordinates by simulating its position in a network of physical springs. Vivaldi is both distributed and efficient: no fixed infrastructure need be deployed and a new host can compute useful coordinates after collecting latency information from only a few other hosts. Vivaldi can rely on piggy-backing latency information on application traffic instead of generating extra traffic by sending its own probe packets. This paper evaluates Vivaldi through simulations of 750 hosts, with a matrix of inter-host latencies derived from measurements between 750 real Internet hosts. Vivaldi finds synthetic coordinates that predict the measured latencies with a median relative error of 14 percent. The simulations show that a new host joining an existing Vivaldi system requires fewer than 10 probes to achieve this accuracy. Vivaldi is currently used by the Chord distributed hash table to perform proximity routing, replica selection, and retransmission timer estimation.

AB - Vivaldi is a distributed algorithm that assigns synthetic coordinates to Internet hosts, so that the Euclidean distance between two hosts' coordinates predicts the network latency between them. Each node in Vivaldi computes its coordinates by simulating its position in a network of physical springs. Vivaldi is both distributed and efficient: no fixed infrastructure need be deployed and a new host can compute useful coordinates after collecting latency information from only a few other hosts. Vivaldi can rely on piggy-backing latency information on application traffic instead of generating extra traffic by sending its own probe packets. This paper evaluates Vivaldi through simulations of 750 hosts, with a matrix of inter-host latencies derived from measurements between 750 real Internet hosts. Vivaldi finds synthetic coordinates that predict the measured latencies with a median relative error of 14 percent. The simulations show that a new host joining an existing Vivaldi system requires fewer than 10 probes to achieve this accuracy. Vivaldi is currently used by the Chord distributed hash table to perform proximity routing, replica selection, and retransmission timer estimation.

UR - http://www.scopus.com/inward/record.url?scp=10444241365&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=10444241365&partnerID=8YFLogxK

U2 - 10.1145/972374.972394

DO - 10.1145/972374.972394

M3 - Conference contribution

AN - SCOPUS:10444241365

VL - 34

SP - 113

EP - 118

BT - Computer Communication Review

ER -