Routing in distributed networks
- 1 March 2001
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGACT News
- Vol. 32 (1) , 36-52
- https://doi.org/10.1145/568438.568451
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- A survey on interval routingTheoretical Computer Science, 2000
- Space-efficient Routing Tables for Almost All Networks and the Incompressibility MethodSIAM Journal on Computing, 1999
- Membership in Constant Time and Almost-Minimum SpaceSIAM Journal on Computing, 1999
- Log-Space Polynomial End-to-End CommunicationSIAM Journal on Computing, 1998
- Interval Routing onk-TreesJournal of Algorithms, 1998
- Searching among intervals and compact routing tablesAlgorithmica, 1996
- 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