Provably good routing in graphs: regular arrays
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Compact routing with minimum stretch
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Finding nearest neighbors in growth-restricted metrics
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Nearest common ancestors: a survey and a new distributed algorithm
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Compact routing schemes with low stretch factor
Journal of Algorithms
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Bounded Geometries, Fractals, and Low-Distortion Embeddings
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Measuring ISP topologies with rocketfuel
IEEE/ACM Transactions on Networking (TON)
On hierarchical routing in doubling metrics
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Name independent routing for growth bounded networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Two Routing Algorithms for Failure Protection in IP Networks
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Optimal-stretch name-independent compact routing in doubling metrics
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Routing in Networks with Low Doubling Dimension
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Improved algorithms for fully dynamic geometric spanners and geometric routing
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Trade-Offs between Stretch Factor and Load-Balancing Ratio in Routing on Growth-Restricted Graphs
IEEE Transactions on Parallel and Distributed Systems
Distributed resource management and matching in sensor networks
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Always acyclic distributed path computation
IEEE/ACM Transactions on Networking (TON)
Maintaining approximate minimum steiner tree and k-center for mobile agents in a sensor network
INFOCOM'10 Proceedings of the 29th conference on Information communications
| Hi-index | 0.00 |
Given a network, the simplest routing scheme is probably routing on a spanning tree. This method however does not provide good stretch--the route between two nodes can be much longer than their shortest distance, nor does it give good resilience -- one node failure may disconnect quadratically many pairs. In this paper we use two trees to achieve both constant stretch and good resilience. Given a metric (e.g., as the shortest path metric of a given communication network), we build two hierarchical well-separated trees using randomization such that for any two nodes u, v, the shorter path of the two paths in the two respective trees gives a constant stretch of the metric distance of u, v, and the removal of any node only disconnect the routes between O(1/n) fraction of all pairs. Both bounds are in expectation and hold true as long as the metric follows certain geometric growth rate (the number of nodes within distance r is a polynomial function of r), which holds for many realistic network settings such as wireless ad hoc networks and Internet backbone graphs. The algorithms have been implemented and tested on real data.