稳健的路由表设计为IPv6查找

Third International Conference on Information Technology and Applications (ICITA'05) Pub Date : 2005-07-04 DOI:10.1109/ICITA.2005.241

S. Yong, H. Ewe

{"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}

引用次数: 3

摘要

IP查找中最紧迫的问题是解决最长前缀匹配(LPM)问题。该解决方案必须满足查找和更新路由表性能以及内存消耗的3个主要标准。然而，在IPv6路由表查找中，在最坏的情况下解决可能的长前缀(128位)问题是至关重要的。在本文中，通过将地址长度“分解”为不同前缀长度的“较小”块，在独立但连续的表中解决了这一挑战。结合智能前缀排序和硬件哈希，该方案具有灵活性和内存效率。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Robust routing table design for IPv6 lookup

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Third International Conference on Information Technology and Applications (ICITA'05)

自引率

0.00%

发文量