STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Using name-based mappings to increase hit rates
IEEE/ACM Transactions on Networking (TON)
A data-oriented (and beyond) network architecture
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Computers and Operations Research
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Distributed caching algorithms for content distribution networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Information-centric networking: seeing the forest for the trees
Proceedings of the 10th ACM Workshop on Hot Topics in Networks
INFORM: a dynamic interest forwarding mechanism for information centric networking
Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking
Potential based routing as a secondary best-effort routing for Information Centric Networking (ICN)
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Most Information Centric Networking designs propose the usage of widely distributed in-network storage. However, the huge amount of content exchanged in the Internet, and the volatility of content replicas cached across the network pose significant challenges to the definition of a scalable routing protocol able to address all available copies. In addition, the number of available copies of a given content item and their distribution among caches is clearly impacted by the request forwarding policy. In this paper we gather initial design considerations for an ICN request forwarding strategy by spanning over two extremes: a deterministic exploitation of forwarding information towards a "known" copy and a random network exploration towards an "unknown" copy, via request flooding. By means of packet-level simulations, we investigate the performance trade-offs of exploitation/exploration approaches, and introduce an hybrid solution. Our forwarding scheme shows a good potential, whether carefully tuned, in terms of delivery performance, implicit cache coordination and possible reduction of forwarding table size.