The LRU-K page replacement algorithm for database disk buffering
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Removal policies in network caches for World-Wide Web documents
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Proxy caching that estimates page load delays
Selected papers from the sixth international conference on World Wide Web
Replacement policies for a proxy cache
IEEE/ACM Transactions on Networking (TON)
Segment-based proxy caching of multimedia streams
Proceedings of the 10th international conference on World Wide Web
Optimal proxy management for multimedia streaming in content distribution networks
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
GreedyDual* Web Caching Algorithm: Exploiting the Two Sources of Temporal Locality in Web Request Streams
Caching Proxies: Limitations and Potentials
Caching Proxies: Limitations and Potentials
Techniques for improving multimedia communication over wide area networks
Techniques for improving multimedia communication over wide area networks
An end-to-end architecture for quality adaptive streaming applications in the internet
An end-to-end architecture for quality adaptive streaming applications in the internet
Journal of Systems and Software
Adaptive frame synchronization for surveillance system across a heterogeneous network
Engineering Applications of Artificial Intelligence
Hi-index | 0.00 |
This paper presents a cache replacement policy which has specifically been developed for the efficient media caching in streaming media cache servers. For efficient media caching, the proposed policy takes into account the periodic patterns of users' requests in addition to the parameters such as reference count, amount of media contents delivered to the clients, and reference time. These values are collected at run-time for each cached object. In order to adequately and promptly adopt to the changing characteristics of users preferences, the policy introduces, in particular, the concept of weighted-window for replacement with which higher priorities are given to more recently referenced media contents and consequently they are less likely to be replaced. We present and analyze the simulation results showing that the proposed policy has outperformed the conventional replacement policies such as LRU, LFU, and SEG in terms of hit ratio, byte-hit ratio, delayed start, and cache input.