Name
Abstract | ||
|---|---|---|
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). |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1145/1015467.1015471 | SIGCOMM |
Keywords | Field | DocType |
algorithms,internet topology,measurement,2 dimensional,round trip time,relative error,design,performance | Internet topology,Coordinate system,Network coordinates,Latency (engineering),Computer science,Decentralized network,Computer network,Euclidean geometry,Approximation error,Distributed computing,The Internet | Conference |
Volume | Issue | ISSN |
34 | 4 | 0146-4833 |
ISBN | Citations | PageRank |
1-58113-862-8 | 672 | 29.90 |
References | Authors | |
22 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Frank Dabek | 1 | 4997 | 460.02 |
| Russ Cox | 2 | 996 | 61.40 |
| M. Frans Kaashoek | 3 | 15558 | 1966.90 |
| Robert Morris | 4 | 17391 | 1916.26 |