Eliminating Sorting in IP Lookup Devices using Partitioned Table

Authors:
Enrico Ng;Gyungho Lee
Affiliations:
Electrical and Computer Engineering University of Illinois at Chicago;Electrical and Computer Engineering University of Illinois at Chicago
Venue:
ASAP '05 Proceedings of the 2005 IEEE International Conference on Application-Specific Systems, Architecture Processors
Year:
2005

Citing 0
Cited 2

Scheduling of Updates in an IP Forwarding Engine with Partitioned Prefix Tables

ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
An efficient IP lookup architecture with fast update using single-match TCAMs

WWIC'08 Proceedings of the 6th international conference on Wired/wireless internet communications

Quantified Score

Hi-index	0.01

Visualization

Abstract

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 will reduce 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.