TY - GEN

T1 - A tradeoff between space and efficiency for routing tables

AU - Peleg, David

AU - Upfal, Eli

PY - 1988

Y1 - 1988

N2 - Two 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 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 work we study the problem for general networks, and look at the entire range of possible stretch factors. The results exhibit a tradeoff between the efficiency of a routing scheme and its space requirements. We present almost tight upper and lower bounds for this tradeoff. Specifically, we prove that any routing scheme for general nvertex 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 H(k) of hierarchical routing schemes (for every fixed k > 1), which guarantee a stretch factor of O(k), require storing a total of O(n1+1/k) bits of routing information in the network and name the vertices with O(log2 n)-bit names.

AB - Two 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 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 work we study the problem for general networks, and look at the entire range of possible stretch factors. The results exhibit a tradeoff between the efficiency of a routing scheme and its space requirements. We present almost tight upper and lower bounds for this tradeoff. Specifically, we prove that any routing scheme for general nvertex 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 H(k) of hierarchical routing schemes (for every fixed k > 1), which guarantee a stretch factor of O(k), require storing a total of O(n1+1/k) bits of routing information in the network and name the vertices with O(log2 n)-bit names.

UR - http://www.scopus.com/inward/record.url?scp=33745594334&partnerID=8YFLogxK

U2 - 10.1145/62212.62217

DO - 10.1145/62212.62217

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:33745594334

SN - 0897912640

SN - 9780897912648

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 43

EP - 52

BT - Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988

PB - Association for Computing Machinery

T2 - 20th Annual ACM Symposium on Theory of Computing, STOC 1988

Y2 - 2 May 1988 through 4 May 1988

ER -