Design and Performance evaluation of Cache based PBFP Trie – Proposing a state of art approach for efficient IP Lookup
Internet routing is a major concern nowadays since the global routing table is increasing rapidly. One major facet in the overall performance of a router is the Lookup speed. In this paper, an innovative approach is proposed which uses cache routing-table which contains recently used IP addresses and their forwarding information to speed up the IP address lookup operation in the routers. The secondary storage structure to which the cache is augmented is Partitioned Bloom Filtered Priority Trie. The performance is evaluated in terms of Lookup speed and Hit ratio which gave significant results. A synthetic trace file is generated using which the proposed scheme is tested and our approach seems to be efficient.