Static and dynamic low-congested interval routing schemes

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

Volumn 1443 LNCS, Issue , 1998, Pages 592-603

  Cicerone, Serafino ^a   Di Stefano, Gabriele ^a   Flammini, Michele ^a  

^a UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; NETWORK ROUTING;

ALL-TO-ALL COMMUNICATION; BI-DIRECTIONAL LINKS; COMMUNICATION PATTERN; INDUCED PATHS; INTERVAL ROUTING; MULTI-DIMENSIONAL GRIDS; TRAFFIC DEMANDS; UNIDIRECTIONAL LINKS;

ROUTING PROTOCOLS;

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

References (25)

1. E. Bakker, J. van Leeuwen, and R.B. Tan. Linear interval routing. Algorithms Review, 2(2):45-61, 1991.
2. F.R.K. Chung, E.G. Cullman, M.I. Heiman, and B.E. Simon. The forwarding index of communication networks. IEEE Trans, on Inform. Theory, 33:224-232, 1987.
3. S. Cicerone, G. Di Stefano, and M. Flammini. Low-congested interval routing schemes. Technical Report R.97-20, Dipartimento di Ingegneria Elettrica, Università di L'Aquila (L'Aquila, Italy), 1997.
4. R. Cypher, F. Meyer auf der Heide, C. Scheideler, and B. Vöcking. Universal algorithms for store-and-forward and wormhole routing. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pages 356-365, Philadelphia, Pennsylvania, 22-24 May 1996.
5. T. Eilam, S. Moran, and S. Zaks. The complexity of characterization of networks supporting shortest-path interval routing. In 4th Colloquium on Structural Information and Communication Complexity (SIROCCO). Carleton University Press, 1997.
6. M. Flainmini. On the hardness of devising interval routing schemes. Parallel Processing Letters, 7(1):39-47, 1997.
7. M. Flanimini, G. Oambosi, and S. Salomone. Interval routing schemes. Algorithmica, 18(6):549-568, 1996.
8. M. Flammini, J. van Leeuwen, and A. Marchetti Spaccamela. The complexity of interval routing on random graphs. In 20th Symposium on Mathematical Foundation of Computer Science (MFCS), Volume 969 of Lecture Notes in Computer Science, pages 37-49. Springer-Verlag, 1995.
9. P. Fraigniaud and C. Gavoille. A characterisation of networks supporting linear interval routing. In 13th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 216-224, 1994.
10. P. Fraigniaud and C. Gavoille. Interval routing schemes. Technical Report 94-04, Laboratoire de l'Informatique du Parallélisme, LIP, Ecole Normale Supérieure de Lyon, 69364 Lyon Cedex 07, France, 1994. To appear in Algorithinica.
11. G.N. Frederickson and H. Janardan. Designing networks with compact routing tables. Algorithinica, 3:171-190, 1988.
12. M.R. Garcy and D.S. Johnson. Computers and Intractability. A Guide to the Theory of NP-complctencss. W.U. Freeman, 1979.
13. C. Gavoille. A survey on interval routing scheme. Research Report RR-1182-97, University of Bordeaux (France), October 1997.
14. C. Gavoille and S. Pérennès. Lower bounds for interval routing on 3-regular networks. In 3rd Colloquium on Structural Information and Communication Complexity (SIROCCO). Carleton University Press, 1996.
15. R. I. Greenberg and H.-C. Oh. Universal wormhole routing. IEEE Transactions on Parallel and Distributed Systems (IFFF-TPDS), 8, 1997.
16. M.C. Ileydcmann, J.O. Meyer, J. Opatrny, and D. Sottean. Forwarding indices of consistent routings and their complexity. Networks, 24(2):75-82, 1994.
17. M.C Ileydcmann, J.C Meyer, and D. Sottean. On forwarding indices of networks. Discrete Applied Math., 23:103-123, 1989.
18. The T9000 Transputer Products Overview Manual. INMOS, 1991.
19. E. Krauakis, D. Krizanc, and S.S. Ravi. On multi-label linear interval routing schemes. In 19th Workshop on Graph Theoretic Concepts in Computer Science (WG), Volume 790 of Lecture Notes in Computer Science, pages 338-349. Springer-Verlag, 1993.
20. T. Leighton, B. Maggs, and S. Rao. Universal packet routing algorithms. In 29th Annual Symposium on Foundations of Computer Science, pages 256-271, 1988.
21. P. Ruzicka and D. Stelankovic. On the complexity of multidimensional interval routing schemes. Manuscript, 1997.
22. N. Santoro and R. Khatib. Labeling and implicit routing in networks. The Computer Journal, 28:5-8, 1985.
23. P. Solé. Expanding and forwarding. Discrete Applied Math., 58:67-78, 1995.
24. J. van Leeuwen and R.B. Tan. Routing with compact routing tables. In G. Rozemberg and A. Salomaa, editors, The book of L, pages 259-273. Springer-Verlag, 1986.
25. J. van Leeuwen and R.B. Tan. Interval routing. The Computer Journal, 30:298-307, 1987.