Thursday, July 15, 2004
Vivaldi: A P2P Coordinate Algorithm That Takes Latency Into Account
Practical, Distributed Network Coordinates: 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.
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.
Subscribe to Posts [Atom]
