ABSTRACT
No abstract available.
- I. Abraham, C. Gavoille, D. Malkhi, N. Nisan, and M. Thorup. Compact name-independent routing with minimum stretch. In 16th SPAA, June 2004. Google ScholarDigital Library
- M. Arias, L. Cowen, K. Laing, R. Rajaraman, and O. Taka. Compact routing with name independence. In 15th SPAA pages 184--192, 2003. Google ScholarDigital Library
- B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg. Compact distributed data structures for adaptive network routing. In 21st STOC pages 479--489, May 1989. Google ScholarDigital Library
- C. Gavoille and M. Gengler. Space-efficiency of routing schemes of stretch factor three. In 4th SIROCCO pages 162--175, 1997.Google Scholar
- K. A. Laing. Name-independent compact routing in trees. Technical Report 2003-02, Tufts University Department of Computer Science, Sept. 2003.Google Scholar
Index Terms
- Brief announcement: name-independent compact routing in trees
Recommendations
Compact roundtrip routing with topology-independent node names
Consider a strongly connected directed weighted network with n nodes. This paper presents compact roundtrip routing schemes with O@?(n) sized local tables and stretch 6 for any strongly connected directed network with arbitrary edge weights. A scheme ...
Compact roundtrip routing with topology-independent node names
PODC '03: Proceedings of the twenty-second annual symposium on Principles of distributed computingThis paper presents compact roundtrip routing schemes with local tables of size Õ(√n) and stretch 6 for any directed network with arbitrary edge weights; and with local tables of size Õ(√−1n2/k) and stretch min((2k/2 −1)(k + √), 16k 2+ 8 k − 8), for any ...
HDLBR: A name-independent compact routing scheme for power-law networks
Compact routing intends to achieve a good tradeoff between routing path length and storage overhead, and is recently considered as a main alternative to overcome the fundamental scaling limitations of the Internet routing system. It is generally ...
Comments