Routing on longest-matching prefixes
- 1 January 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 4 (1), 86-97
- https://doi.org/10.1109/90.503764
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- The Recommendation for the IP Next Generation Protocol1995
- Comments of “on the balance property of Patricia tries: external path length viewpoint”Theoretical Computer Science, 1992
- An efficient implementation of trie structuresSoftware: Practice and Experience, 1992
- Implementing dynamic minimal-prefix triesSoftware: Practice and Experience, 1991
- Border Gateway Protocol (BGP)1990
- On the balance property of Patricia tries: External path length viewpointTheoretical Computer Science, 1989
- Do we really need to balance patricia tries?Lecture Notes in Computer Science, 1988
- Dynamic PatriciaPublished by Springer Science and Business Media LLC ,1987
- Self-adjusting binary search treesJournal of the ACM, 1985
- Optimum binary search treesActa Informatica, 1971