## Routing with Polynomial Communication-Space Tradeoff (1993)

Venue: | SIAM Journal on Discrete Mathematics |

Citations: | 77 - 13 self |

### BibTeX

@ARTICLE{Awerbuch93routingwith,

author = {Baruch Awerbuch and David Peleg},

title = {Routing with Polynomial Communication-Space Tradeoff},

journal = {SIAM Journal on Discrete Mathematics},

year = {1993},

volume = {5},

pages = {151--162}

}

### Years of Citing Articles

### OpenURL

### Abstract

This paper presents a family of memory-balanced routing schemes that use relatively short paths while storing relatively little routing information. The hierarchical schemes H k (for every integer k 1) guarantee a stretch factor of O(k 2 ) on the length of the routes and require storing at most O(kn 1 k log n log D) bits of routing information per vertex in an n-processor network with diameter D. The schemes are nameindependent and applicable to general networks with arbitrary edge weights. This improves on previous designs whose stretch bound was exponential in k. Key words: Communication networks, routing tables, communication-space trade-offs, graph covers. Dept. of Mathematics and Lab. for Computer Science, M.I.T., Cambridge, MA 02139; ARPANET: baruch@theory.lcs.mit.edu. Supported by Air Force Contract TNDGAFOSR-86-0078, ARO contract DAAL03-86-K-0171, NSF contract CCR8611442, DARPA contract N00014-89-J-1988, and a special grant from IBM. y Department of Applied Mathemati...

### Citations

224 | Online Tracking of Mobile Users - Awerbuch, Peleg - 1995 |

136 | Labelling and implicit routing in networks - Santoro, Khatib - 1985 |

109 | Hierarchical Routing for Large Networks: Performance Evaluation and Optimization
- Kleninrock, Kamoun
- 1977
(Show Context)
Citation Context ...e maximum ratio between the length of a route produces by the scheme for some pair of processors and their distance. The problem of efficiency-memory tradeoffs for routing schemes was first raised in =-=[KK1]-=-. The solution given there and in several consequent papers [BJ, KK2, Pr, S, FJ1, FJ2, SK, vLT1, vLT2] applies only under some special assumptions or for special classes of network topologies. In [PU]... |

74 | Compact distributed data structures for adaptive network routing
- Awerbuch, Bar-Noy, et al.
- 1989
(Show Context)
Citation Context ...rtex to have sufficient memory for performing the most demanding role it may ever need to perform. It is thus necessary to guarantee a bound on the worst-case memory requirements of each vertex. (See =-=[ABLP]-=- for a more detailed discussion of these issues.) Unfortunately, the routing strategy of [PU] lacks all of these three properties. It deals only with unit-cost edges, it is name-dependent, and there i... |

74 | Designing networks with compact routing tables - Frederickson, Janardan - 1988 |

39 |
A tradeoff between size and efficiency for routing tables
- Peleg, Upfal
- 1989
(Show Context)
Citation Context ...KK1]. The solution given there and in several consequent papers [BJ, KK2, Pr, S, FJ1, FJ2, SK, vLT1, vLT2] applies only under some special assumptions or for special classes of network topologies. In =-=[PU]-=- the problem is dealt with for general networks. The paper presents a family of hierarchical routing schemes (for every integer ks1) which guarantee stretch O(k) and require storing a total of O(k 3 n... |

23 | Hierarchical networks and the subnetwork partition problem - PERLMAN - 1982 |

22 |
Distance-dependent distributed directories
- Peleg
- 1993
(Show Context)
Citation Context ...cessor network of diameter D, the schemes HS k of [ABLP], for ks1, use O(k \Delta log n \Delta n 1 k ) bits of memory per vertex and guarantee a stretch of O(k 2 \Delta9 k ), while the schemes R k of =-=[P2]-=-, for ks1, use O(log D \Deltalog n\Deltan 1 k ) bits of memory per vertex and guarantee a stretch of O(4 k ). Thus the stretch becomes exponential in k, in contrast with the polynomial dependency achi... |

19 | Separator-based strategies for efficient message routing - Frederickson, Janardan - 1986 |

18 | Optimal clustering structures for hierarchical topological design of large computer networks. Networks 10 - KLEINROCK, KAMOUN - 1980 |

3 |
Sparse Graph Partitions, Report CS89-01, Dept
- Peleg
- 1989
(Show Context)
Citation Context ...(4 k ). Thus the stretch becomes exponential in k, in contrast with the polynomial dependency achieved in [PU]. The schemes of [P2] are based on solving a certain graph problem (handled previously in =-=[P1]-=-) involving the construction of sparse covers. The schemes presented in the current paper are basically the same as those of [P2], except that they employ a new, more efficient solution to the underly... |

2 | Routing with Compact Routing Tables, in The Book of - Leeuwen, Tan - 1986 |

1 | Establishing Virtual Circuits - Baratz, Jaffe - 1986 |