Optimal Data Scheduling for P2P VoD Streaming Systems

Author(s):  
Qifeng Yu ◽  
Daoxu Chen
2015 ◽  
Vol 719-720 ◽  
pp. 756-766
Author(s):  
Yong Jiang ◽  
Shu Wu Zhang ◽  
Jie Liu

In Peer-to-Peer (P2P) Video-on-Demand (VoD) streaming systems, supporting free VCR operations is challenging. Prefetching is a good way to improve user experience of VCR interactivity. But most existing P2P VoD prefetching schemes are proposed aimed at those popular videos with large amount of log data, without considering the situation that the videos are unpopular or the popular videos are in their initial phase of release. In this situation, these schemes cannot support user VCR interactivity very well. To address this issue, we propose a new optimized prefetching scheme, called Hybrid Anchor Scheme (HAS), in which fixed anchors and dynamic anchors are merged together. The dynamic anchors are generated based on association rule and segments popularity. Through combining the way of sequential prefetching according to weight of segments and the way of several rounds prefetching, we implement HAS effectively. Extensive simulations validate the proposed prefetching scheme provide shorter seeking latency compared to other prefetching schemes.


2012 ◽  
Vol 6 (12) ◽  
pp. 1625 ◽  
Author(s):  
Q. Yu ◽  
B. Ye ◽  
S. Lu ◽  
D. Chen

Author(s):  
Khaled Ragab

Peer-to-Peer (P2P) file downloading and streaming applications have recently attracted a large number of users on the Internet. Currently, several P2P video streaming systems have been deployed to reduce the cost at server. They are classified into two categories live and on-demand streaming systems. The live streaming systems disseminate live video contents to all peers in real time. On the other hand, the on-demand video (VoD) streaming system enables peers to enjoy the flexibility of watching video. It realizes the goal of watch whatever you want, whenever you want. The current P2P-VoD systems cannot realize such goals efficiently. This chapter proposes a self-organized structured overlay network of peers to realize that goal and improve performance. Each peer is able to cache some video minutes associated with the current media being played. The proposed overlay network is organized into clusters. Each cluster contains peers with overlapped buffer windows where their playing points are located between lower and upper play point limits. When a peer in the cluster moves its play point within the limits, for example by performing a seek operation, it then can rapidly discover and fetch the required blocks for the playback buffer from peers in the same cluster. Clusters improve both discovery and fetch overheads. However, it needs cluster management overhead.


2012 ◽  
Vol 56 (2) ◽  
pp. 239-257 ◽  
Author(s):  
P. Liu ◽  
G. Huang ◽  
S. Feng ◽  
J. Fan

Sign in / Sign up

Export Citation Format

Share Document