In this paper, we propose a novel proxy caching scheme for video-on-demand (VoD) services. Our approach is based on the observation that streaming video users searching for some specific content or scene pay most atte...
详细信息
In this paper, we propose a novel proxy caching scheme for video-on-demand (VoD) services. Our approach is based on the observation that streaming video users searching for some specific content or scene pay most attention to the initial delay, while a small shift of the starting point is acceptable. We present results from subjective VoD tests that relate waiting time and starting point deviation to user satisfaction. based on this relationship as well as the dynamically changing popularity of video segments, we propose an efficient segment-based caching algorithm, which maximizes the user satisfaction by trading off between the initial delay and the deviation of starting point. Our caching scheme supports interactive video cassette recorder (VCR) functionalities and enables cache replacement with a much finer granularity compared to previously proposed segment-based approaches. Our experimental results show a significantly improved user satisfaction for our scheme compared to conventional caching schemes.
Recently, peer-to-peer (P2P) overlay networks have become popular and many P2P applications such as file sharing and content distribution have been introduced. Naturally, P2P cooperative caching schemes for streaming ...
详细信息
ISBN:
(纸本)9781424406661
Recently, peer-to-peer (P2P) overlay networks have become popular and many P2P applications such as file sharing and content distribution have been introduced. Naturally, P2P cooperative caching schemes for streaming were introduced. However, these approaches manifest inefficiency of cache utilization due to inappropriate cache replacement algorithms, and no consideration of dynamic membership changes of peer nodes. In this paper, we investigate an efficient cooperative caching mechanism for VOD streaming service over P2P overlay networks. The target of the system is to provide low-latency and high-quality services by virtue of pees' collaboration. The storage and replacement of caching content are based on segment-based strategy. And a utility-based fine-grained cooperative cache (DUFC) policy was proposed for cache replacement. We demonstrate the effectiveness of the proposed scheme and compare with traditional LRUF scheme through extensive simulation experiments over large, Internet-like topologies.
Most proxy caches for streaming videos do not cache the entire video but only a portion of it. This is partly due to the large size of video objects. Another reason is that the popularity of different parts of a video...
详细信息
Most proxy caches for streaming videos do not cache the entire video but only a portion of it. This is partly due to the large size of video objects. Another reason is that the popularity of different parts of a video can be different, e.g., the prefix is generally more popular. Therefore, the development of efficient cache mechanisms requires an understanding of the internal popularity characteristics of streaming videos. This paper has two major contributions. Firstly, we analyze two 6-month long traces of RTSP video requests recorded at different streaming video servers of an entertainment video-on-demand provider, and show that the traces provide evidence that the internal popularity of the majority of the most popular videos obeys a k-transformed Zipf-like distribution. Secondly, we propose a caching algorithm which exploits this empirical internal popularity distribution. We find that this algorithm has similar performance compared with fine-grained caching but requires significantly less state information.
As streaming video over the Internet becomes increasingly popular, cost-effective caching of these large multimedia documents has become of utmost importance. For large media objects, such as a 2-hour video, treating ...
详细信息
ISBN:
(纸本)9780769526942
As streaming video over the Internet becomes increasingly popular, cost-effective caching of these large multimedia documents has become of utmost importance. For large media objects, such as a 2-hour video, treating the whole video as a single web object for caching is not appropriate. The paper presents reservation-basedcaching algorithms to evaluate a segment-based buffer management approach for off-line scheduling and caching in polynomial time. The cache admission and replacement policies decide when, where and for how long videos will be cached. Requests for videos are available a priori.
In order to improve the system effectiveness, a novel patch scheduling strategy with proxy caching is proposed, which can joint the proxy caching and server scheduling strategies in an effectively way. It employs the ...
详细信息
In order to improve the system effectiveness, a novel patch scheduling strategy with proxy caching is proposed, which can joint the proxy caching and server scheduling strategies in an effectively way. It employs the scheme of cache allocation based on the cache window size, which could be increased or decreased adaptively according to the popularity of the requested object. Such as, the principle would be realized, of which the number of segments cached for each object is in proportion to their popularity at proxy server. Theoretical analysis and simulation results show that this strategy can effectively reduce the server and network bandwidth usage, and also has a very good adaptability for the variety of the request arrival rate.
暂无评论