Birthday paradox, coupon collectors, caching algorithms and self-organizing search
Discrete Applied Mathematics
Characterizing locality, evolution, and life span of accesses in enterprise media server workloads
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Probabilistic methods for web caching
Performance Evaluation
Nonstationary Poisson modeling of web browsing session arrivals
Information Processing Letters
Scale and performance in the CoBlitz large-file distribution service
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
A data-oriented (and beyond) network architecture
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Characterizing the miss sequence of the LRU cache
ACM SIGMETRICS Performance Evaluation Review
Anycast-aware transport for content delivery networks
Proceedings of the 18th international conference on World wide web
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
On content-centric router design and implications
Proceedings of the Re-Architecting the Internet Workshop
Modeling data transfer in content-centric networking
Proceedings of the 23rd International Teletraffic Congress
Performance of the move-to-front algorithm with Markov-modulated request sequences
Operations Research Letters
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
Cache "less for more" in information-centric networks
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
Collaborative forwarding and caching in content centric networks
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
AIMD and CCN: past and novel acronyms working together in the future internet
Proceedings of the 2012 ACM workshop on Capacity sharing
On popularity-based load balancing in content networks
Proceedings of the 24th International Teletraffic Congress
Network of Information (NetInf) - An information-centric networking architecture
Computer Communications
Evaluating per-application storage management in content-centric networks
Computer Communications
Cache "less for more" in information-centric networks (extended version)
Computer Communications
Evaluating CCN multi-path interest forwarding strategies
Computer Communications
Performance analysis of in-network caching for content-centric networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
User-assisted in-network caching in information-centric networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the performance of bandwidth and storage sharing in information-centric networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A novel cache size optimization scheme based on manifold learning in Content Centric Networking
Journal of Network and Computer Applications
Performance evaluation of the random replacement policy for networks of caches
Performance Evaluation
| Hi-index | 0.00 |
Content-centric networking proposals, as Parc's CCN, have recently emerged to define new network architectures where content, and not its location, becomes the core of the communication model. These new paradigms push data storage and delivery at network layer and are designed to better deal with current Internet usage, mainly centered around content dissemination and retrieval. In this paper, we develop an analytical model of CCN in-network storage and receiver-driven transport, that more generally applies to a class of content oriented networks identified by chunk-based communication. We derive a closed-form expression for the mean stationary throughput as a function of hit/miss probabilities at the caches along the path, of content popularity and of content/cache size. Our analytical results, supported by chunk level simulations, can be used to analyze fundamental trade-offs in current CCN architecture, and provide an essential building block for the design and evaluation of enhanced CCN protocols.