The Computer Journal
A tradeoff between space and efficiency for routing tables
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Improved routing strategies with succinct tables
Journal of Algorithms
Memory requirement for universal routing schemes
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Memory requirement for routing in distributed networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Compact routing schemes with low stretch factor (extended abstract)
PODC '98 Proceedings of the seventeenth 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 in directed networks (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Compact routing with stretch factor of less than three (brief announcement)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
This paper presents a compact routing algorithm with stretch less than 3 for directed networks. Although for stretch less than 3, the lower bound for the total routing information in the network is 驴(n2) bits, it is still worth examining to determine the best possible saving in space. The routing algorithm uses header size of 4 log n and provides round-trip stretch factor of 2, while bounding the local space by [n - √n(驴1 - 7/4n) - 1/2] log n. These results for stretch less than 3 for directed networks match those for undirected networks.