Eliminating sorting in IP lookup devices using partitioned table

We present a solution to eliminate the requirements of routing table sorting by prefix length in IP lookup devices using ternary content addressable memories (TCAMs). This reduces delays arising from routing table updates from linear to constant time. This solution introduces slight modifications to the organization of the routing table including the elimination of the built-in priority encoder. The routing table entries are split by output port to remove their dependence on length. Overall, the solution presented reduces the insertion problem to lookup speed while maintaining similar clock rates and storage requirements of traditional designs.