位打乱的trie: IP地址查找的新方法

2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) Pub Date : 2010-10-25 DOI:10.1145/1872007.1872020

D. Pao, Ziyan Lu

{"title":"位打乱的trie: IP地址查找的新方法","authors":"D. Pao, Ziyan Lu","doi":"10.1145/1872007.1872020","DOIUrl":null,"url":null,"abstract":"IP address lookup is a fundamental operation in packet forwarding. Using multi-level index tables to find out the next-hop value is an attractive approach due to its simplicity. However, memory efficiency is relatively low because prefixes are sparsely distributed in the address space. In this poster, we shall outline a new approach to construct memory efficient index tables based on a technique called bit-shuffling. The proposed method is evaluated using a real-life IPv4 routing table with 321K prefixes. The lookup tables occupy 0.8MB memory.","PeriodicalId":262685,"journal":{"name":"2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"152 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Bit-shuffled trie: A new approach for IP address lookup\",\"authors\":\"D. Pao, Ziyan Lu\",\"doi\":\"10.1145/1872007.1872020\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"IP address lookup is a fundamental operation in packet forwarding. Using multi-level index tables to find out the next-hop value is an attractive approach due to its simplicity. However, memory efficiency is relatively low because prefixes are sparsely distributed in the address space. In this poster, we shall outline a new approach to construct memory efficient index tables based on a technique called bit-shuffling. The proposed method is evaluated using a real-life IPv4 routing table with 321K prefixes. The lookup tables occupy 0.8MB memory.\",\"PeriodicalId\":262685,\"journal\":{\"name\":\"2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)\",\"volume\":\"152 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1872007.1872020\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1872007.1872020","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

IP地址查找是数据包转发的基本操作。由于简单，使用多级索引表查找下一跳值是一种很有吸引力的方法。然而，由于前缀稀疏地分布在地址空间中，因此内存效率相对较低。在这张海报中，我们将概述一种基于位变换技术构建内存高效索引表的新方法。使用具有321K前缀的真实IPv4路由表对所提出的方法进行了评估。查找表占用0.8MB内存。

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

查看原文本刊更多论文

Bit-shuffled trie: A new approach for IP address lookup

IP address lookup is a fundamental operation in packet forwarding. Using multi-level index tables to find out the next-hop value is an attractive approach due to its simplicity. However, memory efficiency is relatively low because prefixes are sparsely distributed in the address space. In this poster, we shall outline a new approach to construct memory efficient index tables based on a technique called bit-shuffling. The proposed method is evaluated using a real-life IPv4 routing table with 321K prefixes. The lookup tables occupy 0.8MB memory.

求助全文

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

来源期刊

2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)

自引率

0.00%

发文量