Efficient IP lookup using hybrid trie-based partitioning of TCAM-based open flow switches
IP forwarding technique in open flow switch can be done by comparing the destination IP address, which is stored in forwarding table with the input IP prefix. Ternary content-addressable memory (TCAM) is one of the popular mechanisms to store and forward IP packet where flow entries are organized in sorted manner. Searching a prefix value in TCAM uses longest prefix match rather than exact match technique. The major drawback of TCAM is high power consumption (1215 Watts per chip) due to increase in lookup time. The objective of this paper was to reduce the search time of a key, which is stored in the forwarding table. This paper also proposes an efficient way to represent data and to reduce the index TCAM size by using \(y\)-fast trie-partitioning algorithm, and it will take search time complexity of \(O(loglog~n)\).
ip lookup tcam longest prefix match \(x\)-fast trie \(y\)-fast trie