A survey on interval routing

Theoretical Computer Science

Volumn 245, Issue 2, 2000, Pages 217-253

  Gavoille, Cyril ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Broadcasting; Compact routing; Interval routing; Networks; Routing tables

Indexed keywords

EID: 0000783882     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00283-2     Document Type: Article

References (84)

1. E.M. Bakker, J. van Leeuwen, R.B. Tan, Linear interval routing, Algorithms Rev. 2 (1991) 45-61.
2. E.M. Bakker, J. van Leeuwen, R.B. Tan, Unpublished manuscript, 1994.
3. J.-C. Bermond, F. Comellas, D. Hsu, Distributed loop computer networks: a survey, J. Parallel Distributed Comput. 24 (1995) 2-10.
4. H.L. Bodlaender, A tourist guide through treewidth, Technical Report RUU-CS-92-12, Utrecht University, March 1992, Revised March 1993.
5. H.L. Bodlaender, J.V. Leeuwen, R.B. Tan, D. Thilikos, On interval routing schemes and treewidth, Inform. Comput. 139 (1997) 92-109.
6. V. Braume, Theoretische und experimentelle Analyse von Intervall-Routing Algorithmen, Ph.D. Thesis, Department of Mathematics and Computer Science, University of Paderborn, 1993.
7. H. Buhrman, J.-H. Hoepman, P. Vitányi, Optimal routing tables, in: 15th Ann. ACM Symp. on Principles of Distributed Computing (PODC), ACM Press, New York, May, 1996, pp. 134-142.
8. S. Cicerone, G. Di Stefano, M. Flammini, Static and dynamic low congested interval routing schemes, in: K.G. Larsen, S. Skyum, G. Winskel (Eds.), 25th International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, vol. 1443, Springer, Berlin, July 1998, pp. 592-603.
9. W.J. Dally, C.L. Seitz, Deadlock-free message routing in multiprocessor interconnection networks, IEEE Trans. Comput. C-36 (1987) 547-553.
10. P. de la Torre, L. Narayanan, D. Peleg, Thy neighbor's interval is greener: a proposal for exploiting interval routing schemes, in: 5th Internat. Coll. on Structural Information & Communication Complexity (SIROCCO), Carleton Scientific, 1998.
11. R.J. Duffin, Topology of series parallel graphs, J. Math. Anal. Appl. 10 (1965) 303-318.
12. T. Eilam, C. Gavoille, D. Peleg, Compact routing schemes with low stretch factor, in: 17th Ann. ACM Symp. on Principles of Distributed Computing (PODC), ACM PRESS, New York, August 1998, pp. 11-20.
13. T. Eilam, S. Moran, S. Zaks, A lower bound for linear interval routing, in: Ö. Babaoǧlu, K. Marzullo (Eds.), 10th Internat. Workshop on Distributed Algorithms (WDAG), Lecture Notes in Computer Science, vol. 1151, Springer, Berlin, October 1996, pp. 191-205.
14. T. Eilam, S. Moran, S. Zaks, The complexity of the characterization of networks supporting shortest-path interval routing, in: D. Krizanc, P. Widmayer (Eds.), 4th Internat. Coll. on Structural Information & Communication Complexity (SIROCCO), Carleton Scientific, July 1997, pp. 99-111.
15. T. Eilam, S. Moran, S. Zaks, A simple DFS-based algorithm for linear interval routing, in: M. Mavronicolas, P. Tsigas (Eds.), 11th Internat. Workshop on Distributed Algorithms (WDAG), Lecture Notes in Computer Science, vol. 1320, Springer, Berlin, September 1997, pp. 37-51.
16. T. Eilam, D. Peleg, R.B. Tan, S. Zaks, Broadcast in linear messages in IRS representing all shortest paths, manuscript, 1997.
17. M. Flammini, Deadlock-free interval routing schemes, in: R. Reischuk, M. Morvan (Eds.), 14th Ann. Symp. on Theoretical Aspects of Computer Science (STAGS), Lecture Notes in Computer Science, vol. 1200, Springer, Berlin, February 1997, pp. 351-362.
18. M. Flammini, On the hardness of devising interval routing schemes, Parallel Process. Lett. 7 (1997) 39-47.
19. M. Flammini, G. Gambosi, U. Nanni, R.B. Tan, Multidimensional interval routing schemes, Theoret. Comput. Sci. 205 (1995) 115-133.
20. M. Flammini, G. Gambosi, U. Nanni, R.B. Tan, Characterization results of all shortest paths interval routing schemes, 5th Internat. Coll. on Structural Information & Communication Complexity (SIROCCO), 1998, pp. 201-213.
21. M. Flammini, G. Gambosi, S. Salomone, Interval labeling schemes for chordal rings, in: P. Flocchini, B. Mans, N. Santoro (Eds.), 1st Internat. Coll. on Structural Information & Communication Complexity (SIROCCO), Carleton University Press, May 1994, pp. 111-124.
22. M. Flammini, G. Gambosi, S. Salomone, Interval routing schemes, in: E.W. Mayr, C. Puech (Eds.), 12th Ann. Symp. on Theoretical Aspects of Computer Science (STAGS), Lecture Notes in Computer Science, vol. 900, Springer, Berlin, March 1995, pp. 279-290.
23. M. Flammini, E. Nardelli, On the path length in interval routing schemes, manuscript, 1996.
24. M. Flammini, J. van Leeuwen, A. Marchetti-Spaccamela, The complexity of interval routing on random graphs, in: J. Wiederman, P. Hájek (Eds.), 20th Internat. Symp. on Mathematical Foundations of Computer Sciences (MFCS), Lecture Notes in Computer Science, vol. 969, Springer, Berlin, August 1995, pp. 37-49.
25. P. Flocchini, F.L. Luccio, Distance routing on series parallel networks, in: 16th IEEE Internat. Conf. on Distributed Computing Systems, March 1996, pp. 352-359.
26. P. Flocchini, B. Mans, N. Santoro, On the impact of sense of direction on communication complexity, Inform. Process. Lett. 63 (1997) 23-31.
27. P. Flocchini, B. Mans, N. Santoro, Sense of direction: definitions, properties and classes, Networks 32 (1998) 165-180.
28. P. Flocchini, B. Mans, N. Santoro, Sense of direction in distributed computing, in: S. Kutten (Ed.), 12th Internat. Symp. on Distributed Computing (DISC), Lecture Notes in Computer Science, vol. 1499, Springer, Berlin, September 1998, pp. 1-15.
29. P. Fraigniaud, C. Gavoille, Universal routing schemes, J. Distributed Comput. 10 (1997) 65-78.
30. P. Fraigniaud, C. Gavoille, Interval routing schemes, Algorithmica 21 (1988) 155-182.
31. P. Fraigniaud, C. Gavoille, D. Krizanc, Communication during the visit of Danny Krizanc at LIP, Ecole Normale Supérieure de Lyon, February 1997.
32. G.N. Frederickson, R. Janardan, Designing networks with compact routing tables, Algorithmica 3 (1988) 171-190.
33. G.N. Frederickson, R. Janardan, Space-efficient message routing in c-decomposable networks, SIAM J. Comput. 19 (1990) 164-181.
34. G. Gallager, P.A. Humblet, P.M. Spira, A distributed algorithm for minimal spanning tree, ACM Trans. Programming Languages Systems 30 (1983) 66-77.
35. G. Gambosi, P. Vocca, Topological routing schemes, in: Ö. Babaoǧlu, K. Marzullo (Eds.), 10th Internat. Workshop on Distributed Algorithms (WDAG), Lecture Notes in Computer Science, vol. 1151, Springer, Berlin, October 1996, pp. 206-219.
36. C. Gavoille, Lower bounds for interval routing on bounded degree networks, Research Report, RR-1144-96, LaBRI, University of Bordeaux, 351, cours de la Libération, 33405 Talence Cedex, France, October 1996.
37. C. Gavoille, On the dilation of interval routing, in: I. Prívara, P. Ružička (Eds.), 22nd Internat. Symp. on Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science, vol. 1300, Springer, Berlin, August 1997, pp. 259-268.
38. C. Gavoille, E. Guévremont, Worst case bounds For shortest path interval routing, J. Algorithms 27 (1988) 1-25.
39. C. Gavoille, B. Mans, Private communication, August 1997.
40. C. Gavoille, D. Peleg, The compactness of interval routing, Research Report RR-1176-97, LaBRI, University of Bordeaux, 351, cours de la Libération, 33405 Talence Cedex, France, September 1997, SIAM J. Discrete Mathematics, to appear.
41. C. Gavoille, D. Peleg, The compactness of interval routing for almost all graphs, in: S. Kutten (Ed.), 12th Internat. Symp. on Distributed Computing (DISC), Lecture Notes in Computer Science, vol. 1499, Springer, Berlin, September 1998, pp. 161-174.
42. C. Gavoille, S. Pérennès, Lower bounds for interval routing on 3-regular networks, in: N. Santoro, P. Spirakis (Eds.), 3rd Internat. Coll. on Structural Information & Communication Complexity (SIROCCO), Carleton University Press, June 1996, pp. 88-103.
43. C. Gavoille, S. Pérennès, Memory requirement for routing in distributed networks, in: 15th Ann. ACM Symp. on Principles of Distributed Computing (PODC), ACM Press, New York, 1996, pp. 125-133.
44. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, Harcourt Brace, Jovanovich, Academic Press ed., 1980.
45. M.J. Hall, Combinatorial Theory, 2nd Edition, Wiley-Interscience Publication, New York, 1986.
46. M.-C. Heydemann, J. Meyer, D. Sotteau, On forwarding indices of networks, Discrete Appl. Math. 23 (1989) 103-123.
47. H. Hofestädt, A. Klein, E. Reyzl, Performance benefits from locally adaptative interval routing in dynamically switched interconnection networks, in: A. Bode (Ed.), Distributed Memory Computing: 2nd Eur. Conf. EDMCC2, Lecture Notes in Computer Science, vol. 487, Munich, April 1991, Springer, Berlin, pp. 193-202.
48. M. Juganaru, Routage avec table de routage compacte, stage de DEA, ENSIMAG, Grenoble, June 1993.
49. T. Kloks, Treewidth: Computations and Approximations, Lectures Notes in Computer Science, vol. 842, Springer, Berlin, June 1994.
50. R. Kráľovič, B. Rovan, P. Ružička, D. Štefankovič, Efficient deadlock-free multi-dimensional interval routing in interconnection networks, in: S. Kutten (Ed.), 12th Internat. Symp. on Distributed Computing (DISC), Lectures Notes in Computer Science, vol. 1499, Springer, Berlin, September 1998, pp. 273-287.
51. R. Kráľovič, P. Ružička, D. Štefankovic, The complexity of shortest path and dilation bounded interval routing, in: C. Lengaur, M. Griebl, S. Gorlatch (Eds.), 3rd Internat. Euro-Par Conf., Lectures Notes in Computer Science, vol. 1300, Springer, Berlin, August 1997, pp. 258-265.
52. R. Kráľovič, P. Ružička, D. Štefankovic, The complexity of shortest path and dilation bounded interval routing, (full version of [51]), Theoret. Comput. Sci. 1997, to appear.
53. E. Kranakis, D. Krizanc, Lower bounds for compact routing, in: C. Puech, R. Reischuk (Eds.), 13th Ann. Symp. on Theoretical Aspects of Computer Science (STAGS), Lecture Notes in Computer Science, vol. 1046, Springer, Berlin, February 1996.
54. E. Kranakis, D. Krizanc, S.S. Ravi, On multi-label linear interval routing schemes, in: 19th Internat. Workshop on Graph - Theoretic Concepts in Computer Science - Distributed Algorithms (WG), Lecture Notes in Computer Science, vol. 790, Springer, Berlin, June 1993, pp. 338-349.
55. D. Krizanc, F.L. Luccio, Boolean routing on chordal rings, in: L.M. Kirousis, E. Kranakis (Eds.), 2nd Internat. Coll. on Structural Information & Communication Complexity (SIROCCO), Carleton University Press, June 1995, pp. 89-100.
56. M. Li, P.M.B. Vitányi, An Introduction to Kolmogorov Complexity and its Applications, Springer, Berlin, 1993.
57. P. Loh, J. Wenge, Adaptive, fault-tolerant, deadlock-free and livelock-free interval routing in mesh networks, in: 2nd IEEE Internat. Conf. on Algorithms & Architectures for Parallel Processing (ICAPP), June 1996, pp. 348-355.
58. B. Mans, On the interval routing of chordal rings of degree 4, in: Zomaya, Hsu, Ibarra, Horiguchi, Nassimi and Palis, International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN), June 1999, pp. 16-21.
59. D. May, P. Thompson, Transputers and Routers: Components for concurrent machines, INMOS Ltd., 1990.
60. L. Narayanan, N. Nishimura, Interval routing on k-trees, in: N. Santoro, P. Spirakis (Eds.), 3rd Internat. Coll. on Structural Information & Communication Complexity (SIROCCO), Carleton University Press, June 1996, pp. 104-118.
61. L. Narayanan, J. Opatmy, Compact routing on chordal rings of degree four, in: D. Krizanc, P. Widmayer (Eds.), 4th Internat. Coll. on Structural Information & Communication Complexity (SIROCCO), Carleton Scientific, July 1997, pp. 125-137.
62. L. Narayanan, S. Shende, Characterizations of networks supporting shortest-path interval labeling schemes, in: N. Santoro, P. Spirakis (Eds.), 3rd Internat. Coll. on Structural Information & Communication Complexity (SIROCCO), Carleton University Press, June 1996, pp. 73-87.
63. D. Peleg, E. Upfal, A trade-off between space and efficiency for routing tables, in: 20th Ann. ACM Symp. on Theory of Computing (STOC), Chicago, IL, May 1988, pp. 43-52.
64. P. Ružička, On efficiency of interval routing algorithms, in: M. Chytil, L. Janiga, V. Koubek (Eds.), 13rd Internat. Symp. on Mathematical Foundations of Computer Science (MFCS), Lectures Notes in Computer Science, vol. 324, Springer, Berlin, 1988, pp. 492-500.
65. P. Ružička, D. Štefankovič, On the complexity of multi-dimensional interval routing schemes, Theoret. Comput. Sci. 1997, Submitted for publication.
66. I. Sakho, L. Mugwaneza, Y. Langue, Routing with compact tables: interval labelling scheme for generalized meshes, in: C. Girault (Ed.), IFIP Transactions: Applications in Parallel and Distributed Computing (APDC), Elsevier Science B.V., North-Holland, Amsterdam, 1994, pp. 297-308.
67. N. Santoro, R. Khatib, Routing without routing tables, Technical Report SCS-TR-6 School of Computer Science, Carleton University, Ottawa, 1982.
68. N. Santoro, R. Khatib, Labelling and implicit routing in networks, Comp. J. 28 (1985) 5-8.
69. H. Schomberg, Chord and shuffle augmented mesh topologies for messages-passing multicomputers, manuscript, 1997.
70. Siena Research School, Communication at the Siena Research School '97 on "Compact Routing and Sense of Direction", June 1997.
71. G. Tel, Introduction to Distributed Algorithms, Cambridge University Press, Cambridge, 1994.
72. S.S.H. Tse, F.C.M. Lau, Lower bounds for multi-label interval routing, in: L.M. Kirousis, E. Kranakis (Eds.), 2nd Internat. Coll. on Structural Information & Communication Complexity (SIROCCO), Carleton University Press, June 1995, pp. 123-134.
73. S.S.H. Tse, F.C.M. Lau, A lower bound for interval routing in general networks, Networks 29 (1997) 49-53.
74. S.S.H. Tse, F.C.M. Lau, An optimal lower bound for interval routing in general networks, in: D. Krizanc, P. Widmayer (Eds.), 4th Internat. Coll. on Structural Information & Communication Complexity (SIROCCO), Carleton Scientific, July 1997, pp. 112-124.
75. S.S.H. Tse, F.C.M. Lau, Some lower-bound results on interval routing in planar graphs, Technical Report TR-97-05, Department of Computer Science, The University of Hong Kong, April 1997.
76. J. van Leeuwen, R.B. Tan, Routing with compact routing tables, Technical Report RUU-CS-83-16, Department of Computer Science, University of Utrecht, Utrecht, November 1983.
77. J. van Leeuwen, R.B. Tan, Computer networks with compact routing tables, in: L.G. Rozemberg, A. Salomaa (Eds.), The Book, Springer, Berlin, 1986, pp. 259-273.
78. J. van Leeuwen, R.B. Tan, Interval routing, Comput. J. 30 (1987) 298-307.
79. J. van Leeuwen, R.B. Tan, Compact routing methods: a survey, in: P. Flocchini, B. Mans, N. Santoro (Eds.), 1st Internat. Coll. on Structural Information & Communication Complexity (SIROCCO), Carleton University Press, May 1994, pp. 99-110.
80. J. Vounckx, G. Deconinck, R. Lauwereins, J.A. Peperstraete, Fault-tolerant compact routing based on reduced structural information in wormhole-switching based networks, in: P. Flocchini, B. Mans, N. Santoro (Eds.), 1st Internat. Coll. on Structural Information & Communication Complexity (SIROCCO), Carleton University Press, May 1994, pp. 125-147.
81. A. Zemmari, Routage compact et adaptatif, stage de DEA, Université de Bordeaux, 351 cours de la Libération, 33405 Talence cedex, France, June 1997, "http://www.labri.u-bordeaux.fr/~gavoille/article/ Zemmari97.ps.gz", An English version is in preparation.
82. B. Zerrouk, J. Blin, A. Greiner, Encapsuling networks and routing, in 8th Internat. Parallel Process. Symp. (IPPS), 1994, pp. 546-553.
83. B. Zerrouk, V. Reibaldi, F. Potter, A. Greiner, D. Anne, RCube: a gigabit serial links low latency adaptive router, in the Records of the IEEE Hot Interconnects IV, Palo Alto CA, U.S.A, August 1996.
84. B. Zerrouk, S. Tricot, B. Rottembourg, L. Patnaik, Proper linear interval routing schemes, Technical Report N 94-29, IBP-MASI, October 1994.