{"title":"Fast updating scheme of forwarding tables on TCAM","authors":"Weidong Wu, Bingxin Shi, Feng Wang","doi":"10.1109/MASCOT.2004.1348308","DOIUrl":null,"url":null,"abstract":"Ternary content-addressable memories (TCAMs) have become a popular hardware device for fast routing lookups. However, due to the need to keep a sorted list of entries on TCAM, the entries are moved to make free space for the new entry. The slow update is a performance bottleneck. The paper presents a TCAM-based forwarding engine that is update efficient. We analyze the hierarchy of prefixes in the routing table, and give a level-partitioning algorithm to construct the routing table in TCAM. In our scheme, the update algorithm is fast and simple, the number of movements per update depends on the inserting sequence of new prefixes and is independent of the initial prefixes. For real route update traces, the average number of movements is less than 0.01.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"81 1","pages":"522-527"},"PeriodicalIF":0.0000,"publicationDate":"2004-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Performance","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASCOT.2004.1348308","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Ternary content-addressable memories (TCAMs) have become a popular hardware device for fast routing lookups. However, due to the need to keep a sorted list of entries on TCAM, the entries are moved to make free space for the new entry. The slow update is a performance bottleneck. The paper presents a TCAM-based forwarding engine that is update efficient. We analyze the hierarchy of prefixes in the routing table, and give a level-partitioning algorithm to construct the routing table in TCAM. In our scheme, the update algorithm is fast and simple, the number of movements per update depends on the inserting sequence of new prefixes and is independent of the initial prefixes. For real route update traces, the average number of movements is less than 0.01.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
