Improved routing strategies with succinct tables
Authors:
- Baruch AwerbuchBABaruch Awerbuch
- Amotz Bar-NoyABAmotz Bar-Noy
- Nathan LinialNLNathan Linial
- David PelegDPDavid Peleg
- 1 September 1990
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 11 (3) , 307-341
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A trade-off between space and efficiency for routing tablesJournal of the ACM, 1989
- Designing networks with compact routing tablesAlgorithmica, 1988
- Interval RoutingThe Computer Journal, 1987
- Labelling and Implicit Routing in NetworksThe Computer Journal, 1985
- A Distributed Algorithm for Minimum-Weight Spanning TreesACM Transactions on Programming Languages and Systems, 1983
- Optimal clustering structures for hierarchical topological design of large computer networksNetworks, 1980
- Termination detection for diffusing computationsInformation Processing Letters, 1980
- OSI Reference Model--The ISO Model of Architecture for Open Systems InterconnectionIEEE Transactions on Communications, 1980
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952