Improving Disk Cache Hit-Ratios Through Cache Partitioning
IEEE Transactions on Computers
Optimal Partitioning of Cache Memory
IEEE Transactions on Computers
Generating representative Web workloads for network and server performance evaluation
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
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
A survey of Web cache replacement strategies
ACM Computing Surveys (CSUR)
Design, Implementation, and Evaluation of Differentiated Caching Services
IEEE Transactions on Parallel and Distributed Systems
Nonstationary Poisson modeling of web browsing session arrivals
Information Processing Letters
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proceedings of the 5th international conference on Emerging networking experiments and technologies
A reality check for content 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
Proxy caching for media streaming over the Internet
IEEE Communications Magazine
A cache miss equation for partitioning an NDN content store
Proceedings of the 9th Asian Internet Engineering Conference
| Hi-index | 0.24 |
Content-centric networking proposals have recently emerged to redesign the Internet architecture around named data rather than host addresses. Such designs advocate the usage of widely distributed in-network storage, with direct impact on end-user performance and network provider costs. In this paper, we investigate the role of storage management schemes designed to deal with traffic of different applications. First, we show the impact on user performance, service provider and network cost of a static per-application storage allocation using measured traffic traces. Then, we analyze the performance of this static partitioning scheme by means of simulations with synthetic traffic traces. Finally, we evaluate two mechanisms for dynamic storage management, namely strict priority and weighted fair allocation, designed to overcome static partitioning limitations in presence of content time-to-live and of dynamic traffic patterns.