Essays about: "Longest Prefix Matching"
Found 2 essays containing the words Longest Prefix Matching.
-
1. Multibit Trie For The Longest Matching Prefix Problem
University essay from Umeå universitet/Institutionen för datavetenskapAbstract : With the ever growing forwarding tables of the internet and the large amount of traffic that flows through them, efficient algorithms to handle search are needed. One of these algorithms is the Multibit trie (prefix tree). READ MORE
-
2. Evaluation of length aware Bloom filter for longest prefix matching using Waldvogels binary search on lengths
University essay from Umeå universitet/Institutionen för datavetenskapAbstract : Longest prefix matching is a well-studied problem in the context of IP-packet forwarding, an area of computational specialization where high performance with low memory impact is of the essence. Numerous specialized data structures exist for longest prefix matching in this setting, among them is Waldvogels binary search on lengths, WBSL for short. READ MORE