An approximate analysis of the LRU and FIFO buffer replacement schemes
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Birthday paradox, coupon collectors, caching algorithms and self-organizing search
Discrete Applied Mathematics
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
Statistical bandwidth sharing: a study of congestion at flow level
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Probabilistic methods for web caching
Performance Evaluation
Bandwidth sharing: objectives and algorithms
IEEE/ACM Transactions on Networking (TON)
Forwarding in a content-based network
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Analyzing client interactivity in streaming media
Proceedings of the 13th international conference on World Wide Web
Evaluating the number of active flows in a scheduler realizing fair statistical bandwidth sharing
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The LCD interconnection of LRU caches and its analysis
Performance Evaluation
Nonstationary Poisson modeling of web browsing session arrivals
Information Processing Letters
A data-oriented (and beyond) network architecture
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
I tube, you tube, everybody tubes: analyzing the world's largest user generated content video system
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Characterizing the miss sequence of the LRU cache
ACM SIGMETRICS Performance Evaluation Review
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Greening the internet with content-centric networking
Proceedings of the 1st International Conference on Energy-Efficient Computing and Networking
Approximate models for general cache networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
On content-centric router design and implications
Proceedings of the Re-Architecting the Internet Workshop
Characterizing Web-Based Video Sharing Workloads
ACM Transactions on the Web (TWEB)
Bandwidth and storage sharing performance in information centric networking
Proceedings of the ACM SIGCOMM workshop on Information-centric networking
Modeling data transfer in content-centric networking
Proceedings of the 23rd International Teletraffic Congress
Performance evaluation of the random replacement policy for networks of caches
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Performance of the move-to-front algorithm with Markov-modulated request sequences
Operations Research Letters
Hierarchical Web caching systems: modeling, design and experimental results
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
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.