The complexity of interval routing on random graphs

Computer Journal

Volumn 41, Issue 1, 1998, Pages

  Flammini, Michele ^a   Van Leeuwen, Jan ^b   Marchetti Spaccamela, Alberto ^c  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b UTRECHT UNIVERSITY   (Netherlands)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 11744352063     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/41.1.16     Document Type: Article

References (48)

1. Fraigniaud, P. and Gavoille, C. (1995) Memory requirement for universal routing schemes. In ACM Press (ed.), Proc. 14th Annual ACM Symp. on Principles of Distributed Computing (PODC 95), Ottawa, Ontario, Canada, pp. 223-230.
2. Fraigniaud, P. and Gavoille, C. (1996) Local memory requirement of universal routing schemes. In ACM Press (ed.), Proc. 8th Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA 96), Padua, Italy, pp. 183-188.
3. Gavoille, C. and Pérennès, S. (1996) Memory requirement for routing in distributed networks. In ACM Press (ed.), Proc. 15th Annual ACM Symp. on Principles of Distributed Computing (PODC 96), Philadelphia, PA, pp. 125-133.
4. Buhrman, H., Hoepman, J. H. and Vitányi, P. (1995) Optimal routing tables. Manuscript, Centre for Mathematics and Computer Science, Amsterdam, The Netherlands.
5. Hoepman, J. H. (1996) Communication, synchronization, fault tolerance, Ph.D. Thesis, University of Amsterdam, The Netherlands.
6. Gavoille, C. (1997) A survey on interval routing schemes. Research Rep. RR-1182-97, Labri, University of Bordeaux, France.
7. van Leeuwen, J. and Tan, R. B. (1994) Compact routing methods: a survey. In Flocchini, P., Mans, B. and Santoro, N. (eds), Structure, Information and Communication Complexity (SICC 94), Proc. 1st Int. Colloquium, Carleton University Press, Ottawa, Ontario, Canada, pp. 71-93.
8. Vounckx, J., Deconinck, G., Cuyvers, R., Lauwereins, R. and Peperstraete, J. A. (1993) A survey of compact routing techniques. Internal Report, Electrotechnical Dept (ESAT-ACCA), Kath. Universiteit Leuven, Heverlee, Belgium.
9. van Leeuwen, J. and Tan, R. B. (1987) Interval routing. Comput. J., 30, 298-307.
10. Bakker, E. M. (1991) Combinatorial problems in information networks and distributed datastructuring. Ph.D. Thesis, Department of Computer Science, Utrecht University, The Netherlands.
11. Bakker, E. M., van Leeuwen, J. and Tan, R. B. (1991) Linear interval routing. Algorithms Rev., 2, 45-61.
12. van Leeuwen, J. and Tan, R. B. (1986) Routing with compact routing tables. In Rozenberg, G. and Salomaa, A. (eds), The book of L, pp. 259-273. Springer-Verlag, Berlin.
13. Santoro, N. and Khatib, R. (1985) Labelling and implicit routing in networks. Comput., 28, 5-8.
14. Frederickson, G. N. and Janardan, R. (1988) Designing networks with compact routing tables. Algorithmica, 3, 171-190.
15. Frederickson, G. N. and Janardan, R. (1989) Efficient message routing in planar networks. SIAM J. Comput., 18, 843-857.
16. Frederickson, G. N. and Janardan, R. (1990) Space-efficient message routing in c-decomposable networks. SIAM J. Comput., 19, 164-181.
17. Fraigniaud, P. and Gavoille, C. (1994) Optimal interval routing. In Buchberger, B. and Volkert, J. (eds), Parallel Processing: CONPAR 94 - VAPP VI, Proc. 3rd Joint Int. Conference, Linz, Austria. Lecture Notes in Computer Science, 854, 785-796. Springer-Verlag, Berlin.
18. Awerbuch, B., Bar-Noy, A., Linial, N. and Peleg, D. (1989) Compact distributed data structures for adaptive routing. Proc. 21st Annual ACM Symp. on Theory of Computing, Seattle, WA, pp. 479-489.
19. Awerbuch, B., Bar-Noy, A., Linial, N. and Peleg, D. (1990) Improved routing strategies with succinct tables. J. Algorithms, 11, 307-341.
20. Peleg, D. and Upfal, E. (1989) A trade-off between space and efficiency for routing tables. J. ACM, 36, 510-530.
21. May, D. and Thompson, P. (1991) Transputers and Routers: Components for Concurrent Machines. Inmos, Bristol, UK.
22. Hofestädt, H., Klein, A. and Reyzl, E. (1991) Performance benefits from locally adaptive interval routing in dynamically switched interconnection networks. In Bode, A. (ed.), Distributed Memory Computing, Proc. 2nd European Conference, Munich, Germany. Lecture Notes in Computer Science, 487, 193-202. Springer-Verlag, Berlin.
23. Vounckx, J., Deconinck, G., Cuyvers, R., Lauwereins, R. and Peperstraete, J. A. (1993) Network fault-tolerance with interval routing devices. In Proc. 11th IASTED Int. Symposium on Applied Informatics, Annecy, France, pp. 293-296.
24. Vounckx, J., Deconinck, G., Lauwereins, R. and Peperstraete, J. A. (1994) Fault-tolerant compact routing based on reduced structural information in wormhole-switching based networks. In Flocchini, P., Mans, B. and Santoro, N. (eds), Structure, Information and Communication Complexity (SICC 94), Proc. 1st Int. Colloquium, Carleton University Press, Ottawa, Ontario, Canada, pp. 125-147.
25. Vounckx, J., Deconinck, G., Lauwereins, R. and Peperstraete, J. A. (1994) Deadlock-free fault-tolerant wormhole routing in mesh-based massively parallel systems. In Technical Committee on Computer Architecture (TCCA) Newsletter, Summer-Fall, pp. 49-54. IEEE Computer Society, Los Alamitos, CA.
26. Vounckx, J., Deconinck, G., Lauwereins, R. and Peperstraete, J. A. (1994) Minimal deadlock-free compact routing in wormhole-switching based injured meshes. Internal Report, Electrotechnical Dept (ESAT-ACCA), Kath. Universiteit Leuven, Heverlee. Also in Proc. 2nd Reconfigurable Architectures Workshop, Santa Barbara, CA (1995).
27. Vounckx, J., Deconinck, G., Lauwereins, R. and Peperstraete, J. A. (1994) Minimal deadlock-free compact routing in wormhole-switching based injured meshes. Internal Report, Electrotechnical Dept (ESAT-ACCA), Kath. Universiteit Leuven, Heverlee. Also in Proc. 2nd Reconfigurable Architectures Workshop, Santa Barbara, CA (1995).
28. Bakker, E. M., van Leeuwen, J. and Tan, R. B. (1993) Prefix routing schemes in dynamic networks. Comput. Networks ISDN Systems, 26, 403-421.
29. Flammini, M., Gambosi, G. and Salomone, S. (1993) Boolean routing. In Schiper, A. (ed.), Distributed Algorithms, Proc. 7th Int. Workshop (WDAG 93), Lausanne, Switzerland. Lecture Notes in Computer Science, 725, 219-233. Springer-Verlag, Berlin.
30. Flammini, M., Gambosi, G. and Salomone, S. (1995) On Devising Boolean Routing Schemes. In Nagl, M. (ed.), Graph-Theoretic Concepts in Computer Science, Proc. 21st International Workshop (WG 95), Aachen, Germany. Lecture Notes in Computer Science, 1017, 222-236. Springer-Verlag, Berlin.
31. Flammini, M. and Gambosi, G. (1997) On Devising Boolean Routing Schemes. Theor. Comput. Sci., 186, 171-198.
32. Flammini, M., Gambosi, G., Nanni, U. and Tan, R. B. (1995) Multi-Dimensional Interval Routing Schemes, In Hélary, J. M. and Raynal, M. (eds), Distributed Algorithms, Proc. 9th Int. Workshop (WDAG 97), Le Mont-Saint-Michel, France. Lecture Notes in Computer Science, 972, 131-144. Springer-Verlag, Berlin. Full version to appear in Theor. Comput. Sci.
33. Flammini, M., Gambosi, G. and Salomone, S. (1995) Interval routing schemes. In Mayr, E. W. and Puech, C. (eds), STACS 95, Proc. 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany. Lecture Notes in Computer Science, 900, 279-290. Springer-Verlag, Berlin.
34. Ružička, P. (1988) On efficiency of interval routing algorithms. In Chytil, M. P., Janiga, L. and Koubek, V. (eds), Mathematical Foundations of Computer Science 1988, Proc. 13th Int. Symposium, Carlsbad, Czechoslovakia. Lecture Notes in. Computer Science, 324, 492-500. Springer-Verlag, Berlin.
35. Ružička, P. (1991) A note on the efficiency of an interval routing algorithm. Comput. J., 34, 475-476.
36. Tse, S. S. H. and Lau, F. C. M. (1994) A lower bound for interval routing in general networks. Networks, 29, 49-53.
37. Tse, S.-S. H. and Lau, F. C. M. (1995) On 2-label interval routing. Technical Report, Department of Computer Science, The University of Hong Kong, Hong Kong.
38. Kranakis, E., Krizanc, D. and Ravi, S. S. (1993) On multi-label linear interval routing schemes. In van Leeuwen, J. (ed.), Graph-Theoretic Concepts in Computer Science, Proc. 19th Int. Workshop (WG 93), Utrecht, The Netherlands.
39. Gavoille, C. and Guévremont, E. (1995) Worst case bounds for shortest-path interval routing. Research Rep. 95-02, Lab. de l'Informatique du Parallélisme, Ecole Normale Supérieure de Lyon, France. To appear in J. Algorithms.
40. Gavoille, C. (1996) Complexité Mémoire de Routage dans les Réseaux Distribués. Thèse, Ecole Normale Supérieure de Lyon, France.
41. Bodlaender, H. L., Tan, R. B., Thilikos, D. and van Leeuwen, J. (1995) On interval routing schemes and treewidth. In Nagl, M (ed.), Graph-Theoretic Concepts in Computer Science, Proc. 21st International Workshop (WG 95), Aachen, Germany. Lecture Notes in Computer Science, 1017, 181-196. Springer-Verlag, Berlin. Full version to appear in Information Computat.
42. Kloks, T. (1994) Treewidth; computations and approximations. Lecture Notes in Computer Science, 842, Springer-Verlag, Berlin.
43. Flammini, M., Gambosi, G. and Salomone, S. (1996) Interval routing schemes. Algorithmica, 16, 549-568.
44. Flammini, M., van Leeuwen, J. and Marchetti-Spaccamela, A. (1995) Lower bounds on interval routing. In Wiedermann, J. and Hájek, P. (eds), Mathematical Foundations of Computer Science 1995, Proc. 20th Int. Symposium, Prague, Czech Republic. Lecture Notes in Computer Science, 969, 37-49. Springer-Verlag, Berlin.
45. Bollobás, B. (1985) Random Graphs. Academic Press, London.
46. Chernoff, H. (1952) A measure of the asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Statistics, 23, 493-509.
47. Angluin, D. and Valiant, L. G. (1979) Fast probabilistic algorithms for Hamiltonian circuits and matchings. J. Comp. Syst. Sci., 18, 155-193.
48. Port, S. C. (1994) Theoretical Probability for Applications. J. Wiley & Sons, New York.