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 and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Interval routing in reliability networks
Theoretical Computer Science - Foundations of software science and computation structures
Threshold dominating cliques in random graphs and interval routing
Journal of Discrete Algorithms
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
An improved interval routing scheme for almost all networks based on dominating cliques
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Distributed computing of efficient routing schemes in generalized chordal graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Distributed computing of efficient routing schemes in generalized chordal graphs
Theoretical Computer Science
| Hi-index | 0.00 |
Interval routing is a compact way of representing routing tables on a graph. It is based on grouping together, in each node, destination addresses that use the same outgoing edge in the routing table. Such groups of addresses are represented by some intervals of consecutive integers. We show that almost all the graphs, i.e., a fraction of at least 1-1/n2 of all the n-node graphs, support a shortest path interval routing with three intervals per outgoing edge, even if the addresses of the nodes are arbitrarily fixed in advance and cannot be chosen by the designer of the routing scheme. In case the addresses are initialized randomly, we show that two intervals per outgoing edge suffice, and, conversely, that two intervals are required for almost all graphs. Finally, if the node addresses can be chosen as desired, we show how to design in polynomial time a shortest path interval routing with a single interval per outgoing edge for all but at most O(log3n) outgoing edges in each node. It follows that almost all graphs support a shortest path routing scheme which requires at most n+O(log4n) bits of routing information per node, improving on the previous upper bound.