Birthday paradox, coupon collectors, caching algorithms and self-organizing search
Discrete Applied Mathematics
Video staging: a proxy-server-based approach to end-to-end video delivery over wide-area networks
IEEE/ACM Transactions on Networking (TON)
Proxy-Based Distribution of Streaming Video Over Unicast/Multicast Connections TITLE2:
Proxy-Based Distribution of Streaming Video Over Unicast/Multicast Connections TITLE2:
Multimedia information caching for personalized video-on-demand
Computer Communications
Networking requirements for interactive video on demand
IEEE Journal on Selected Areas in Communications
Architecture of a quality based intelligent proxy (QBIX) for MPEG-4 videos
WWW '03 Proceedings of the 12th international conference on World Wide Web
A survey of Web cache replacement strategies
ACM Computing Surveys (CSUR)
AAA-IDEA '06 Proceedings of the 2nd international workshop on Advanced architectures and algorithms for internet delivery and applications
Dynamic proxy-cache multiplication inside LANs
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Hi-index | 0.00 |
In this paper the idea that large objects, such as video files, should not be cached or replaced in their entirety, but rather be partitioned in chunks and replacement decisions be applied at the chunk level is examined. It is shown, that a higher byte hit ratio (BHR) can be achieved through partial replacement. The price paid for the improved BHR performance is that the replacement algorithm, e.g. LRU, takes a longer time to induce the steady state BHR. It is demonstrated that this problem could be addressed by a hybrid caching scheme that employs variable sized chunks; the use of small chunks leads to the maximization of BHR in periods of stable video popularity, while large chunks are used when extreme popularity changes occur to assist the fast convergence to the new steady state BHR.