A Trade-Off Between Space and Efficiency for Routing Tables

Journal of the ACM (JACM)

Volumn 36, Issue 3, 1989, Pages 510-530

  Peleg, David ^a   Upfal, Eli ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES--GRAPH THEORY;

HIERARCHICAL ROUTING; LOWER BOUNDS; RANDOM GRAPHS; ROUTING TABLES;

COMPUTER NETWORKS;

EID: 0024701852     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/65950.65953     Document Type: Article

References (21)

1. AWERBUCH, B. Complexity of network synchronization. J. ACM 32, 4 (Oct. 1985), 804-823.
2. AWERBUCH, B., BAR-NOY, A., LINIAL, N., AND PELEG, D. Improved routing strategies with succinct tables. Tech. Rep. MIT/LCS/TM-354. MIT, Cambridge, Mass., Apr. 1988.
3. AWERBUCH, B., BAR-NOY, A., LINIAL, N., AND PELEG, D. Memory-balanced routing strategies. Tech. Rep. MIT/LCS/TM-369. MIT, Cambridge, Mass., Aug. 1988.
4. AWERBUCH, B., BAR-NOY, A., LINIAL, N., AND PELEG, D. Compact distributed data structures for adaptive routing. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (Seattle, Wash., May 15-17). ACM, New York, 1989, pp. 479-489.
5. BARATZ, A. E., AND JAFFE, J. M. Establishing virtual circuits in large computer networks. Comput. Netw. 12 (1986), 27-37.
6. BOLLOBAS, B. Random Graphs. Academic Press, London, 1985.
7. CHANG, G. J., AND NEMHAUSER, G. L. The k-domination and k-stability problems on sun-free chordal graphs. SIAM J. Algor. Discrete Meth. 5 (1984), 332-345.
8. CHERNOFF, H. A measure of asymptotic efficiency for tests of hypothesis based on the sum of observations. Ann. Math. Stat. 23 (1952), 493-507.
9. COCKAYNE, E. J., GAMBLE, B., AND SHEPHERD, B. An upper bound for the k-domination number of a graph. J. Graph Theory 9 (1985), 533-534.
10. FREDERICKSON, G. ?., AND JANARDAN, R. Separator-based strategies for efficient message routing. In Proceedings of the 27th Symposium on Foundations of Computer Science. IEEE, New York, 1986, pp. 428-437.
11. FREDERICKSON, G. N., AND JANARDAN, R. Designing networks with compact routing tables. Algorithmica 3 (1988), 171-190.
12. KLEINROCK, L., AND KAMOUN, F. Hierarchical routing for large networks; Performance evaluation and optimization. Comput. Netw. 1 (1977), 155-174.
13. KLEINROCK, L., AND KAMOUN, F. Optimal clustering structures for hierarchical topological design of large computer networks. Networks 10 (1980), 221-248.
14. PELEG, D., AND SCHAFFER, A. A. Graph spanners. J. Graph Theory 13 (1989), 99-116.
15. PELEG, D., AND ULLMAN, J. D. An optimal synchronizer for the hypercube. SIAM J. Comput., to appear.
16. PELEG, D., AND UPFAL, E. Efficient message passing using succinct routing tables. Res. Rep. RJ 5768. IBM, Almaden, Aug. 1987.
17. PERLMAN, R. Hierarchical networks and the subnetwork partition problem. In Proceedings of the 5th Conference on System Sciences, 1982.
18. SANTORO, N., AND KHATIB, R. Labelling and implicit routing in networks. The Comput. J. 28 (1985), 5-8.
19. SUNSHINE, C. A. Addressing problems in multi-network systems. In Proceedings of the IEEE Infocom 82 (Las Vegas, Nev.). IEEE, New York, 1982.
20. VAN LEEUWEN, J., AND TAN, R. B. Routing with compact routing tables. In The Book of L, G. Rozenberg and A. Salomaa, eds. Springer-Verlag, New York, 1986, pp. 259-273.
21. VAN LEEUWEN, J., AND TAN, R. B. Interval routing. The Comput. J. 30 (1987), 298-307.