Compact routing for flat networks

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

Volumn 2848, Issue , 2003, Pages 196-210

  Iwama, Kazuo ^a   Okita, Masaki ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS;

AVERAGE CASE; COMPACT ROUTING; FLAT NETWORKS; LOWER BOUNDS; PRACTICAL MODEL; STRETCH FACTOR; TABLE SIZE;

ALGORITHMS;

EID: 35248822275     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39989-6_14     Document Type: Article

References (21)

1. th Annual ACM Symposium on Discrete Algorithms (SODA), ACM/SIAM (1999) 255-260
2. th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA). (2001) 1-10
3. Gavoille, C., Gengler, M.: Space-efficiency of routing schemes of stretch factor three. In Krizanc, D., Widmayer, P., eds.: Proceedings of the 4th International Colloquium on Structual Information & Communication Complexity (SIROCCO), Carleton Scientific (1997) 162-175
4. th Annual ACM Symposium on Principles of Distributed Computing (PODC), ACM PRESS (2000) 337
5. th IASTED PDCS. (2000) 223-228)
6. Karger, D.R., Ruhl, M.: Finding nearest neighbors in growth-restricted metrics. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC). (2002) 741-750
7. th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA). (1997) 311-320
8. Kleinrock, L., Kamoun, F.: Hierarchical routing for large networks; performance evaluation and optimization. Computer Networks 1 (1977) 155-174
9. Santoro, N., Khatib, R.: Labelling and implicit routing in networks. The Computer Journal 28 (1985) 5-8
10. van Leeuwen, J., Tan, R.B.: Routing with compact routing tables. The Book of L (1986) 259-273
11. van Leeuwen, J., Tan, R.B.: Interval routing. The Computer Journal 30 (1987) 259-273
12. Frederickson, G.N., Janardan, R.: Space-efficient message routing in c-decomposable networks. SIAM Journal on Computing 19 (1990) 164-181
13. Frederickson, G.N., Janardan, R.: Designing networks with compact routing tables. Algorithmica (1988) 171-190
14. th Annual ACM Symposium on Theory of Computing (STOC), Carleton Scientific (1988) 43-52
15. th Annual ACM Symposium on Principles of Distributed Computing (PODC). Volume 1644 of Lecture Notes in Computer Science., ACM PRESS (1996) 125-133
16. st Annual ACM Symposium on Theory of Computing (STOC). (1989) 479-489
17. Eilam, T., Gavoille, C., Peleg, D.: Compact routing schemes with low stretch factor. In: Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing (PODC). (1998) 11-20
18. th International Colloquium on Structual Information & Communication Complexity (SIROCCO), Carleton Scientific (1997) 125-137
19. Gavoille, C., Hanusse, N.: Compact routing tables for graphs of bounded genus. In Wiedermann, J., van Emde Boas, P., Nielsen, M., eds.: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP). Volume 1644 of Lecture Notes in Computer Science., Springer (1999) 351-360
20. Buhrman, H., Hoepman, J.H., Vitányi, P.: Space-efficient routing tables for almost all netowrks and the incompressibility method. SIAM Journal on Computing 28 (1999) 1414-1432
21. th International Symposium on Theoretical Aspects of Computer Science (STACS), Springer (2002)