Routing with polynomial communication-space trade-off
SIAM Journal on Discrete Mathematics
Finding nearest neighbors in growth-restricted metrics
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Sparse communication networks and efficient routing in the plane
Distributed Computing
Compact Oracles for Reachability and Approximate Distances in Planar Digraphs
FOCS '01 Proceedings of the 42nd IEEE 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
LAND: stretch (1 + ε) locality-aware networks for DHTs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Navigating nets: simple algorithms for proximity search
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 routing on euclidian metrics
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Measured Descent: A New Embedding Method for Finite Metrics
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Triangulation and Embedding Using Small Sets of Beacons
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Fast construction of nets in low dimensional metrics, and their applications
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Distributed approaches to triangulation and embedding
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On hierarchical routing in doubling metrics
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Distance estimation and object location via rings of neighbors
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
Routing in Networks with Low Doubling Dimension
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Compact routing for graphs excluding a fixed minor
DISC'05 Proceedings of the 19th international conference on Distributed Computing
On space-stretch trade-offs: upper bounds
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Improved sparse covers for graphs excluding a fixed minor
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Compact routing with slack in low doubling dimension
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Optimal scale-free compact routing schemes in networks of low doubling dimension
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Ultra-low-dimensional embeddings for doubling metrics
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating TSP on metrics with bounded global growth
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Hierarchical routing over dynamic wireless networks
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
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
Ultra-low-dimensional embeddings for doubling metrics
Journal of the ACM (JACM)
How to complete a doubling metric
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Compact routing in power-law graphs
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Randomized compact routing in decomposable metrics
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Resilient and low stretch routing through embedding into tree metrics
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
The emergence of sparse spanners and greedy well-separated pair decomposition
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
On the efficiency of routing in sensor networks
Journal of Parallel and Distributed Computing
A compact routing scheme and approximate distance oracle for power-law graphs
ACM Transactions on Algorithms (TALG)
Distributed and compact routing using spatial distributions in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 0.00 |
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension of a metric space is the least value α such that any ball of radius r can be covered by at most 2α balls of radius r/2.Given any δ0 and a weighted undirected network G whose shortest path metric d is a doubling metric with doubling dimension α, we present a name-independent routing scheme for G with (9+δ)-stretch, (2+1δ)O(α) (log δ)2 (log n)-bit routing information at each node, and packet headers of size O(log n), where δ is the ratio of the largest to the smallest shortest path distance in G.In addition, we prove that for any ε ∈ (0,8), there is a doubling metric network G with n nodes, doubling dimension α ≤ 6 - log ε, and Δ=O(21/εn) such that any name-independent routing scheme on G with routing information at each node of size o(n(ε/60)2)-bits has stretch larger than 9-ε. Therefore assuming that Δ is bounded by a polynomial on n, our algorithm basically achieves optimal stretch for name-independent routing in doubling metrics with packet header size and routing information at each node both bounded by a polylogarithmic function of n.