On the performance of bandwidth and storage sharing in information-centric networks

• Published in: Computer networks (Amsterdam, Netherlands : 1999) Vol. 57; no. 17; pp. 3743 - 3758
• Main Authors: Carofiglio, Giovanna, Gallo, Massimo, Muscariello, Luca
• Format: Journal Article
• Language: English
• Published: Kidlington Elsevier B.V 09.12.2013; Elsevier; Elsevier Sequoia S.A
• Subjects: Applied sciences; Bandwidths; Communications networks; Computer science; control theory; systems; Computer systems and distributed systems. User interface; Exact sciences and technology; Information sharing; Information storage; Information systems. Data bases; Information-Centric Networking; Mathematical models; Memory and file management (including protection and security); Memory organisation. Data processing; Performance analysis; Software; Studies; Transport; Information-Centric Networking; Transport; Performance analysis; Performance evaluation; On demand; Cache memory; Data storage; Network architecture; Equity; Modeling; Dissemination; Bandwidth; Localization; Content analysis; Probabilistic approach; Information retrieval; Distributed system; Topology; Communication network; Delivery lead time; Stationary condition; Exact solution; Block design; Content based network; Information storage; Content-based retrieval; User behavior
• ISSN: 1389-1286; 1872-7069
• DOI: 10.1016/j.comnet.2013.08.018

Information Centric Network (ICN) proposals, have recently emerged to define new network architectures where content, and not its location, becomes the core of the communication model. Such new paradigms push data storage and delivery at network layer and are designed to cope with current Internet usage, mainly centered around content dissemination and retrieval. In this paper, we develop an analytical model of ICN storage and bandwidth sharing under fairly general assumptions on total demand, topology, content popularity and limited network resources. Our study applies to a class of content oriented networks identified by receiver-driven packet-based communication with in-network storage. We derive a closed-form expression for expected stationary delivery time as a function of hit/miss probabilities at network caches, content popularity and cache sizes. Our analytical results, supported by packet level simulations, can be used to analyze fundamental trade-offs of ICN architectures. They also provide an essential building block for the design and evaluation of ICN protocols.