A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Improved routing strategies with succinct tables
Journal of Algorithms
On sparse spanners of weighted graphs
Discrete & Computational Geometry
Memory requirement for routing in distributed networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Fast distributed construction of small k-dominating sets and applications
Journal of Algorithms
Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
SIAM Journal on Computing
Compact routing with stretch factor of less than three (brief announcement)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Compact routing with minimum stretch
Journal of Algorithms
Space-efficiency for routing schemes of stretch factor three
Journal of Parallel and Distributed Computing
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Routing in distributed networks: overview and open problems
ACM SIGACT News
The Compactness of Interval Routing for Almost All Graphs
SIAM Journal on Computing
Sparse distance preservers and additive spanners
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Compact Routing Scheme for Chordal Graphs
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Compact Routing Tables for Graphs of Bounded Genus
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A Space Lower Bound for Routing in Trees
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Approximate Distance Labeling Schemes
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Equivalence of local treewidth and linear local treewidth and its algorithmic applications
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
$(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
SIAM Journal on Computing
Journal of Algorithms
Compact oracles for reachability and approximate distances in planar digraphs
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Spanners and emulators with sublinear distance errors
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Object location using path separators
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
Lower Bounds for Additive Spanners, Emulators, and More
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Distance and routing labeling schemes for non-positively curved plane graphs
Journal of Algorithms
Compact Routing with Name Independence
SIAM Journal on Discrete Mathematics
Name-independent compact routing in trees
Information Processing Letters
Strong-diameter decompositions of minor free graphs
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
On compact and efficient routing in certain graph classes
Discrete Applied Mathematics
Improved sparse covers for graphs excluding a fixed minor
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
Compact name-independent routing with minimum stretch
ACM Transactions on Algorithms (TALG)
Proximity-preserving labeling schemes
Journal of Graph Theory
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Improved Approximation Algorithms for Minimum Weight Vertex Separators
SIAM Journal on Computing
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Planarity Allowing Few Error Vertices in Linear Time
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Compact routing in power-law graphs
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Additive spanners and (α, β)-spanners
ACM Transactions on Algorithms (TALG)
Additive spanners in nearly quadratic time
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Exact distance labelings yield additive-stretch compact routing schemes
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Collective tree spanners and routing in AT-free related graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Compact routing for graphs excluding a fixed minor
DISC'05 Proceedings of the 19th international conference on Distributed Computing
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
On approximate distance labels and routing schemes with affine stretch
DISC'11 Proceedings of the 25th international conference on Distributed computing
Node-Disjoint multipath spanners and their relationship with fault-tolerant spanners
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
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)
Compact routing schemes with improved stretch
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
Routing with multiplicative stretch 3 (which means that the path used by the routing scheme can be up to three times longer than a shortest path) can be done with routing tables of Θ(√n) bits per node. The space lower bound is due to the existence of dense graphs with large girth. Dense graphs can be sparsified to subgraphs, called spanners, with various stretch guarantees. There are spanners with additive stretch guarantees (some even have constant additive stretch) but only very few additive routing schemes are known. In this paper, we give reasons why routing in unweighted graphs with additive stretch is difficult in the form of space lower bounds for general graphs and for planar graphs. We prove that any routing scheme using routing tables of size μ bits per node and addresses of poly-logarithmic length has additive stretch Ω(√n/μ) for general graphs, and Ω(√n/μ) for planar graphs. Routing with tables of size O(n1/3) thus requires a polynomial additive stretch Ω(n1/3), whereas spanners with average degree O(n1/3) and constant additive stretch exist for all graphs. Spanners, however sparse they are, do not tell us how to route. These bounds provide the first separation of sparse spanner problems and compact routing problems. On the positive side, we give an almost tight upper bound: we present the first non-trivial compact routing scheme with o(log2n)-bit addresses, additive stretch O(n1/3), and table size O(n1/3) bits for all graphs with linear local tree-width such as planar, bounded-genus, and apex-minor-free graphs. Note: Asymptotic notation in this abstract suppresses factors logarithmic in n.