{"title":"稳健的路由表设计为IPv6查找","authors":"S. Yong, H. Ewe","doi":"10.1109/ICITA.2005.241","DOIUrl":null,"url":null,"abstract":"The most pressing issue in IP lookup has been to solve the longest prefix match (LPM) problem. The solution must appeal to 3 major criteria of lookup and update performance of the routing table, and memory consumption. However, in IPv6 route table lookup addressing the problem of the possible long prefix (128-bit) in the worst case is crucial. In this paper, this challenge is met by 'breaking' the address length into 'smaller' pieces of different prefix length in separate but contiguous tables. Coupled with smart prefix sorting and hardware hashing, this scheme is designed to be flexible and memory efficient.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Robust routing table design for IPv6 lookup\",\"authors\":\"S. Yong, H. Ewe\",\"doi\":\"10.1109/ICITA.2005.241\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The most pressing issue in IP lookup has been to solve the longest prefix match (LPM) problem. The solution must appeal to 3 major criteria of lookup and update performance of the routing table, and memory consumption. However, in IPv6 route table lookup addressing the problem of the possible long prefix (128-bit) in the worst case is crucial. In this paper, this challenge is met by 'breaking' the address length into 'smaller' pieces of different prefix length in separate but contiguous tables. Coupled with smart prefix sorting and hardware hashing, this scheme is designed to be flexible and memory efficient.\",\"PeriodicalId\":371528,\"journal\":{\"name\":\"Third International Conference on Information Technology and Applications (ICITA'05)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Third International Conference on Information Technology and Applications (ICITA'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICITA.2005.241\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third International Conference on Information Technology and Applications (ICITA'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICITA.2005.241","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The most pressing issue in IP lookup has been to solve the longest prefix match (LPM) problem. The solution must appeal to 3 major criteria of lookup and update performance of the routing table, and memory consumption. However, in IPv6 route table lookup addressing the problem of the possible long prefix (128-bit) in the worst case is crucial. In this paper, this challenge is met by 'breaking' the address length into 'smaller' pieces of different prefix length in separate but contiguous tables. Coupled with smart prefix sorting and hardware hashing, this scheme is designed to be flexible and memory efficient.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
