Topological routing schemes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1151, Issue , 1996, Pages 206-219

  Gambosi, Giorgio ^a   Vocca, Paola ^a  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

Compact routing tables; Distributed systems; Interval routing; Shortest paths

Indexed keywords

NETWORK ROUTING; ROUTING PROTOCOLS;

COMPACT ROUTING TABLES; DISTRIBUTED SYSTEMS; INTERVAL ROUTING; LINEAR INTERVALS; ROUTING FUNCTION; SHORTEST PATH; SPECIFIC CLASS; TOPOLOGICAL ROUTING;

TOPOLOGY;

EID: 0348086901     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61769-8_14     Document Type: Conference Paper

References (16)

1. B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg. Compact Distributed Data Structures for Adaptive Routing. In Proc. 21st ACM Symp. on Theory of Computing, pages 479-489, 1989.
2. B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg. Improved Routing Strategies with Succinct Tables. Journal of Algorithms, 11:307-341, 1990.
3. E. M. Bakker, J. van Leeuwen, and R. B. Tan. Linear Interval Routing Schemes. Algorithms Review, 2:45-61, 1991.
4. M. Flammini, G. Gambosi, U. Nänni, and R.B. Tan. Multi-dimensional interval routing schemes. In Proc. 9th International Workshop on Distributed Algorithms (WDAG’95), LNCS. Springer-Verlag, 1995.
5. M. Flammini, G. Gambosi, and S. Salomone. Boolean routing. In Proc. 1th International Workshop on Distributed Algorithms (WDAG’93), volume 725 of LNCS. Springer-Verlag, 1993.
6. M. Flammini, G. Gambosi, and S. Salomone. Interval routing schemes. In Proc. 12th Symp. on Theoretical Aspects of Computer Science (STACS’95), volume 900 of LNCS. Springer-Verlag, 1995.
7. M. Flammini, J. van Leeuwen, and A. Marchetti Spaccamela. The complexity of interval routing on random graphs. In Proc. 20th Symposium on Mathematical Foundation of Computer Science (MFCS’95), 1995.
8. P. Fraigniaud and C. Gavoille. Interval routing schemes. In Proc. 13th Annual ACM Symposium on Principles of Distributed Computing, 1994.
9. G. N. Frederickson and R. Janardan. Designing networks with compact routing tables. Algorithmica, 3:171-190, 1988.
10. G. N. Frederickson and R. Janardan. Efficient message routing in planar networks. SIAM Journal on Computing, 18:843-857, 1989.
11. G. N. Frederickson and R. Janardan. Space efficient message routing in c-decomposable networks. SIAM Journal on Computing, 19:164-181, 1990.
12. D. Peleg and E. Upfal. A trade-off between space and efficiency for routing tables. Journal of the ACM, 36(3):510-530, 1989.
13. P. Ruliüka. On efficiency of interval routing algorithms. In M.P. Chytil, L. Janiga, V. Koubek (Eds.), Mathematical Foundations of Computer Science 1988, volume 324 of LNCS. Springer-Verlag, 1988.
14. N. Santoro and R. Khatib. Labelling and implicit routing in networks. Computer Journal, 28(1):5-8, 1985.
15. J. van Leeuwen and R. B. Tan. Computer networks with compact routing tables. In G. Rozenberg and A. Salomaa (Eds.) The Book of L, volume 790. Springer-Verlag, 1986.
16. J. van Leeuwen and R. B. Tan. Interval routing. Computer Journal, 30:298-307, 1987.