Complexity of network synchronization
Journal of the ACM (JACM)
Optimal message routing without complete routing tables
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Establishing virtual circuits in large computer networks
Computer Networks and ISDN Systems
An optimal synchronizer for the hypercube
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks
IEEE Transactions on Computers
Compact distributed data structures for adaptive routing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Randomized distributed shortest paths algorithms
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
New sparseness results on graph spanners
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
The virtual path layout problem in fast networks (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Memory requirement for universal routing schemes
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Local memory requirement of universal routing schemes
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
The layout of virtual paths in ATM networks
IEEE/ACM Transactions on Networking (TON)
Memory requirement for routing in distributed networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Compact routing with minimum stretch
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Compact roundtrip routing for digraphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Compact roundtrip routing in directed networks (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Topology aggregation for directed graphs
IEEE/ACM Transactions on Networking (TON)
IDMaps: a global internet host distance estimation service
IEEE/ACM Transactions on Networking (TON)
Distributed object location in a dynamic network
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Routing in distributed networks: overview and open problems
ACM SIGACT News
Compact Routing in Directed Networks with Stretch Factor of Two
HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Compact roundtrip routing in directed networks
Journal of Algorithms
Additive sparse spanners for graphs with bounded length of largest induced cycle
Theoretical Computer Science
On compact and efficient routing in certain graph classes
Discrete Applied Mathematics
Additive spanners for k-chordal graphs
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Robust data location infrastructure in distributed collaborative environment
CSCWD'06 Proceedings of the 10th international conference on Computer supported cooperative work in design III
Scalable routing on flat names
Proceedings of the 6th International COnference
A linear time algorithm for constructing tree 4-spanner in 2-trees
CIT'04 Proceedings of the 7th international conference on Intelligent Information Technology
Max-stretch reduction for tree spanners
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Geometric routing without geometry
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
| Hi-index | 0.00 |
Two conflicting goals play a crucial role in the design of routing schemes for communication networks. A routing scheme should use as short as possible paths for routing messages in the network, while keeping the routing information stored in the processors' local memory as succinct as possible. The efficiency of a routing scheme is measured in terms of its stretch factor - the maximum ratio between the length of a route computed by the scheme and that of a shortest path connecting the same pair of vertices.Most previous work has concentrated on finding good routing schemes (with a small fixed stretch factor) for special classes of network topologies. In this work we study the problem for general networks, and look at the entire range of possible stretch factors. The results exhibit a tradeoff between the efficiency of a routing scheme and its space requirements. We present almost tight upper and lower bounds for this tradeoff. Specifically, we prove that any routing scheme for general n-vertex networks that achieves a stretch factor k ≥ 1 must use a total of &OHgr;(n1+1/2k+4) bits of routing information in the networks. This lower bound is complemented by a family H(k) of hierarchical routing schemes (for every fixed k ≥ 1), which guarantee a stretch factor of &Ogr;(k), require storing a total of &Ogr;(n1+1/k) bits of routing information in the network and name the vertices with &Ogr;(log2 n)-bit names.