Yi-Mao Hsiao, Ming-Jen Chen, Yu-Jen Hsiao, Hui-Kai Su, Y. Chu
{"title":"基于tcam的IPv6路由查找架构的快速更新方案","authors":"Yi-Mao Hsiao, Ming-Jen Chen, Yu-Jen Hsiao, Hui-Kai Su, Y. Chu","doi":"10.1109/APCC.2009.5375469","DOIUrl":null,"url":null,"abstract":"With the rapid development of the Internet applications and the explosion of end users, IP address has been exhausted and routing lookup speed is the bottleneck of router design. In addition TCAM is widely used for implementation fast IP forwarding table lookup. However, the need to maintain a sorted list incremental updates may slow the lookup speed in a TCAM. In this paper, a fast TCAM update scheme is proposed for TCAM-Based IPv6 routing lookup architecture. Based on the characteristic of prefix distribution, we design a TCAM-Based router architecture for IPv6 routing lookup. As simulation result shows more than 90% update do not need any memory movement in updating operation. The worse case is (D-2)/2, where D is the length of chain.","PeriodicalId":217893,"journal":{"name":"2009 15th Asia-Pacific Conference on Communications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A fast update scheme for TCAM-based IPv6 routing lookup architecture\",\"authors\":\"Yi-Mao Hsiao, Ming-Jen Chen, Yu-Jen Hsiao, Hui-Kai Su, Y. Chu\",\"doi\":\"10.1109/APCC.2009.5375469\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the rapid development of the Internet applications and the explosion of end users, IP address has been exhausted and routing lookup speed is the bottleneck of router design. In addition TCAM is widely used for implementation fast IP forwarding table lookup. However, the need to maintain a sorted list incremental updates may slow the lookup speed in a TCAM. In this paper, a fast TCAM update scheme is proposed for TCAM-Based IPv6 routing lookup architecture. Based on the characteristic of prefix distribution, we design a TCAM-Based router architecture for IPv6 routing lookup. As simulation result shows more than 90% update do not need any memory movement in updating operation. The worse case is (D-2)/2, where D is the length of chain.\",\"PeriodicalId\":217893,\"journal\":{\"name\":\"2009 15th Asia-Pacific Conference on Communications\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-10-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 15th Asia-Pacific Conference on Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APCC.2009.5375469\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 15th Asia-Pacific Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCC.2009.5375469","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A fast update scheme for TCAM-based IPv6 routing lookup architecture
With the rapid development of the Internet applications and the explosion of end users, IP address has been exhausted and routing lookup speed is the bottleneck of router design. In addition TCAM is widely used for implementation fast IP forwarding table lookup. However, the need to maintain a sorted list incremental updates may slow the lookup speed in a TCAM. In this paper, a fast TCAM update scheme is proposed for TCAM-Based IPv6 routing lookup architecture. Based on the characteristic of prefix distribution, we design a TCAM-Based router architecture for IPv6 routing lookup. As simulation result shows more than 90% update do not need any memory movement in updating operation. The worse case is (D-2)/2, where D is the length of chain.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
