An IP packet forwarding technique based on partitioned lookup table

We present an efficient IP packet forwarding methodology and architecture. This is achieved by partitioning the lookup table into smaller ones for each output port and allowing a forwarding engine to process them in parallel. This effectively reduces the complexity of the problem of finding "the longest prefix match" to that of finding "the first prefix match".