CCN forwarding engine based on Bloom filters

M. Tortelli, L. Grieco, G. Boggia
{"title":"CCN forwarding engine based on Bloom filters","authors":"M. Tortelli, L. Grieco, G. Boggia","doi":"10.1145/2377310.2377314","DOIUrl":null,"url":null,"abstract":"The lack of scalable routing algorithms is one of the main obstacles that slow down a large deployment of Content Centric Networking on an Internet-scale. From one side, content based networking promises to solve the current problems of the Internet. On the other hand, instead, it requires routers to account for a very huge amount of content names. Bloom Filters are widely recognized as a possible solution to this limitation. At the same time, their adoption requires careful tuning rules and novel design methodologies. In this perspective, the present contribution proposes a Bloom Filter-based routing scheme for Content Centric Networking (CCN) and shows several preliminary observations about Bloom Filters size and signaling overhead.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference of Future Internet","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2377310.2377314","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

Abstract

The lack of scalable routing algorithms is one of the main obstacles that slow down a large deployment of Content Centric Networking on an Internet-scale. From one side, content based networking promises to solve the current problems of the Internet. On the other hand, instead, it requires routers to account for a very huge amount of content names. Bloom Filters are widely recognized as a possible solution to this limitation. At the same time, their adoption requires careful tuning rules and novel design methodologies. In this perspective, the present contribution proposes a Bloom Filter-based routing scheme for Content Centric Networking (CCN) and shows several preliminary observations about Bloom Filters size and signaling overhead.
基于Bloom过滤器的CCN转发引擎
缺乏可伸缩的路由算法是减缓在互联网规模上大规模部署内容中心网络的主要障碍之一。一方面,基于内容的网络有望解决当前互联网的问题。另一方面,它要求路由器对大量的内容名称负责。布隆过滤器被广泛认为是解决这一限制的可能解决方案。同时,它们的采用需要仔细的调优规则和新颖的设计方法。从这个角度来看,本文提出了一种基于布隆过滤器的内容中心网络(CCN)路由方案,并展示了一些关于布隆过滤器大小和信令开销的初步观察结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信