Compact routing for graphs excluding a fixed minor

Authors:
Ittai Abraham;Cyril Gavoille;Dahlia Malkhi
Affiliations:
School of Computer Science and Engineering, The Hebrew University of Jerusalem, Jerusalem, Israel;Laboratoire Bordelais de Recherche en Informatique, University of Bordeaux, Bordeaux, France;School of Computer Science and Engineering, The Hebrew University of Jerusalem, Jerusalem, Israel
Venue:
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Year:
2005

Citing 29
Cited 12

A trade-off between space and efficiency for routing tables

Journal of the ACM (JACM)
Efficient message routing in planar networks

SIAM Journal on Computing
Routing with polynomial communication-space trade-off

SIAM Journal on Discrete Mathematics
Excluded minors, network decomposition, and multicommodity flow

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Distributed computing: a locality-sensitive approach

Distributed computing: a locality-sensitive approach
Compact routing schemes

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Sparse communication networks and efficient routing in the plane

Distributed Computing
Routing in distributed networks: overview and open problems

ACM SIGACT News
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
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Compact routing schemes with low stretch factor

Journal of Algorithms
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
Compact and localized distributed data structures

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Excluding any graph as a minor allows a low tree-width 2-coloring

Journal of Combinatorial Theory Series B
Bypassing the embedding: algorithms for low dimensional metrics

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Compact name-independent routing with minimum stretch

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Compact routing on euclidian metrics

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Brief announcement: name-independent compact routing in trees

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Distance labeling in graphs

Journal of Algorithms
Competitive online routing in geometric graphs

Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
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
Distance and routing labeling schemes for non-positively curved plane graphs

Journal of Algorithms
Proximity-preserving labeling schemes

Journal of Graph Theory
Sparse partitions

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
On compact and efficient routing in certain graph classes

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

Object location using path separators

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed 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: upper bounds

Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Strong-diameter decompositions of minor free graphs

Proceedings of the nineteenth annual ACM symposium on Parallel 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 in power-law graphs

DISC'09 Proceedings of the 23rd international conference on Distributed computing
Virtual ring routing trends

DISC'09 Proceedings of the 23rd international conference on Distributed computing
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees

SIAM Journal on Discrete Mathematics
Sparse spanners vs. compact routing

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Distributed routing in tree networks with few landmarks

CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Collective tree spanners in graphs with bounded genus, chordality, tree-width, or clique-width

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A compact routing scheme and approximate distance oracle for power-law graphs

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper concerns compact routing schemes with arbitrary node names. We present a compact name-independent routing scheme for unweighted networks with n nodes excluding a fixed minor. For any fixed minor, the scheme, constructible in polynomial time, has constant stretch factor and requires routing tables with poly-logarithmic number of bits at each node. For shortest-path labeled routing scheme in planar graphs, we prove an Ω(nε) space lower bound for some constant ε 0. This lower bound holds even for bounded degree triangulations, and is optimal for polynomially weighted planar graphs (ε=1/2).