A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Memory requirement for routing in distributed networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method
SIAM Journal on Computing
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Lower Bounds for Compact Routing (Extended Abstract)
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
A Space Lower Bound for Routing in Trees
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Brief announcement: name-independent compact routing in trees
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A space lower bound for name-independent compact routing in trees
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Advances in metric embedding theory
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Object location using path separators
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
On compact routing for the internet
ACM SIGCOMM Computer Communication Review
Compact routing with slack in low doubling dimension
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Towards fast decentralized construction of locality-aware overlay networks
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 roundtrip routing with topology-independent node names
Journal of Computer and System Sciences
On the locality of distributed sparse spanner construction
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
Electric Routing and Concurrent Flow Cutting
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Compact routing in power-law graphs
DISC'09 Proceedings of the 23rd international conference on Distributed computing
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Electric routing and concurrent flow cutting
Theoretical Computer Science
A compact routing scheme and approximate distance oracle for power-law graphs
ACM Transactions on Algorithms (TALG)
Fast routing table construction using small messages: extended abstract
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.01 |
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme -- the ratio between the cost of the route induced by the scheme and the cost of a minimum cost path between the same pair. Using a distributed Kolmogorov Complexity argument, we give a lower bound for the name-independent model that applies even to single-source schemes and does not require a girth conjecture. For any integer k ≥ 1 we prove that any routing scheme for networks with arbitrary weights and arbitrary node names (even a single-source routing scheme) with maximum stretch strictly less than 2k + 1 requires Ω((n log n)1/k)-bit routing tables. We extend our results to lower bound the average-stretch, showing that for any integer k ≥ 1 any name-independent routing scheme with (n/(9k))1/k-bit routing tables has average-stretch of at least k/4 + 7/8. This result is in sharp contrast to recent results on the average-stretch of labeled routing schemes.