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.
- 1 AWERBUCH, B. Complexity of network synchronization. J. ACM 32, 4 (Oct. 1985), 804-823. Google Scholar
- 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 Scholar
- 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 Scholar
- 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 Scholar
- 5 BARATZ, A. E., AND JAFFE, J.M. Establishing virtual circuits in large computer networks. Comput. Netw. 12 (1986), 27-37. Google Scholar
- 6 BOLLOBAS., B.Random Graphs. Acadmic Press, London, 1985.Google Scholar
- 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 Scholar
- 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 Scholar
- 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 Scholar
- 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 Scholar
- 11 FREDERICKSON, O. N., AND J ANARDAN, R. Designing networks with compact routing tables. Algorithmica 3 (1988), 171-190.Google Scholar
- 12 KLEINROCK, L., AND KAMOUN, F. Hierarchical routing for large networks; Performance evaluation and optimization. Comput. Netw. I (1977), 155-174.Google Scholar
- 13 KLEINROCK, L., AND KAMOUN, F. Optimal clustering structures for hierarchical topological design of large computer networks. Networks 10 (1980), 221-248.Google Scholar
- 14 PELEG, D., AND SCHAFFER, A.A. Graph spanners. J. Graph Theory 13 (1989), 99-116.Google Scholar
- 15 PELEG, D., AND ULLMAN, J.D. An optimal synchronizer for the hypercube. SIAM J. Comput., to appear. Google Scholar
- 16 PELEG, D., AND UPFAL, E. Efficient message passing using succinct routing tables. Res. Rep. RJ 5768. IBM, Almaden, Aug. 1987.Google Scholar
- 17 PERLMAN, R. Hierarchical networks and the subnetwork partition problem. In Proceedings of the 5th Conference on System Sciences, 1982.Google Scholar
- 18 SANTORO, N., AND KHATIB, R. Labelling and implicit routing in networks. The Comput. J. 28 (1985), 5-8.Google Scholar
- 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 Scholar
- 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 Scholar
- 21 VAN LEEUWEN, J., AND TAN, R.B. Interval routing. The Comput. J. 30 (1987), 298-307. Google Scholar
Index Terms
A trade-off between space and efficiency for routing tables
Recommendations
Compact routing schemes
SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architecturesWe describe several compact routing schemes for general weighted undirected networks. Our schemes are simple and easy to implement. The routing tables stored at the nodes of the network are all very small. The headers attached to the routed messages, ...
A tradeoff between space and efficiency for routing tables
STOC '88: Proceedings of the twentieth annual ACM symposium on Theory of computingTwo conflicting goals play a crucial role in the design of routing schemes for communication networks. A routing scheme should use as short as possible paths for routing messages in the network, while keeping the routing information stored in the ...
Space-Efficiency for Routing Schemes of Stretch Factor Three
We deal with deterministic distributed routing algorithms on arbitrary n-node networks. For each router, we want to minimize the amount of routing information that must be stored in order to implement the local routing algorithm, even if the names of ...
Comments