A simple DFS-based algorithm for linear interval routing

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

Volumn 1320, Issue , 1997, Pages 37-51

  Eilam, T ^a   Moran, S ^a   Zaks, S ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ROUTING ALGORITHMS;

INTERVAL ROUTING; LABELING SCHEME; LINEAR INTERVALS; POINT-TO-POINT COMMUNICATION; SPACE EFFICIENT; SPANNING TREE;

TREES (MATHEMATICS);

EID: 0141553015     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030674     Document Type: Conference Paper

References (19)

1. Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Improved Routing Strategies with Succinct Tables. Journal of Algorithms, 11 (1990) 307-341.
2. Awerbuch, B., Peled, D.: Routing with Polynomial Communication-Space Tradeoff. SIAM Journal on Discrete Math., 5 (1992) 151-162.
3. Bakker, E.M., van Leeuwen, J., Tan, R.B.: Prefix Routing Schemas in Dynamic Networks. Tech. Rep. RUU-CS-90-10, Dept. of Computer science, Utrecht University, Utrecht (1990), and, Computer Networks and ISDN Systems 26 (1993) 403-421.
4. Bakker, E.M., van Leeuwen, J., Tan, R.B.: Linear Interval Routing. Algorithms Review 2 (1991) 45-61.
5. Even, S.: Graph Algorithms. Computer Science Press, Inc., (1979)
6. Eilam, T., Moran, S., Zaks, S.: Lower Bounds for Linear Interval Routing. Proc. 10th int. Workshop on Distributed Algorithms (WDAG) (1996) 191-205.
7. Fraigniaud, P., Gavoille, C: Interval Routing Schemes. Research Rep. 94-04, LIPS-ENS Lyon (1994).
8. Flammini, M., Gambosi, G., Nanni, U., Tan, R.: Multi-Dimensional Interval Routing Scheme. Proc. 9th Int. Workshop on Distributed Algorithms (WDAG) (1995) 131-144.
9. Flammini, M., Gambosi, G., Salomone, S.: Boolean Routing. Proc. 7th Int. Workshop on Distributed Algorithms (WDAG) (1993) 219-233.
10. Fraigniaud, P., Gavoille, C: Local Memory Requirement of Universal Routing Schemes. Proc. 8th Annual ACM Symp. on Parallel Algorithms and Architecture (SPAA) (1996).
11. Gavoille, C, Perennes, S.: Memory Requirements for Routing in Distributed Networks. Proc. 15th Annual ACM Symp. on Principles of Distributed Computing (PODC) (1996) 125-133.
12. Gavoille, C, Perennes, S.,: Lower Bounds for Shortest Path Interval Routing. Proc. 3rd Coiloq. on Structural Information and Communication Complexity (SIROCCO) (1996).
13. The T9000 Transputer Products Overview Manual, INMOS (1991).
14. van Leeuwen, J., Tan, R.B.: Routing with Compact Routing Tables. Tech. Rep. RUU-CS-83-16, Dept. of Computer Science, Utrecht University (1983). Also as: Computer Networks with Compact Routing Tables. In: G. Rozenberg and A. Salomaa (Eds.) The book of L, Springer- Verlag, Berlin (1986) 298-307.
15. van Leeuwen, J., Tan, R.B.: Computer Network with Compact Routing Tables. In: G. Rozenberg and A. Salomaa (Eds.), The Book of L., Springer-Verlag, Berlin (1986) 259-273.
16. Peleg, I., Upfal, E.: A Trade-Off between Space and Efficiency of Routing Tables. Journal of the ACM 36 (1989) 510-530.
17. Ruzicka, P.: A Note on the Efficiency of an Interval Routing Algorithm. The Computer Journal 34 (1991) 475-476.
18. Santoro, N., Khatib, R.: Routing Without Routing Tables. Tech. Rep. SCS-TR-6, School of Computer Science, Carleton University (1982). Also as: Labeling and Implicit Routing in Networks. The Computer Journal 28 (1) (1985) 5-8.
19. Tse, S. S.H., Lau, F. CM.: A Lower Bound for Interval Routing in General Networks. Networks 29 (1997) 49-53. Also as: Tech. Rep. TR-94-09, Department of Computer Science, University of Hong Kong (1994).