Searching for "Routing on longest-matching prefixes." – sorted by Relevance.
6 documents found, showing 1 through 6.
-
Efficient Construction Of Variable-Stride Multibit Tries For IP Lookup
- … � levels. Here, ¦ is the number of prefixes in the routing table and ¨ is the length of the longest prefix…
- Cited by 8 (6 self) – Add To MetaCart
-
Efficient Construction Of Fixed-Stride Multibit Tries For IP Lookup
- …-stride trie when the longest prefix in the routing table has length W. We improve on this algorithm…
- Cited by 8 (6 self) – Add To MetaCart
-
Data Structures For IP Lookup With Bursty Access Patterns
- … pattern is bursty. Longest-prefix matching as well as prefix insertion and deletion take…
- Add To MetaCart
-
An O(log n) Dynamic Router-Table Design
- … for the insert and delete operations. Keywords: Packet routing, longest matching prefix, red-black trees. 1…
- Cited by 6 (1 self) – Add To MetaCart
-
Efficient Construction Of Multibit Tries For IP Lookup
- … times as fast for IPv4 routing table data. Keywords: Packet routing, longest matching prefix…
- Cited by 7 (3 self) – Add To MetaCart
-
Efficient construction of pipelined multibit-trie Router-Tables
- … (p,a) in the router table for which p is a longest matching-prefix of A (i.e., p is a prefix of A…
- Cited by 4 (1 self) – Add To MetaCart
Showing 1 through 6.
