The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - Feb. (2013 vol.62)
pp: 351-361
Fangming Liu , Huazhong University of Science and Technology, Wuhan
Bo Li , Hong Kong University of Science and Technology, Hong Kong
Baochun Li , University of Toronto, Toronto
Hai Jin , Huazhong University of Science and Technology, Wuhan
ABSTRACT
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.
INDEX TERMS
Prefetching, Streaming media, Bandwidth, Servers, Queueing analysis, Peer to peer computing, Analytical models, performance evaluation, On-demand video streaming, peer-to-peer, queuing model
CITATION
Fangming Liu, Bo Li, Baochun Li, Hai Jin, "Peer-Assisted On-Demand Streaming: Characterizing Demands and Optimizing Supplies", IEEE Transactions on Computers, vol.62, no. 2, pp. 351-361, Feb. 2013, doi:10.1109/TC.2011.222
REFERENCES
[1] Y. Huang, T. Fu, D. Chiu, J. Lui, and C. Huang, “Challenges, Design and Analysis of a Large-Scale P2P-VoD System,” Proc. ACM SIGCOMM, Aug. 2008.
[2] Y. Hall, P. Piemonte, and M. Weyant, “Joost: A Measurement Study,” technical report, School of Computer Science, Carnegie-Mellon Univ., May 2007.
[3] K. Suh, C. Diot, J. Kurose, L. Massoulie, C. Neumann, D. Towsley, and M. Varvello, “Push-to-Peer Video-on-Demand System: Design and Evaluation,” IEEE J. Selected Areas in Comm., vol. 25, no. 9, pp. 1706-1716, Dec. 2007.
[4] C. Huang, J. Li, and K. Ross, “Can Internet Video-on-Demand Be Profitable?” Proc. ACM SIGCOMM, Aug. 2007.
[5] Y. Boufkhad, F. Mathieu, F. de Montgolfier, D. Perino, and L. Viennot, “Achievable Catalog Size in Peer-to-Peer Video-on-Demand Systems,” Proc. Int'l Workshop Peer-to-Peer Systems, Feb. 2008.
[6] N. Parvez, C. Williamson, A. Mahanti, and N. Carlsson, “Analysis of Bittorrent-Like Protocols for On-Demand Stored Media Streaming,” Proc. ACM SIGMETRICS Int'l Conf. Measurement and Modeling of Computer Systems, June 2008.
[7] Y. Choe, D. Schuff, J. Dyaberi, and V. Pai, “Improving VoD Server Efficiency with Bittorrent,” Proc. Int'l Conf. Multimedia, Sept. 2007.
[8] L. Guo, S. Chen, and X. Zhang, “Design and Evaluation of a Scalable and Reliable P2P Assisted Proxy for On-Demand Streaming Media Delivery,” IEEE Trans. Knowledge and Data Eng., vol. 18, no. 5, pp. 669-682, May 2006.
[9] W. Yiu, X. Jin, and S. Chan, “VMesh: Distributed Segment Storage for Peer-to-Peer Interactive Video Streaming,” IEEE J. Selected Areas in Comm., vol. 25, no. 9, pp. 1717-1731, Dec. 2007.
[10] Y. He, G. Shen, Y. Xiong, and L. Guan, “Optimal Prefetching Scheme in P2P VoD Applications with Guided Seeks,” IEEE Trans. Multimedia, vol. 11, no. 1, pp. 138-151, Jan. 2009.
[11] S. Tewari and L. Kleinrock, “Proportional Replication in Peer-to-Peer Networks,” Proc. IEEE INFOCOM, Apr. 2006.
[12] L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, “Web Caching and Zipf-Like Distributions: Evidence and Implications,” Proc. IEEE INFOCOM, Mar. 1999.
[13] M. Chesire, A. Wolman, G. Voelker, and H. Levy, “Measurement and Analysis of a Streaming Media Workload,” Proc. Third USENIX Symp. Internet Technologies and Systems, Mar. 2001.
[14] L. Guo, E. Tan, S. Chen, Z. Xiao, and X. Zhang, “The Stretched Exponential Distribution of Internet Media Access Patterns,” Proc. ACM Symp. Principles of Distributed Computing (PODC '08), Aug. 2008.
[15] K. Sripanidkulchai, B. Maggs, and H. Zhang, “An Analysis of Live Streaming Workloads on the Internet,” Proc. ACM SIGCOMM Conf. Internet Measurement (IMC), Oct. 2004.
[16] G. Bolch, S. Greiner, H. de Meer, and K. Trivedi, Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applications. Wiley-Interscience, 2006.
[17] X. Yang and G. de Veciana, “Service Capacity of Peer to Peer Networks,” Proc. IEEE INFOCOM, Mar. 2004.
[18] W. Feng, M. Kowada, and K. Adachi, “Analysis of a Multi-Server Queue with Two Priority Classes and (M, N)-Threshold Service Schedule I: Non-Preemptive Priority,” Int'l Trans. Operational Research, vol. 7, no. 6, pp. 653-671, 2000.
[19] Y. Jiang, C. Tham, and C. Ko, “An Approximation for Waiting Time Tail Probabilities in Multi-Class Systems,” IEEE Comm. Letters, vol. 5, no. 4, pp. 175-177, Apr. 2001.
[20] B. Walke, “Improved Bounds and an Approximation for a Dynamic Priority Queue,” Proc. Third Int'l Symp. Measuring, Modelling and Evaluating Computer Systems, Oct. 1977.
[21] C. Wu, B. Li, and S. Zhao, “Exploring Large-Scale Peer-to-Peer Live Streaming Topologies,” ACM Trans. Multimedia Computing, Comm. and Applications, vol. 4, no. 3, pp. 175-177, 2008.
[22] Z. Ge, D. Figueiredo, S. Jaiswal, J. Kurose, and D. Towsley, “Modeling Peer-Peer File Sharing Systems,” Proc. IEEE INFOCOM, Apr. 2003.
[23] D. Burman, “Insensitivity in Queueing Systems,” Advances in Applied Probability, vol. 13, pp. 846-859, 1981.
[24] R. Hemmecke, M. Köppe, J. Lee, and R. Weismantel, “Nonlinear Integer Programming,” 50 Years of Integer Programming 1958-2008: The Early Years and State-of-the-Art Surveys, Springer-Verlag, 2009.
[25] S. Schaible and J. Shi, “Fractional Programming: The Sum-of-Ratios Case,” Optimization Methods and Software, vol. 18, no. 2, pp. 219-229, 2003.
[26] D. Bersekas, Nonlinear Programming. Athena Scientific, 1999.
[27] B. Cheng, L. Stein, H. Jin, and Z. Zhang, “Towards Cinematic Internet Video-on-Demand,” Proc. Third ACM SIGOPS/EuroSys European Conf. Computer Systems, Apr. 2008.
[28] M. Mehyar, D. Spanos, J. Pongsajapan, S. Low, and R. Murray, “Asynchronous Distributed Averaging on Communication Networks,” IEEE/ACM Trans. Networking, vol. 15, no. 3, pp. 512-520, June 2007.
[29] L. Guo, E. Tan, S. Chen, Z. Xiao, and X. Zhang, “The Stretched Exponential Distribution of Internet Media Access Patterns,” Proc. ACM Symp. Principles of Distributed Computing (PODC), Aug. 2008.
57 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool