(PBFP TRIE) PARTITIONED BLOOM FILTER WITH PRIORITY TRIE A NOVEL APPROACH FOR IP ADDRESS LOOKUP

Several researchers had their passionate focus in figuring out respective contributions on the Internet infrastructure design issues. Yet there is a wide scope in discovering competent solutions since the need is ever increasing. IP Lookup is one amongst in which a thorough research was done. Numerous solutions were proposed which have their own performance credentials as well limitations. We proposed two hybrid schemes in this paper by combining Bloom Filter and Priority Trie which seems to give a noteworthy performance. It is due to the individual potential aspects underlying in both the schemes. Forecasting the future Internet requirements we designed our scheme to get optimized results with respect to all the design issues of an IP Address Lookup scheme such as Lookup speed, memory, false positive rate and others. We tested our algorithms using the data collected from real time BGP prefix dataset and evaluated the performance with 80,000 - 2, 35,000 prefixes. We succeeded in satisfying all the design constraints and proving our algorithm to be efficient.