Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Reconstructing approximate tree metrics
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
In many network applications it would be useful for individual nodes to have knowledge of distances (e.g. latency or bandwidth) in the network. If every node stored all distances then it would take Ω(n2) space at every node, and furthermore when a new node joins it would have to send an Ω(n)-bit message to Ω(n) other nodes, for a total communication complexity of Ω(n2) per update. In this paper we consider a specific class of metrics, those obeying an ε-three point condition, and show that by embedding these metrics into ultrametrics we can use only O(n) space at every node, have amortized communication complexity of O(n4/3) (allowing nodes to join and leave the network), and still estimate distances up to a (1+ε)log n + 5-stretch factor.