Interval routing in some planar networks

Theoretical Computer Science

Volumn 290, Issue 3, 2003, Pages 1503-1540

  Chepoi, Victor ^a   Rollin, Alexis ^a  

^a AIX MARSEILLE UNIVERSITY   (France)

Author keywords

Communication networks; Internal routing; Plane quadrangulation; Shortest path

Indexed keywords

GRAPH THEORY; ROUTING PROTOCOLS; SURVEYING; TELECOMMUNICATION NETWORKS; TRIANGULATION;

INTERNAL ROUTING; INTERVAL ROUTING; LINEAR INTERVALS; NEAR OPTIMALITY; PLANAR NETWORKS; QUADRANGULATION; SHORTEST PATH; SIMPLE CIRCUITS;

NETWORK ROUTING;

EID: 37949012569     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00067-1     Document Type: Article

References (25)

1. [1] Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D., Improved routing strategies with succinct tables. J. Algorithms 11 (1990), 307–341.
2. [2] Bakker, E.M., van Leeuwen, J., Tan, R.B., Linear interval routing. Algorithms Rev. 2 (1991), 45–61.
3. [3] Bandelt, H.-J., Chepoi, V., Cellular bipartite graphs. European J. Combin. 17 (1996), 121–134.
4. 1-embedding of weakly median graphs. European J. Combin. 21 (2000), 701–714.
5. [5] Chepoi, V., Graphs of some CAT(0) complexes. Adv. Appl. Math. 24 (2000), 125–179.
6. [6] Das Sharma, D., Pradhan, D., Submesh allocation in mesh multicomputers using busy-lists: a best-fit approach with complete recognition capability. J. Parallel and Distributed Comput. 36 (1996), 106–118.
7. [7] Deza, M., Laurent, M., Geometry of Cuts and Metrics, 1997, Springer, Berlin.
8. [8] Djoković, D.Ž., Distance-preserving subgraphs of hypercubes. J. Combin. Theory Ser. B 14 (1973), 263–267.
9. [9] Eilam, T., Moran, S., Zaks, S., The complexity of characterization of networks supporting shortest-path interval routing. 4th Colloq. on Structural Information and Communication Complexity (SIROCCO), 1997, Carleton University Press, Waterloo, Ontario, 99–111.
10. [10] M. Flammini, Deadlock-free interval routing schemes, in: 14th Annu. Symp. on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science, Vol. 1200, Springer, Berlin, 1997, pp. 351–362.
11. [11] Fraigniaud, P., Gavoille, C., Interval routing schemes. Algorithmica 21 (1998), 155–182.
12. [12] Fraigniaud, P., Vial, S., One-to-all and all-to-all communications in partial meshes. Parallel Process. Lett. 9 (1999), 9–20.
13. [13] Frederickson, G.N., Janardan, R., Designing networks with compact routing tables. Algorithmica 3 (1988), 171–190.
14. [14] Frederickson, G.N., Janardan, R., Efficient message routing in planar networks. SIAM J. Comput. 19 (1990), 164–181.
15. [15] Gavoille, C., A survey on interval routing. Theoret. Comput. Sci. 245 (2000), 217–253.
16. [16] C. Gavoille, S. Pérennès, Lower bounds for interval routing on 3-regular networks, in: N. Santoro, P. Spirakis (Eds.), 3rd Internat. Colloq. on Structural Information and Communication Complexity (SIROCCO) Carleton University Press, Waterloo, Ontario, 1996, pp. 88–103.
17. [17] J. van Leeuwen, R.B. Tan, Computer networks with compact routing tables, in: The Book of L, Springer, Berlin, 1986, pp. 298–307.
18. [18] van Leeuwen, J., Tan, R.B., Interval routing. Comput. J. 30 (1987), 298–307.
19. [19] Millman, R.S., Parker, G.D., Geometry. A metric approach with models, 1991, Springer, Berlin.
20. [20] Narayanan, L., Nishimura, N., Interval routing on k-trees. J. Algorithms 26 (1998), 325–369.
21. [21] Narayanan, L., Shende, S., Partial characterizations of networks supporting shortest path interval labelling schemes. Networks 32 (1998), 103–113.
22. [22] Peleg, D., Upfal, E., A trade-off between space and efficiency for routing tables. J. ACM 36 (1989), 510–530.
23. [23] Santoro, N., Khatib, R., Labeling and implicit routing in networks. Comput. J. 30 (1987), 298–307.
24. [24] 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.
25. [25] van de Vel, M.L.J., Theory of Convex Structures, 1993, North-Holland, Amsterdam.