A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Routing in distributed networks: overview and open problems
ACM SIGACT News
Bounded Geometries, Fractals, and Low-Distortion Embeddings
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Bypassing the embedding: algorithms for low dimensional metrics
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Triangulation and Embedding Using Small Sets of Beacons
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
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
Metric Embeddings with Relaxed Guarantees
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Advances in metric embedding theory
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Optimal-stretch name-independent compact routing in doubling metrics
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
On space-stretch trade-offs: lower bounds
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
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
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
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
Compact routing in power-law graphs
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Volume in general metric spaces
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Proximity algorithms for nearly-doubling spaces
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
A compact routing scheme and approximate distance oracle for power-law graphs
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
We consider the problem of compact routing with slack in networks of low doubling dimension. Namely, we seek name-independent routing schemes with (1+ε) stretch and polylogarithmic storage at each node: since existing lower bound precludes such a scheme, we relax our guarantees to allow for (i) a small fraction of nodes to have large storage, say size of O(n log n) bits, or (ii) a small fraction of source-destination pairs to have larger, but still constant, stretch. In this paper, given any constant ε ∈ (0,1), any δ ∈ Θ(1/ polylog n) and any connected edge-weighted undirected graph G with doubling dimension α ∈ O(log log n) and arbitrary node names, we present 1. a (1+ε)-stretch name-independent routing scheme for G with polylogarithmic packet header size, and with (1-δ)n nodes storing polylogarithmic size routing tables each and the remaining δn nodes storing O(nlog n)-bit routing tables each. 2. a name-independent routing scheme for G with polylogarithmic storage and packet header size, and with stretch (1+ε) for (1-α n source nodes and (9+ε) for the remaining α n source nodes.. These results are to be contrasted with our lower bound from PODC 2006, where we showed that stretch 9 is asymptotically optimal for name-independent compact routing schemes in networks of constant doubling dimension.