Universal routing schemes

Distributed Computing

Volumn 10, Issue 2, 1997, Pages 65-78

  Fraigniaud, Pierre ^a   Gavoille, Cyril ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

Implementation; Routing schemes; Universal routing schemes

Indexed keywords

CODES (SYMBOLS); COMPUTER NETWORKS; DATA STORAGE EQUIPMENT; DISTRIBUTED COMPUTER SYSTEMS; NETWORK PROTOCOLS;

MEMORY SIZE; UNIVERSAL ROUTING SCHEMES;

DATA COMMUNICATION SYSTEMS;

EID: 0031070111     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004460050025     Document Type: Article

References (34)

1. Awerbuch B, Bar-Noy A, Linial N, Peleg D: Improved routing strategies with succint tables. J Algorithms 11: 307-341 (1990)
2. Awerbuch B, Peleg D: Routing with polynomial communication-space trade-off. SIAM J Discrete Math 5: 151-162 (1992)
3. Bakker EM, van Leeuwen J, Tan RB: Linear interval routing Algorithms Rev 2: 45-61 (1991)
4. Dally WJ, Seitz CL: The torus routing chip. Distrib Comput 1: 187-196 (1986)
5. Dally WJ, Seitz CL: Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans Comput C-36: 547-553 (1987)
6. Desprez F, Fleury E, Loi M: T9000 et C104: la nouvelle génération de transputers. Research Report 93-01. LIP, École Normale Supérieure de Lyon, F-69364 Lyon Cedex 07, France, Feb 1993
7. Dijkstra FW: A note on two problems in connexion with graphs. Numer Math 1: 269-271 (1959)
8. Flammini M, van Leeuwen J, Spaccamela AM: Lower bounds on interval routing. Tech. Rep. 69, Università di L'Aquila, Dipartimento di matematica Pura ed Applicata, Oct 1994
9. Floyd RW: Shortest path. Commun ACM 5: 345 (1962)
10. Fraigniaud P, Gavoille C: A characterization of networks supporting linear interval routing. In: 13th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM Press, pp 216-224, Aug 1994
11. Fraigniaud P, Gavoille C: Optimal interval routing. In: Buchberger B, Volkert J (eds) Parallel Processing: CONPAR '94-VAPP VI, Lect Notes Comput Sci, Vol 854, pp 785-796. Springer, Berlin Heidelberg New York 1994
12. Fraigniaud P, Gavoille C: Memory requirement for universal routing schemes. In: 14th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM Press, Aug 1995, pp. 223-230
13. Fraigniaud P, Lazard E: Methods and problems of communication in usual networks. Discrete Appl Maths 53: 79-133 (1994)
14. Fraigniaud P, Liestman A, Sotteau D: Open problems. Parallel Process Lett 3: 507-524 (1993)
15. Frederickson GN, Janardan R: Designing networks with compact routing tables. Algorithmica 3: 171-190 (1988)
16. Frederickson GN, Janardan R: Efficient message routing in planar networks. SIAM J Comput 18: 843-857 (1989)
17. Frederickson GN, Janardan R: Space-efficient message routing in c-decomposable networks. SIAM J Comput 19: 164-181 (1990)
18. Gavoille C: Memory requirement of centralized routing scheme for bounded degree graphs. Manuscript, Dec 1995
19. Gavoille C, Guévremont E: Worst case bounds for shortest path interval routing. Research Report 95-02, LIP, École Normale Supérieure de Lyon. F-69364 Lyon Cedex 07, France, Jan 1995
20. Gavoille C, Pérennès S: Lower bounds for shortest path interval routing. In: 3rd Colloquium on Structural Information & Communication Complexity (SIROCCO), June 1996
21. Gavoille C, Pérennès S: Memory requirement for routing in distributed networks. In: 15th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM Press, May 1996
22. Gondran M, Minoux M: Graphs and Algorithms Wiley 1984
23. Harrison MA: On the number of classes of binary matrices. IEEF Trans Comput C-22: 1048-1051 (1973)
24. Heydemann M, Meyer J, Sotteau D: On forwarding indices of networks. Discrete Appl Math 23: 103-123 (1989)
25. Kolmogorov AN: Three approaches to the quantitative definition of information. Prob Inf Transm 1: 1-7 (1965)
26. Kranakis E, Krizanc D: Lower bounds for compact routing. In: 13th Annual Symposium on Theoretical Aspects of Computer Science (STACS), Feb 1996
27. Kranakis E, Krizanc D, Ravi SS: On multi-label linear interval routing schemes. In: 19th International Workshop on Graph Theoretic Concepts in Computer Science - Distributed Algorithms (WG). Lect Notes Comput Sci, vol 790, pp 338-349, Utrecht, June 1993. Springer, Berlin Heidelberg New York
28. Leighton FT: Introduction to parallel algorithms and architectures: arrays trees hypercubes. Morgan Kaufmann, 1992
29. Peleg D, Schärfer AA: Graph spanners. J Graph Theory 13: 99-116 (1989)
30. Peleg D, Upfal E: Efficient message passing using succint routing tables. Research Report RJ 5768, IBM, 1987
31. Peleg D, Upfal E: A trade-off between space and efficiency for routing tables. In: 20th Annual ACM Symposium on Theory of Computing (STOC), Chicago, IL, May 1988, pp 43-52
32. Santoro N, Khatib R: Labelling and implicit routing in networks. Comput J 28: 5-8 (1985)
33. van Leeuwen J, Tan RB: Interval routing. Comput J 30: 298-307 (1987)
34. Wright EM: Graphs on unlabelled nodes with a given number of edges. Acta Math 126: 1-9 (1971)