Improved routing strategies with succinct tables
Journal of Algorithms
Randomized algorithms
Locating nearby copies of replicated Internet servers
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
IDMaps: a global internet host distance estimation service
IEEE/ACM Transactions on Networking (TON)
Finding nearest neighbors in growth-restricted metrics
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The intrinsic dimensionality of graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Building Low-Diameter P2P Networks
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Finding Close Friends on the Internet
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Bullet: high bandwidth data dissemination using an overlay mesh
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
LAND: stretch (1 + ε) locality-aware networks for DHTs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A note on the nearest neighbor in growth-restricted metrics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Bypassing the embedding: algorithms for low dimensional metrics
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Compact name-independent routing with minimum stretch
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Triangulation and Embedding Using Small Sets of Beacons
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Journal of Algorithms
Journal of the ACM (JACM)
Distance estimation and object location via rings of neighbors
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
On the locality of bounded growth
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Name independent routing for growth bounded networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Meridian: a lightweight network location service without virtual coordinates
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
On space-stretch trade-offs: lower bounds
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Routing in Networks with Low Doubling Dimension
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
A case for end system multicast
IEEE Journal on Selected Areas in Communications
A construction of locality-aware overlay network: mOverlay and its performance
IEEE Journal on Selected Areas in Communications
Dynamic routing and location services in metrics of low doubling dimension
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Dynamic Routing and Location Services in Metrics of Low Doubling Dimension
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Triangulation and embedding using small sets of beacons
Journal of the ACM (JACM)
Efficient computation of distance sketches in distributed networks
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
HybridNN: An accurate and scalable network location service based on the inframetric model
Future Generation Computer Systems
| Hi-index | 0.00 |
We consider a large overlay network where any two nodes can communicate directly via the underlying Internet as long as the sender knows the recipient's ip-address. Due to the scalability requirement, the overlay network must be sparse: a given node can store at most a polylogarithmic number of ip-addresses. A notion of distance (locality) in the network is given by node-to-node round-trip times. We assume that initially the overlay links are random, and hence have no explicit locality-aware properties. We provide fast distributed constructions for various locality-aware (low-stretch) distributed data structures, such as: distance labeling schemes, name-independent routing schemes, and multicast trees. In previous work, such data structures have only been constructed via centralized algorithms. Our constructions complete in poly-logarithmic time (and thus induce at most a poly-logarithmic load on every given node), and achieve quality guarantees similar to those of the corresponding centralized algorithms. Our algorithms use a common locality-aware, small-world-like overlay framework, constructed via concurrent random walks. Our guarantees are for growth-constrained metrics, a well-studied family of metrics which have been proposed as a reasonable abstraction of round-trip times in the Internet.