Interval Routing Schemes

Algorithmica (New York)

Volumn 16, Issue 6, 1996, Pages 549-568

  Flammini, M ^a,b   Gambosi, G ^c   Salomone, S ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF L'AQUILA   (Italy)

^c UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

Compact routing tables; Distributed systems; Interval routing; NP completeness; Shortest paths representation

Indexed keywords

EID: 0000226643     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf01944351     Document Type: Article

References (17)

1. B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg. Compact distributed data structures for adaptive routing. Proc. 21st ACM Symp. on Theory of Computing, 1989, pp. 479-489.
2. B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg. Improved routing strategies with succinct tables. Journal of Algorithms, 11 (1990), 307-341.
3. B. Awerbuch and D. Peleg. Routing with polynomial communication-space tradeoff. SIAM Journal on Discrete Mathematics, 5(2) (1992), 151-162.
4. E. Bakker, J. van Leeuwen, and R. B. Tan. Linear interval routing. Algorithms Review, 2 (1991), 45-61.
5. N. Christofides. Worst case analysis of a new heuristic for the travelling salesman problem. Report No. 388, GSIA, Carnegie-Mellon University, Pittsburgh, PA, 1976.
6. M. Flammini, G. Gambosi, and S. Salomone. Boolean routing. Proc. 7th Internat. Workshop on Distributed Algorithms (WDAG), Lecture Notes in Computer Science, vol. 725, Springer-Verlag, 1993, pp. 219-233.
7. P. Fraigniaud and C. Gavoille. A characterization of networks supporting linear interval routing. Proc. 13th ACM Symp. on Principles of Distributed Computing, 1994, pp. 216-224.
8. G. N. Frederickson and R. Janardan. Designing networks with compact routing tables. Algorithmica, 3 (1988), 171-190.
9. G. N. Frederickson and R. Janardan. Efficient message routing in planar networks. SIAM Journal on Computing, 18 (1989), 843-857.
10. G. N. Frederickson and R. Janardan. Space efficient message routing in c-decomposable networks. SIAM Journal on Computing, 19 (1990), 164-181.
11. M. R. Garey and D. S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.
12. L. Kleinrock and F. Kamoun. Hierarchical routing for large networks. Computer Networks, 1 (1977), 155-174.
13. L. Kleinrock and F. Kamoun. Optimal clustering structures for hierarchical topological design of large computer networks. Networks, 10 (1980), 221-248.
14. D. Peleg and E. Upfal. A trade-off between space and efficiency for routing tables. Journal of the ACM, 36(3) (1989), 510-530.
15. M. Santoro and R. Khatib. Labelling and implicit routing in networks. The Computer Journal, 28 (1985), 5-8.
16. J. van Leeuwen and R. B. Tan. Routing with compact routing tables. In The book of L, G. Rozemberg and A. Salomaa, eds., Springer-Verlag, New York, 1986, pp. 259-273.
17. J. van Leeuwen and R. B. Tan. Interval routing. The Computer Journal, 30 (1987), 298-307.