The Computer Journal
A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Compact distributed data structures for adaptive routing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Space-efficient message routing in c-decomposable networks
SIAM Journal on Computing
Memory requirement for routing in distributed networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
On devising Boolean routing schemes
Theoretical Computer Science
Compact routing schemes with low stretch factor (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Worst case bounds for shortest path interval routing
Journal of Algorithms
The complexity of shortest path and dilation bounded interval routing
Theoretical Computer Science
The Compactness of Interval Routing
SIAM Journal on Discrete Mathematics
Theoretical Computer Science
On the complexity of multi-dimensional interval routing schemes
Theoretical Computer Science
Lower Bounds for Compact Routing (Extended Abstract)
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Ordered interval routing schemes
Journal of Discrete Algorithms
| Hi-index | 0.00 |
The compactness of a routing table is a complexity measure of the memory space needed to store the routing table on a network whose nodes have been labelled by a consecutive range of integers. It is defined as the smallest integer k such that, in every node u, every set of labels of destinations having the same output in the table of u can be represented as the union of k intervals of consecutive labels. While many works studied the compactness of deterministic routing tables, few of them tackled the adaptive case when the output of the table, for each entry, must contain a fixed number α of routing directions. We prove that every n-node network supports shortest path routing tables of compactness at most n/α for an adaptiveness parameter α, whereas we show a lower bound of n/αO(1).