2005 IEEE International Conference on Application-Specific Systems, Architecture Processors (ASAP'05) Eliminating Sorting in IP Lookup Devices using Partitioned Table Samos, Greece July 23-July 25 ISBN: 0-7695-2407-9
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ASAP.2005.32
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.
Citation:
Enrico Ng, Gyungho Lee, "Eliminating Sorting in IP Lookup Devices using Partitioned Table," asap, pp.119-126, 2005 IEEE International Conference on Application-Specific Systems, Architecture Processors (ASAP'05), 2005 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||