Eliminating sorting in IP lookup devices using partitioned table

Enrico Ng, Gyungho Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings - 16th International Conference on Application-Specific Systems, Architectures, and Processors
Pages119-124
Number of pages6
DOIs
Publication statusPublished - 2005
Externally publishedYes
EventIEEE 16th International Conference on Application-Specific Systems, Architectures, and Processors, ASAP 2005 - Samos, Greece
Duration: 2005 Jul 232005 Jul 25

Publication series

NameProceedings of the International Conference on Application-Specific Systems, Architectures and Processors
ISSN (Print)1063-6862

Other

OtherIEEE 16th International Conference on Application-Specific Systems, Architectures, and Processors, ASAP 2005
Country/TerritoryGreece
CitySamos
Period05/7/2305/7/25

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Eliminating sorting in IP lookup devices using partitioned table'. Together they form a unique fingerprint.

Cite this