把大象装进盒子里——以片上存储器访问速度进行IP查找

2016 IEEE 24th International Conference on Network Protocols (ICNP) Pub Date : 2016-11-01 DOI:10.1109/ICNP.2016.7784462

Tong Yang, A. Liu, Qiaobin Fu, Dongsheng Yang, S. Uhlig, Xiaoming Li

{"title":"把大象装进盒子里——以片上存储器访问速度进行IP查找","authors":"Tong Yang, A. Liu, Qiaobin Fu, Dongsheng Yang, S. Uhlig, Xiaoming Li","doi":"10.1109/ICNP.2016.7784462","DOIUrl":null,"url":null,"abstract":"Fitting large and ever increasing routing tables in small on-chip memory is just like fitting an elephant in a box, which has been considered as impossible. In this paper, we propose the data structure of two-Dimensional Division Bloom Filter (D2BF) that can compactly encode almost all the needed information for performing IP lookup from a FIB in small on-chip memory. With pipelining, we further achieve the throughput of one packet per on-chip memory access.","PeriodicalId":115376,"journal":{"name":"2016 IEEE 24th International Conference on Network Protocols (ICNP)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fit the elephant in a box - towards IP lookup at on-chip memory access speed\",\"authors\":\"Tong Yang, A. Liu, Qiaobin Fu, Dongsheng Yang, S. Uhlig, Xiaoming Li\",\"doi\":\"10.1109/ICNP.2016.7784462\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Fitting large and ever increasing routing tables in small on-chip memory is just like fitting an elephant in a box, which has been considered as impossible. In this paper, we propose the data structure of two-Dimensional Division Bloom Filter (D2BF) that can compactly encode almost all the needed information for performing IP lookup from a FIB in small on-chip memory. With pipelining, we further achieve the throughput of one packet per on-chip memory access.\",\"PeriodicalId\":115376,\"journal\":{\"name\":\"2016 IEEE 24th International Conference on Network Protocols (ICNP)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE 24th International Conference on Network Protocols (ICNP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNP.2016.7784462\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 24th International Conference on Network Protocols (ICNP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNP.2016.7784462","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在小型片上存储器中安装大型且不断增加的路由表就像将大象装进盒子一样，这被认为是不可能的。在本文中，我们提出了二维除法布隆滤波器(D2BF)的数据结构，它可以在小型片上存储器中紧凑地编码从FIB执行IP查找所需的几乎所有信息。通过流水线，我们进一步实现了每个片上存储器访问一个数据包的吞吐量。

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

查看原文本刊更多论文

Fit the elephant in a box - towards IP lookup at on-chip memory access speed

Fitting large and ever increasing routing tables in small on-chip memory is just like fitting an elephant in a box, which has been considered as impossible. In this paper, we propose the data structure of two-Dimensional Division Bloom Filter (D2BF) that can compactly encode almost all the needed information for performing IP lookup from a FIB in small on-chip memory. With pipelining, we further achieve the throughput of one packet per on-chip memory access.

求助全文

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

来源期刊

2016 IEEE 24th International Conference on Network Protocols (ICNP)

自引率

0.00%

发文量