skip to main content
article
Free Access

A trade-off between space and efficiency for routing tables

Published:01 July 1989Publication History
Skip Abstract Section

Abstract

Two conflicting goals play a crucial role in the design of routing schemes for communication networks. A routing scheme should use paths that are as short as possible for routing messages in the network, while keeping the routing information stored in the processors' local memory as succinct as possible. The efficiency of a routing scheme is measured in terms of its stretch factor-the maximum ratio between the length of a route computed by the scheme and that of a shortest path connecting the same pair of vertices.

Most previous work has concentrated on finding good routing schemes (with a small fixed stretch factor) for special classes of network topologies. In this paper the problem for general networks is studied, and the entire range of possible stretch factors is examined. The results exhibit a trade-off between the efficiency of a routing scheme and its space requirements. Almost tight upper and lower bounds for this trade-off are presented. Specifically, it is proved that any routing scheme for general n-vertex networks that achieves a stretch factor k ≥ 1 must use a total of Ω(n1+1/(2k+4)) bits of routing information in the networks. This lower bound is complemented by a family K(k) of hierarchical routing schemes (for every k ≥ l) for unit-cost general networks, which guarantee a stretch factor of O(k), require storing a total of O(k3n1+(1/h)logn)- bits of routing information in the network, name the vertices with O(log2n)-bit names and use O(logn)-bit headers.

References

  1. 1 AWERBUCH, B. Complexity of network synchronization. J. ACM 32, 4 (Oct. 1985), 804-823. Google ScholarGoogle Scholar
  2. 2 AWERBUCH, B., BAR-NOV, A., LINIAL, N., AND PELEG, D. Improved routing strategies with succinct tables. Tech. Rep. MIT/LCS/TM-354. MIT, Cambridge, Mass., Apr. 1988.Google ScholarGoogle Scholar
  3. 3 AWERBUCH, B., BAR-NOV, A., LINIAL, N., AND PELEG, D. Memory-balanced routing strategies. Tech. Rep. MIT/LCS/TM-369. MIT, Cambridge, Mass., Aug. I988.Google ScholarGoogle Scholar
  4. 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 i5-i7). At~rVl, r~ew York, i989, pp. 479-489. Google ScholarGoogle Scholar
  5. 5 BARATZ, A. E., AND JAFFE, J.M. Establishing virtual circuits in large computer networks. Comput. Netw. 12 (1986), 27-37. Google ScholarGoogle Scholar
  6. 6 BOLLOBAS., B.Random Graphs. Acadmic Press, London, 1985.Google ScholarGoogle Scholar
  7. 7 CHANG, G. J., AND NEMHAUSER, G.L. The k-domination and k-stability problems on sun-free chordal graphs. SlAM J. Algor. Discrete Meth. 5 (1984), 332-345.Google ScholarGoogle Scholar
  8. 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.Google ScholarGoogle Scholar
  9. 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. Google ScholarGoogle Scholar
  10. 10 FREDERICKSON, G. N., AND JANARDAN, R. Separator-based strategies for efficient message routing. In Proceedings of the 27th Symposium on Foundations of Computer Science. IEEE, New York, I986, pp. 428-437. Google ScholarGoogle Scholar
  11. 11 FREDERICKSON, O. N., AND J ANARDAN, R. Designing networks with compact routing tables. Algorithmica 3 (1988), 171-190.Google ScholarGoogle Scholar
  12. 12 KLEINROCK, L., AND KAMOUN, F. Hierarchical routing for large networks; Performance evaluation and optimization. Comput. Netw. I (1977), 155-174.Google ScholarGoogle Scholar
  13. 13 KLEINROCK, L., AND KAMOUN, F. Optimal clustering structures for hierarchical topological design of large computer networks. Networks 10 (1980), 221-248.Google ScholarGoogle Scholar
  14. 14 PELEG, D., AND SCHAFFER, A.A. Graph spanners. J. Graph Theory 13 (1989), 99-116.Google ScholarGoogle Scholar
  15. 15 PELEG, D., AND ULLMAN, J.D. An optimal synchronizer for the hypercube. SIAM J. Comput., to appear. Google ScholarGoogle Scholar
  16. 16 PELEG, D., AND UPFAL, E. Efficient message passing using succinct routing tables. Res. Rep. RJ 5768. IBM, Almaden, Aug. 1987.Google ScholarGoogle Scholar
  17. 17 PERLMAN, R. Hierarchical networks and the subnetwork partition problem. In Proceedings of the 5th Conference on System Sciences, 1982.Google ScholarGoogle Scholar
  18. 18 SANTORO, N., AND KHATIB, R. Labelling and implicit routing in networks. The Comput. J. 28 (1985), 5-8.Google ScholarGoogle Scholar
  19. 19 SUNSHINE, C. A. Addressing problems in multi-network systems. In Proceedings of the IEEE Infocom 82 (Las Vegas, Nev.). IEEE, New York, 1982.Google ScholarGoogle Scholar
  20. 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.Google ScholarGoogle Scholar
  21. 21 VAN LEEUWEN, J., AND TAN, R.B. Interval routing. The Comput. J. 30 (1987), 298-307. Google ScholarGoogle Scholar

Index Terms

  1. A trade-off between space and efficiency for routing tables

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image Journal of the ACM
            Journal of the ACM  Volume 36, Issue 3
            July 1989
            246 pages
            ISSN:0004-5411
            EISSN:1557-735X
            DOI:10.1145/65950
            Issue’s Table of Contents

            Copyright © 1989 ACM

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 July 1989
            Published in jacm Volume 36, Issue 3

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader