Binary search on trie levels with a bloom filter for longest prefix match | IEEE Conference Publication | IEEE Xplore