Peer-Assisted On-Demand Streaming: Characterizing Demands and Optimizing Supplies

Nowadays, there has been significant deployment of peer-assisted on-demand streaming services over the Internet. Two of the most unique and salient features in a peer-assisted on-demand streaming system are the differentiation in the demand (or request) and the prefetching capability with caching. In this paper, we develop a theoretical framework based on queuing models, in order to 1) justify the superiority of service prioritization based on a taxonomy of requests, and 2) understand the fundamental principles behind optimal prefetching and caching designs in peer-assisted on-demand streaming systems. The focus is to instruct how limited uploading bandwidth resources and peer caching capacities can be utilized most efficiently to achieve better system performance. To achieve these objectives, we first use priority queuing analysis to prove how service quality and user experience can be statistically guaranteed, by prioritizing requests in the order of significance, including urgent playback (e.g., random seeks or initial startup), normal playback, and prefetching. We then proceed to construct a fine-grained stochastic supply-demand model to investigate peer caching and prefetching as a global optimization problem. This not only provides insights in understanding the fundamental characterization of demand, but also offers guidelines toward optimal prefetching and caching strategies in peer-assisted on-demand streaming systems.

[1]  Myron Hlynka,et al.  Queueing Networks and Markov Chains (Modeling and Performance Evaluation With Computer Science Applications) , 2007, Technometrics.

[2]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[3]  D. Burman Insensitivity in queueing systems , 1980, Advances in Applied Probability.

[4]  Bernhard Walke Improved Bounds and an Approximation for a Dynamic Priority Queue , 1977, Performance.

[5]  Diego Perino,et al.  Achievable catalog size in peer-to-peer video-on-demand systems , 2008, IPTPS.

[6]  Chen-Khong Tham,et al.  An approximation for waiting time tail probabilities in multiclass systems , 2001, IEEE Communications Letters.

[7]  Bruce M. Maggs,et al.  An analysis of live streaming workloads on the internet , 2004, IMC '04.

[8]  Cheng Huang,et al.  Challenges, design and analysis of a large-scale p2p-vod system , 2008, SIGCOMM '08.

[9]  Wei Feng,et al.  Analysis of a multi-server queue with two priority classes and (M, N)-threshold service schedule I: non-preemptive priority , 2000 .

[10]  Laurent Massoulié,et al.  Push-to-Peer Video-on-Demand System: Design and Evaluation , 2007, IEEE Journal on Selected Areas in Communications.

[11]  Carey L. Williamson,et al.  Analysis of bittorrent-like protocols for on-demand stored media streaming , 2008, SIGMETRICS '08.

[12]  R.M. Murray,et al.  Asynchronous Distributed Averaging on Communication Networks , 2007, IEEE/ACM Transactions on Networking.

[13]  Ling Guan,et al.  Optimal Prefetching Scheme in P2P VoD Applications With Guided Seeks , 2009, IEEE Trans. Multim..

[14]  Yung Ryn Choe,et al.  Improving VoD server efficiency with bittorrent , 2007, ACM Multimedia.

[15]  Chuan Wu,et al.  Exploring large-scale peer-to-peer live streaming topologies , 2008, TOMCCAP.

[16]  Songqing Chen,et al.  The stretched exponential distribution of internet media access patterns , 2008, PODC '08.

[17]  Hai Jin,et al.  Towards cinematic internet video-on-demand , 2008, Eurosys '08.

[18]  Alec Wolman,et al.  Measurement and Analysis of a Streaming Media Workload , 2001, USITS.

[19]  Songqing Chen,et al.  Design and evaluation of a scalable and reliable P2P assisted proxy for on-demand streaming media delivery , 2006, IEEE Transactions on Knowledge and Data Engineering.

[20]  Yensy James Hall,et al.  Joost : A Measurement Study , 2007 .

[21]  Cheng Huang,et al.  Can internet video-on-demand be profitable? , 2007, SIGCOMM '07.

[22]  Raymond Hemmecke,et al.  Nonlinear Integer Programming , 2009, 50 Years of Integer Programming.

[23]  Gustavo de Veciana,et al.  Performance of peer-to-peer networks: Service capacity and role of resource sharing policies , 2006, Perform. Evaluation.

[24]  Leonard Kleinrock,et al.  Proportional Replication in Peer-to-Peer Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[25]  Donald F. Towsley,et al.  Modeling peer-peer file sharing systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[26]  Shueng-Han Gary Chan,et al.  VMesh: Distributed Segment Storage for Peer-to-Peer Interactive Video Streaming , 2007, IEEE Journal on Selected Areas in Communications.

[27]  Siegfried Schaible,et al.  Fractional programming: The sum-of-ratios case , 2003, Optim. Methods Softw..

[28]  Gustavo de Veciana,et al.  Service capacity of peer to peer networks , 2004, IEEE INFOCOM 2004.