Worst Case Bounds for Shortest Path Interval Routing

Journal of Algorithms

Volumn 27, Issue 1, 1998, Pages 1-25

  Gavoille, Cyril ^a   Guévremont, Eric ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002845131     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1997.0915     Document Type: Article

References (24)

1. B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg, Improved routing strategies with succinct tables, J. Algorithms 11 (1990), 307-341.
2. B. Awerbuch and D. Peleg, Routing with polynomial communication-space trade-off, SIAM J. Discrete Math. 5(2) (1992), 151-162.
3. K. S. Booth and G. S. Lueker, Testing for the consecutive ones property, interval graphs and graphs planarity using pq-tree algorithms, J. Comput. System Sci. 13 (1976), 335-379.
4. E. M. Bakker, J. van Leeuwen, and R. B. Tan, Linear interval routing, Algorithms Review 2 (1991), 45-61.
5. P. Fraigniaud and C. Gavoille, A characterization of networks supporting linear interval routing, in "13th Annual ACM Symposium on Principles of Distributed Computing (PODC)," pp. 216-224, Assoc. Comput. Mach., New York, 1994.
6. P. Fraigniaud and C. Gavoille, Interval routing schemes, Research Report 94-04, LIP, École Normale Supérieure de Lyon, France, January 1994. (To appear in Algorithmica.)
7. P. Fraigniaud and C. Gavoille, Optimal interval routing, in "Parallel Processing: CONPAR '94 - VAPP VI" (B. Buchberger and J. Volkert, Eds.), Lecture Notes in Computer Science, Vol. 854, pp. 785-796, Springer-Verlag, Berlin/New York, 1994.
8. M. Flammini, G. Gambosi, and S. Salomone, Boolean routing, in "7th International Workshop on Distributed Algorithms (WDAG)," Lecture Notes in Computer Science, Vol. 725, pp. 219-233, Springer-Verlag, Berlin/New York, 1993.
9. M. Flammini, G. Gambosi, and S. Salomone, Interval labeling schemes for chordal rings, in "1st International Colloquium on Structural Information & Communication Complexity (SIROCCO)" (P. Flocchini, B. Mans, and N. Santoro, Eds.), pp. 111-124, Carleton Univ. Press, 1994.
10. M. Flammini, G. Gambosi, and S. Salomone, Interval routing schemes, in "12th Annual Symposium on Theoretical Aspects of Computer Science (STACS)" (E. W. Mayr and C. Puech, Eds.), Lecture Notes in Computer Science, Vol. 900, pp. 279-290, Springer-Verlag, Berlin/New York, 1995.
11. G. N. Frederickson and R. Janardan, Designing networks with compact routing tables, Algorithmica 3 (1988), 171-190.
12. G. N. Frederickson and R. Janardan, Efficient message routing in planar networks, SIAM J. Comput. 18(4) (1989), 843-857.
13. G. N. Frederickson and R. Janardan, Space-efficient message routing in c-decomposable networks, SIAM J. Comput. 19(1) (1990), 164-181.
14. M. Flammini, Private communication in New York, June 1994.
15. M. Flammini, J. van Leeuwen, and A. Marchetti-Spaccamela, Lower bounds on interval routing, Technical Report 69, Dipartimento di Matematica Pura ed Applicata, Università di L'Aquila, October 1994.
16. M. R. Garey and D. S. Johnson, "Computers and Intractability - A Guide to the Theory of NP-Completeness," Freeman, New York, 1977.
17. F. Harary, "Graph Theory," Addison-Wesley, Reading, MA, 1969.
18. E. Kranakis, D. Krizanc, and S. S. Ravi, On multi-label linear interval routing schemes, in "19th International Workshop on Graph-Theoretic Concepts in Computer Science - Distributed Algorithms (WG)," Lecture Notes in Computer Science, Vol. 790, pp. 338-349, Springer-Verlag, Berlin/New York, 1993.
19. F. J. MacWilliams and N. J. A. Sloane, "The Theory of Error-Correcting Codes," North-Holland, Amsterdam, 1977.
20. M. D. May, P. W. Thompson, and P. H. Welch, Networks, routers and transputers: Function, performance, and applications, technical report, Inmos, SGS-THOMSON, 1993.
21. D. Peleg and E. Upfal, A trade-off between space and efficiency for routing tables, in "20th Annual ACM Symposium on Theory of Computing (STOC)," pp. 43-52, Chicago, IL, May 1988.
22. P. Ružička, On efficiency of interval routing algorithms, in "13rd International Symposium on Mathematical Foundations of Computer Science (MFCS)" (M. P. Chytil, L. Janiga, and V. Koubek, Eds.), Lecture Notes in Computer Science, Vol. 324, pp. 492-500, Springer-Verlag, 1988.
23. N. Santoro and R. Khatib, Labelling and implicit routing in networks, The Computer Journal 28(1) (1985), 5-8.
24. J. van Leeuwen and R. B. Tan, Interval routing, The Computer Journal 30(4) (1987), 298-307.