Reuse time based caching policy for video streaming

In this paper, we investigate the proxy video caching problem and propose a specific caching replacement strategy for segmented video streaming. The proposed caching algorithm makes use of the natural linear time structure of video streaming, which fits the philosophy of the optimal MIN algorithm. By observing the watching positions of active viewers at a certain point of time, the replacement approach computes the exact reuse time or, if not available, the predicted reuse time for stored video segments, and discards the segment that is supposedly to be used the furthest in time. Evaluations performed on a trace of a real Video-On-Demand (VOD) service show that the proposed caching algorithm substantially improves the hit ratio, especially for small caches.