{"title":"基于Bloom过滤器的CCN转发引擎","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":"{\"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}","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}
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.