On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
A data-oriented (and beyond) network architecture
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 5th international conference on Emerging networking experiments and technologies
LANES: an inter-domain data-oriented routing architecture
Proceedings of the 2009 workshop on Re-architecting the internet
A Survey on content-oriented networking for efficient content delivery
IEEE Communications Magazine
Exploit the known or explore the unknown?: hamlet-like doubts in ICN
Proceedings of the second edition of the ICN workshop on Information-centric networking
CATT: potential based routing with content caching for ICN
Proceedings of the second edition of the ICN workshop on Information-centric networking
A case for stateful forwarding plane
Computer Communications
| Hi-index | 0.00 |
One challenge to the retrieval process of ICN is to take advantage of largely distributed copies in in-network caches. This paper proposes Potential Based Routing (PBR) as a secondary best-effort routing mechanism to boost availability of copies in ICN architectures. The control overhead issue of the PBR is evaluated through both theoretical analysis and numerical simulation. In addition, the paper provides the PBR with a recovery mechanism from a failure, which can reduce the control overhead traffic by at least 40% in the simulation environment. Lastly, it is demonstrated how an ICN architecture can benefit from this PBR in terms of cache hit and delay reduction ratios.