Eliminating sorting in IP lookup devices using partitioned table

Enrico Ng, Kyung Ho Lee

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

6 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 of the International Conference on Application-Specific Systems, Architectures and Processors
Pages119-124
Number of pages6
DOIs
Publication statusPublished - 2005 Sep 26
Externally publishedYes
EventIEEE 16th International Conference on Application-Specific Systems, Architectures, and Processors, ASAP 2005 - Samos, Greece
Duration: 2005 Jul 232005 Jul 25

Other

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

Fingerprint

Sorting
Associative storage
Clocks

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Ng, E., & Lee, K. H. (2005). Eliminating sorting in IP lookup devices using partitioned table. In Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors (pp. 119-124) https://doi.org/10.1109/ASAP.2005.32

Eliminating sorting in IP lookup devices using partitioned table. / Ng, Enrico; Lee, Kyung Ho.

Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors. 2005. p. 119-124.

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

Ng, E & Lee, KH 2005, Eliminating sorting in IP lookup devices using partitioned table. in Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors. pp. 119-124, IEEE 16th International Conference on Application-Specific Systems, Architectures, and Processors, ASAP 2005, Samos, Greece, 05/7/23. https://doi.org/10.1109/ASAP.2005.32
Ng E, Lee KH. Eliminating sorting in IP lookup devices using partitioned table. In Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors. 2005. p. 119-124 https://doi.org/10.1109/ASAP.2005.32
Ng, Enrico ; Lee, Kyung Ho. / Eliminating sorting in IP lookup devices using partitioned table. Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors. 2005. pp. 119-124
@inproceedings{be7a8f188dbe499797d304abcdb9d726,
title = "Eliminating sorting in IP lookup devices using partitioned table",
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.",
author = "Enrico Ng and Lee, {Kyung Ho}",
year = "2005",
month = "9",
day = "26",
doi = "10.1109/ASAP.2005.32",
language = "English",
isbn = "0769524079",
pages = "119--124",
booktitle = "Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors",

}

TY - GEN

T1 - Eliminating sorting in IP lookup devices using partitioned table

AU - Ng, Enrico

AU - Lee, Kyung Ho

PY - 2005/9/26

Y1 - 2005/9/26

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=24944552215&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=24944552215&partnerID=8YFLogxK

U2 - 10.1109/ASAP.2005.32

DO - 10.1109/ASAP.2005.32

M3 - Conference contribution

AN - SCOPUS:24944552215

SN - 0769524079

SP - 119

EP - 124

BT - Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors

ER -