Name prefix matching using bloom filter pre-searching for content centric network
Journal of Network and Computer Applications2016Vol. 65, pp. 36–47
Citations Over TimeTop 10% of 2016 papers
Related Papers
- → On reducing false positives of a bloom filter in trie-based algorithms(2014)8 cited
- → Name prefix matching using bloom filter pre-searching(2015)7 cited
- → Binary search on trie levels with a bloom filter for longest prefix match(2014)7 cited
- → Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems(2012)