Proceedings of the 5th international conference on Emerging networking experiments and technologies
Approximate models for general cache networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
A reality check for content centric networking
Proceedings of the ACM SIGCOMM workshop on Information-centric networking
| Hi-index | 0.00 |
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.