Opening book details…
Can I read Routing on Longest-matching Prefixes on EtoBox?
Routing on Longest-matching Prefixes by W. Doeringer; G. Karjoth; M. Nassehi is a Computer Science article available to read on EtoBox.
What is Routing on Longest-matching Prefixes about?
Thii article descri~the d~mic pre f iz tries '-a novel data structure with aigbisns for insetion, deletion, and retrieval to builfl and mtdnth a dynamic titib=e of binary keys a9 arMtraQ Iess@h. These tries exted -.~~~d igital (Patricia) tries to support the storage of prefixes and to guarantee retrieval times at moat linear in the length of the input key irmapedve of tt!e trie size, even when searchii for Iongeat-matchiug prefixes. The new deaigss.
Who reads Routing on Longest-matching Prefixes?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- W. Doeringer; G. Karjoth; M. Nassehi
- Publisher
- Institute of Electrical and Electronics Engineers (IEEE)
- Published
- 1996
- Language
- EN
- Field
- Computer Science (Physical Sciences)