Randomized compact routing in decomposable metrics

Authors:
Goran Konjevod;Andréa W. Richa;Donglin Xia;Ling Zhou
Affiliations:
Lawrence Livermore National Laboratory, Livermore, CA, USA;Arizona State University, Tempe, AZ, USA;Microsoft, Redmond, WA, USA;Microsoft, Redmond, WA, USA
Venue:
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Year:
2011

Citing 10
Cited 0

Excluded minors, network decomposition, and multicommodity flow

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Small distortion and volume preserving embeddings for planar and Euclidean metrics

SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Routing in Trees

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Bounded Geometries, Fractals, and Low-Distortion Embeddings

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Measured Descent: A New Embedding Method for Finite Metrics

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Name independent routing for growth bounded networks

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
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
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
Compact routing in power-law graphs

DISC'09 Proceedings of the 23rd international conference on Distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the compact routing problem in networks whose shortest path metrics are decomposable. Decomposable metrics are more general than doubling metrics, growth-bounded metrics, and metrics induced by graphs excluding Kr,r as a minor. In this work, we present both name-dependent and name-independent constant stretch compact routing schemes for bounded decomposable metrics with polylogarithmic storage requirements at each node and polylogarithmic packet headers. Our work is the first to design compact routing schemes with constant stretch for networks as general as decomposable metrics.