Routing with Polynomial Communication-Space Trade-Off
- 1 May 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 5 (2) , 151-162
- https://doi.org/10.1137/0405013
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Distance-Dependent Distributed DirectoriesInformation and Computation, 1993
- Space-Efficient Message Routing inc-Decomposable NetworksSIAM Journal on Computing, 1990
- Efficient Message Routing in Planar NetworksSIAM Journal on Computing, 1989
- A trade-off between space and efficiency for routing tablesJournal of the ACM, 1989
- Designing networks with compact routing tablesAlgorithmica, 1988
- Establishing virtual circuits in large computer networksComputer Networks and ISDN Systems, 1986
- Computer Networks with Compact Routing TablesPublished by Springer Nature ,1986
- Labelling and Implicit Routing in NetworksThe Computer Journal, 1985
- Optimal clustering structures for hierarchical topological design of large computer networksNetworks, 1980
- Hierarchical routing for large networks Performance evaluation and optimizationComputer Networks (1976), 1977