P2P流媒体视频点播系统中的数据查询与调度优化研究
|
摘要
近年来,随着计算机计算能力的提高、互联网的普及以及网络接入带宽的不断增加,网络流媒体视频点播服务不断涌现,并吸引了大量互联网用户。然而,作为Internet上一种“杀手应用”(Killer Application),流媒体视频点播系统带宽消耗较大,如果采用C/S模式的系统构架,系统的可扩展性将受限于服务器性能,系统规模和吞吐量的提升常以增加硬件投资为代价。P2P (peer-to-peer)技术为互联网的资源共享与服务协同提供了一种新的技术途径,在基于P2P技术的流媒体视频点播系统中,用户节点下载视频数据的同时,为其他节点提供其缓存数据的上载,以此来减轻服务器的负载,从而提高系统可扩展性。然而,用户请求的异步性及交互操作的动态性,使得用户节点下载并缓存的视频数据会存在差异。因此,用户节点之间的数据协作传输需要有效的数据查询和数据调度功能提供支持：数据查询保证快速定位请求数据所在的节点,数据调度保证流服务的实时性和播放连续性。
本文对P2P流媒体视频点播系统中的数据查询和数据调度问题进行了深入研究,在分析P2P流媒体视频点播系统特性的前提下,探讨如何设计有效可行的数据查询和数据调度算法,来达到提高系统性能的目的。具体贡献可以概括为以下三个方面：
·本文对具有集中式索引的P2P流媒体视频点播系统中的数据调度问题进行了研究。我们对P2P流媒体视频点播系统中的数据传输性质进行了分析,并详细讨论了数据调度优化的具体目标,根据分析和讨论的结果,提出了一种基于网络最大流的数据调度算法MFDS (Max Flow based Data Scheduling)。MFDS将P2P流媒体视频点播系统中的数据传输映射到虚拟的流网络,通过虚拟流网络的最大流求解来解决数据调度的优化问题。理论分析和模拟实验验证了MFDS算法在提高用户播放连续性和减轻服务器负载上有良好的表现,同时MFDS算法的低计算开销和调度结果的低节点度也进一步验证了MFDS算法的可行性。
·本文对P2P流媒体视频点播系统中的分布式数据查询问题进行了研究。我们结合P2P流媒体视频点播的特性,深入分析了分布式数据查询应具备的特点。从支持交互操作和考虑节点异构性的角度出发,本文提出了一种基于跳图(Skip Graph)的分布式数据查询机制,该机制将流媒体视频点播系统中播放点相近的用户节点进行聚类,通过聚类键值之间的关系来构建聚类之间的连接,从而形成一个特殊的跳图,以此作为索引覆盖网络。通过设计这一索引覆盖网络上的基本操作,可以实现快速的数据查询,并为用户节点的交互操作提供有效支持。理论分析和模拟实验分析和验证了这分布式查询机制具有较短的查询时延,其采用的索引覆盖网络鲁棒性强,维护开销合理。
·本文对P2P流媒体视频点播系统中的分布式数据调度问题进行了研究。我们根据P2P流媒体视频点播系统中的数据传输要求及特性,深入分析了分布式数据调度的本质。通过理论分析验证了结合提前拒绝的EDF策略的有效性,并通过实验比较分析了已有的请求节点调度策略。基于分析结果,提出了节点上载压力向量的概念,并在此基础上提出了基于节点上载压力向量的分布式数据调度算法,算法确定了节点发送数据请求和对收到请求响应的策略。实验结果表明,相对于已有的分布式数据调度算法,基于节点上载压力向量的调度在系统性能方面有明显的改善。
In recent years, Video-on-Demand(VoD) streaming services have emerged and attract-ed large amounts of Internet users. However, as the "Killer Application" on the Inter-net, streaming service causes significant bandwidth consumption. Traditional Clien-t/Server architecture based streaming system lacks of scalability. P2P (peer-to-peer) technology has emerged as a promising solution to address the scalability issue. In a P2P based VoD system, the users cache the video content received, and relay the cached data to other users. This cache-and-relay strategy alleviates the server stress and increases the scalability of the system. However, due to the asynchrony of the user requests and dynamics of the interactive operations, there may be differences among the data downloaded and cached by the users. An efficient data searching approach is required for the data transferring corporation among the users, by which a user can find other users holding the expected video content. The realtime requirement of the streaming service also desires an efficient data scheduling scheme, to make sure the video data can be downloaded in time.
Based on the characteristics analysis of P2P VoD systems. We aim to design efficient data searching and scheduling schemes to improve the performance of the systems. The main contributions of this thesis are as follows:
1. We looked into the data scheduling problem in P2P VoD systems with central-ized indexing capability. We first analyzed the characteristics of the data trans-ferring in P2P VoD systems, and discussed the objectives of the data scheduling. Based on the analysis and discussion, we have proposed the max-flow based data scheduling algorithm MFDS. MFDS maps the data scheduling problem onto a virtual flow network. We solved the data scheduling optimization problem by computing the max-flow of the mapped virtual flow network. Theoretical analy-sis and simulation verified the good performance of MFDS, the low computation cost and low node degrees of the scheduling result.
2. We looked into the distributed data searching problem in P2P VoD systems. We have proposed a Skip Graph based indexing overlay for P2P VoD systems named SkipStream. In SkipStream, users are gathered into several clusters according to their playback point. Based on their keys, these clusters are organized into a special skip graph. We designed a distributed data searching scheme on this skip graph based overlay. Theoretical analysis and simulation have shown the effi-ciency of the searching scheme, as well as the robustness and low maintenance cost of the search structure.
3. We looked into the distributed data scheduling problem in P2P VoD system-s. We first analyzed the essence of the distributed data scheduling in P2P VoD systems. We analyzed and verified the efficiency of the Early Reject combined EDF(Earliest Deadline First) strategy for the requested peers. We also analyzed existing representative strategies for the requesting peers by simulations. Based on the analysis, we have introduced the concept of upload pressure vector, and have proposed the upload pressure vector based data scheduling scheme. This novel scheme determines how to send out the data requests and how to deal with the received data requests for each peer. Simulation results have shown that the upload pressure vector based scheduling scheme outperforms the existing ones.
本文对P2P流媒体视频点播系统中的数据查询和数据调度问题进行了深入研究,在分析P2P流媒体视频点播系统特性的前提下,探讨如何设计有效可行的数据查询和数据调度算法,来达到提高系统性能的目的。具体贡献可以概括为以下三个方面：
·本文对具有集中式索引的P2P流媒体视频点播系统中的数据调度问题进行了研究。我们对P2P流媒体视频点播系统中的数据传输性质进行了分析,并详细讨论了数据调度优化的具体目标,根据分析和讨论的结果,提出了一种基于网络最大流的数据调度算法MFDS (Max Flow based Data Scheduling)。MFDS将P2P流媒体视频点播系统中的数据传输映射到虚拟的流网络,通过虚拟流网络的最大流求解来解决数据调度的优化问题。理论分析和模拟实验验证了MFDS算法在提高用户播放连续性和减轻服务器负载上有良好的表现,同时MFDS算法的低计算开销和调度结果的低节点度也进一步验证了MFDS算法的可行性。
·本文对P2P流媒体视频点播系统中的分布式数据查询问题进行了研究。我们结合P2P流媒体视频点播的特性,深入分析了分布式数据查询应具备的特点。从支持交互操作和考虑节点异构性的角度出发,本文提出了一种基于跳图(Skip Graph)的分布式数据查询机制,该机制将流媒体视频点播系统中播放点相近的用户节点进行聚类,通过聚类键值之间的关系来构建聚类之间的连接,从而形成一个特殊的跳图,以此作为索引覆盖网络。通过设计这一索引覆盖网络上的基本操作,可以实现快速的数据查询,并为用户节点的交互操作提供有效支持。理论分析和模拟实验分析和验证了这分布式查询机制具有较短的查询时延,其采用的索引覆盖网络鲁棒性强,维护开销合理。
·本文对P2P流媒体视频点播系统中的分布式数据调度问题进行了研究。我们根据P2P流媒体视频点播系统中的数据传输要求及特性,深入分析了分布式数据调度的本质。通过理论分析验证了结合提前拒绝的EDF策略的有效性,并通过实验比较分析了已有的请求节点调度策略。基于分析结果,提出了节点上载压力向量的概念,并在此基础上提出了基于节点上载压力向量的分布式数据调度算法,算法确定了节点发送数据请求和对收到请求响应的策略。实验结果表明,相对于已有的分布式数据调度算法,基于节点上载压力向量的调度在系统性能方面有明显的改善。
In recent years, Video-on-Demand(VoD) streaming services have emerged and attract-ed large amounts of Internet users. However, as the "Killer Application" on the Inter-net, streaming service causes significant bandwidth consumption. Traditional Clien-t/Server architecture based streaming system lacks of scalability. P2P (peer-to-peer) technology has emerged as a promising solution to address the scalability issue. In a P2P based VoD system, the users cache the video content received, and relay the cached data to other users. This cache-and-relay strategy alleviates the server stress and increases the scalability of the system. However, due to the asynchrony of the user requests and dynamics of the interactive operations, there may be differences among the data downloaded and cached by the users. An efficient data searching approach is required for the data transferring corporation among the users, by which a user can find other users holding the expected video content. The realtime requirement of the streaming service also desires an efficient data scheduling scheme, to make sure the video data can be downloaded in time.
Based on the characteristics analysis of P2P VoD systems. We aim to design efficient data searching and scheduling schemes to improve the performance of the systems. The main contributions of this thesis are as follows:
1. We looked into the data scheduling problem in P2P VoD systems with central-ized indexing capability. We first analyzed the characteristics of the data trans-ferring in P2P VoD systems, and discussed the objectives of the data scheduling. Based on the analysis and discussion, we have proposed the max-flow based data scheduling algorithm MFDS. MFDS maps the data scheduling problem onto a virtual flow network. We solved the data scheduling optimization problem by computing the max-flow of the mapped virtual flow network. Theoretical analy-sis and simulation verified the good performance of MFDS, the low computation cost and low node degrees of the scheduling result.
2. We looked into the distributed data searching problem in P2P VoD systems. We have proposed a Skip Graph based indexing overlay for P2P VoD systems named SkipStream. In SkipStream, users are gathered into several clusters according to their playback point. Based on their keys, these clusters are organized into a special skip graph. We designed a distributed data searching scheme on this skip graph based overlay. Theoretical analysis and simulation have shown the effi-ciency of the searching scheme, as well as the robustness and low maintenance cost of the search structure.
3. We looked into the distributed data scheduling problem in P2P VoD system-s. We first analyzed the essence of the distributed data scheduling in P2P VoD systems. We analyzed and verified the efficiency of the Early Reject combined EDF(Earliest Deadline First) strategy for the requested peers. We also analyzed existing representative strategies for the requesting peers by simulations. Based on the analysis, we have introduced the concept of upload pressure vector, and have proposed the upload pressure vector based data scheduling scheme. This novel scheme determines how to send out the data requests and how to deal with the received data requests for each peer. Simulation results have shown that the upload pressure vector based scheduling scheme outperforms the existing ones.
引文
[1]YouTube. http://www.youtube.com.
[2]YouKu. http://www.youku.com.
[3]PPLive. http://www.pplive.com.
[4]黄琰,徐恪,李海涛,曹杨,姚欣.大规模p2p视频点播系统：聚焦客户端.中国科学：信息科学,2011.
[5]Online video ranking, http://www.comscore.com/Press_Events/ Press_Releases/2012/3/comScore_Releases_February_2012_U. S._Online_Video_Rankings/,March 2012.
[6]超级连接和皆字节时代的到来.http://www.Cisco.com/web/CN/ assets/pdf/Cisco_Hyperconnectivity_ebook_0610_ZH.pdf, June 2010.
[7]A. Dan, D. Sitaram, and P. Shahabuddin. Scheduling policies for an on-demand video server with batching. In Proceedings of the 2nd ACM Multimedia Confer-ence, pages 15-23,1994.
[8]C. C. Aggarwal, J. L. Wolf, and P. S. Yu. On optimal batching policies for video-on-demand storage servers. In Proceedings of 1996 International Conference on Multimedia Computing and Systems, pages 253-258, June 1996.
[9]K. A. Hua, S. Sheu, and Y. Cai. Patching:a multicast technique for true video-on-demand services. In Proceedings of the sixth ACM international conference on Multimedia, pages 191-200, Sep 1998.
[10]Y. Cai, K. Hua, and K. Vu. Optimizing patching performance. In Proceedings of the SPIE Conference on Multimedia Computing and Networking (MMCN'99), pages 204-215,1999.
[11]A. Pathan and R. Buyya. A taxonomy and survey of content delivery networks. Technical report, Grid Computing and Distributed Systems (GRIDS) Laborato-ry, University of Melbourne, Parkville, Australia,2006.
[12]C. D. Cranor, M. Green, C. Kalmanek, and J. E. Merwe. Enhanced streaming services in a content distribution network. IEEE Internet Computing,5(4):66-75,2001.
[13]J. Apostolopoulos, T. Wong, W. Tan, and S. Wee. On multiple description streaming with content delivery networks. In Proceedings of IEEE INFOCOM, 2002.
[14]优酷2011财年第四季度及全年未经审计的财务报告http://tech. sina.com.cn/i/2012-03-12/17136828025.shtml.
[15]Y. Liu, Y. Guo, and C. Liang. A survey on peer-to-peer video streaming systems. Peer-to-Peer Networking and Applications, Vol. 1, No. 1, pages 18-28, March 2008.
[16]Napster. http://www.napster.com.
[17]Gnutella. http://www.emule.org.cn.
[18]Bittorrent. http://www.bittorrent.com/.
[19]Xunlei. http://www.xunlei.com.
[20]X. Zhang, J. Liu, B. Li, and T. P. Yum. Coolstreaming/donet:A data-driven overlay network for peer-to-peer live media streaming. In Proceedings of IEEE Infocom,2005.
[21]PPStream. http://www.ppstream.com.
[22]Joost. http://www.joost.com.
[23]UUSee. http://www.uusee.com.
[24]C. Huang, J. Li, and K. W. Ross. Can internet video-on-demand be profitable. In Proceedings of ACM SIGCOMM, pages 133-144,2007.
[25]R. Schollmeier. A definition of peer-to-peer networking for the classification of peer-to-peer architectures and applications. In Proceedings of 1st International Conference on Peer-to-Peer Computing, pages 101-102, Aug 2001.
[26]Gnutella, http://www.gnutella.com.
[27]Freenet. http://freenetproject.org.
[28]Kazaa. http://www.kazaa.com.
[29]I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord:A scalable peer-to-peer lookup service for internet application. In Proceedings of the 7th ACM SIGCOMM, August 2001.
[30]A. Rowstron and P. Druschel. Pastry:Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In Proceedings of the 18th I-FIP/ACM International Conference on Distributed System Platforms, November 2001.
[31]S. Ratnasamy, M. Handley P. Francis, R. Karp, and S. Shenker. A scalable con-tent addressable network. In Proceedings of the 7th ACM SIGCOMM, August 2001.
[32]B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. Kubiatowicz. Tapestry:A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications (JSAC),22(1):41-53,2004.
[33]Y. Huang, T. Z. J. Fu, D. Chiu, J. C. S. Lui, and C. Huang. Challenges, design and analysis of a large-scale p2p vod system. In Proceedings of ACM SIGCOMM, 2008.
[34]C. Wu, B. Li, and S. Zhao. Multi-channel live p2p streaming:Refocusing on servers. In Proceedings of IEEE INFOCOM 2008,2008.
[35]D. P. Anderson. metascheduling for continous media. ACM Transactions on Computer Systems,11(3), Aug 1993.
[36]Rfc988. http://tools.ietf.org/html/rfc988.
[37]J. Kurose and K. Ross. Computer Networking:A top-Down Approach Featuring the Internet. Addison Wesley, Boston, Massachusetts,2002.
[38]W. Yiu, X. Jin, and S. Chan. Challenges and approaches in large-scale peer-to-peer media streaming. IEEE Multimedia,14(2), April 2007.
[39]C. Yeo, B. Lee, and M. Er. A survey of application level multicast techniques. Computer Communications,27(15):1547-1568,2004.
[40]M. Hosseini, D. Ahmed, S. Shirmohammadi, and N. Georganas. A survey of application-layer multicast protocols. IEEE Communications Surveys and Tuto-riala,9(1-4):58-74,2007.
[41]Y. Chu, S. G. Rao, S. Seshan, and H. Zhang. A case for end system multicast. In Proceedings of ACM Sigmetrics, pages 1-12,2000.
[42]J. Jannotti, D. K. Gifford, K. L. Johnson, M. F. Kaashoek, and J. W. O'Toole Jr. Overcast:Reliable multicasting with an overlay network. In Proceedings of USENIX OSDI, pages 197-212,2000.
[43]D. Pendarakis, S. Shi, D. Verma, and M. Waldvogel. Almi:an application lev-el multicast infrastructure. In Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems (USITS), pages 49-60,2001.
[44]V. Roca and A. El-Sayed. A host-based multicast (hbm) solution for group communications. In Proceedings of International Conference on Networking, 2001.
[45]S. Zhuang, B. Zhao, A. Joseph, R. Katz, and J. Kubiatowicz. Bayeux:an ar-chitecture for scalable and fault-tolerant wide-area data dissemination. In Pro-ceedings of the 11th International workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV), pages 11-20,2001.
[46]S. Banerjee, B. Bhattacharjee, and C. Kommareddy. Scalable application layer multicast. In Proceedings of SIGCOMM'02, pages 205-217,2002.
[47]D. Tran, K. Hua, and T. Do. Zigzag:An efficient peer-to-peer scheme for media streaming. In Proceedings of IEEE INFOCOM,2003.
[48]V. N. Padmanabhan, H. J. Wang, P. A. Chou, and K. Sripanidkulchai. Distribut-ing streaming media content using cooperative networking. In Proceedings of ACM NOSSDAV,2002.
[49]M. Castro, P. Druschel, A. Kermarrec, A. Nandi, A. Rowstron, and A. Singh. Splitstream:high-bandwidth multicast in cooperative environments. In Pro-ceedings of the 19th ACM Symposium on Operating Systems Principles (SOSP), pages 298-313,2003.
[50]V. K. Goyal. Multiple description coding:Compression meets the network. IEEE Signall Processing Magazine,18(5):74-93,2001.
[51]M. Castro, P. Druschel, A. Kermarrec, and A. Rowstron. Scribe:A large-scale and decentralized application-level multicast infrastructure. IEEE Journal of Selected Areas in Communication,2002.
[52]V. Pai, K. Kumar, K. Tamilmani, V. Sambamurthy, and A. Mohr. Chainsaw: Eliminating trees from overlay multicast. In Proceedings of IPTPS,2005.
[53]M. Zhang, J. Luo, L. Zhao, and S. Yang. A peer-to-peer network for live media streaming using a push-pull approach. In Proceedings of the 13th ACM interna-tional conference on Multimedia, pages 287-290,2005.
[54]X. Liao, H. Jin, Y. Liu, L. M. Ni, and D. Deng. Anysee:Peer-to-peer live streaming. In Proceedings of the 25th IEEE INFOCOM, April 2006.
[55]N. Magharei and R. Rejaie. Prime:Peer-to-peer receiver-driven mesh-based streaming. In Proceedings of the 26th IEEE INFOCOM, May 2007.
[56]N. Magharei, R. Rejaie, and Y. Guo. Mesh or multiple-tree:A comparative study of p2p live streaming services. In Proceedings of IEEE INFOCOM,2007.
[57]A. Kermarrec, L. Massoulie, and A. Ganesh. Probabilistic reliable dissemination in large-scale systems. IEEE Transactions on Parallel and Distributed Systems, 14(3):248-258,2003.
[58]A. Ganesh, A. Kermarrec, and L. Massoulie. Peer-to-peer membership manage-ment for gossip-based protocols. IEEE Transactions on Computers,2003.
[59]Y. Guo, K. Suh, J. Kurose, and D. Towsley. P2cast:peer-to-peer patching scheme for vod service. In Proceedings of WWW 03, pages 301-309,2003.
[60]S. Sheu, K. A. Hua, and W. Tavanapong. Chaining:A generalized batching technique for video-on-demand. In ICMCS, pages 110-117,1997.
[61]Tai T. Do, K. A. Hua, and M. Tantaoui. "p2vod:Providing fault tolerant video-on-demand streaming in peer-to-peer environment. In Proceedings of the IEEE International Conference on Communications, June 2004.
[62]B. Liu, Y. Cui, B. Chang, B. Gotow, and Y. Xue. Bittube:case study of a web-based peer-assisted video on demand system. In Proceedings of Tenth IEEE International Symposium on Multimedia, pages 242-249,2008.
[63]C. Dana, D. Li, D. Harrison, and C. Chuah. Bass:Bittorrent assisted streaming system for video-on-demand. In Proceedings of 2005 IEEE 7th Workshop on Multimedia Signal Processing, pages 1-4,2005.
[64]A. Vlavianos, M. Iliiofotou, and M. Faloutsos. Bitos:Enhancing bittorrent for supporting streaming applications. In Proceedings of INFOCOM 2006, pages 1-6,2006.
[65]D. Erman, K. De Vogeleer, and A. Popescu. On piece selection for streaming bittorrent. In Proceedings of Fifth Swedish National Computer Networking Wor-shop (SNCNW2008),2008.
[66]P. Shah and J.F. Paris. Peer-to-peer multimedia streaming using bittorrent. In Proceedings of IEEE International Performance, Computing, and Communica-tions Conference, pages 340-347,2007.
[67]N. Carlsson and D. L. Eager. Peer-assisted on-demand streaming of stored media using bittorrent-like protocols. In Proceedings of Networking'07, pages 570-581,2007.
[68]Y. Guo, S. Mathur, K. Ramaswamy, S. Yu, and B. Patel. Ponder:Performance aware p2p video-on-demand service. In Proceedings of GLOBECOM, pages 225-230,2007.
[69]X. Yang, M. Gjoka, P. Chhabra, A. Markopoulou, and P. Rodriguez. Kangaroo: video seeking in p2p systems. In Proceedings of IPTPS, page 6. USENIX,2009.
[70]Y. Guo, K. Suh, J. Kurose, and D. Towsley. A peer-to-peer on-demand streaming service and its performance evaluation. In Proceedings of the IEEE International Conference on Multimedia and Expo, July 2003.
[71]Y. Guo, K. Suh, J. Kurose, and D. F. Towsley. Directstream:A directory-based peer-to-peer video streaming service. Computer Communications, pages 520-536,2008.
[72]M. Hefeeda, A. Habib, B. Botev, D. Xu, and B. K. Bhargava. Promise:peer-to-peer media streaming using collectcast. In Proceedings of ACM Multimedia'03, pages 45-54,2003.
[73]Z. Yin and H. Jin. DHT based collaborative multimedia streaming and caching service. In Proceedings of TENCON,2005.
[74]N. Vratonjic, P. Gupta, N. Knezevic, D. Kostic, and A. Rowstron. Enabling dvd-like features in p2p video-on-demand systems. In Proceedings of 2007 Workshop on Peer-to-Peer Streaming and IP-TV (P2P-TV'07), pages 329-334,2007.
[75]W. K. Yiu, Xing Jin, and S. G. Chan. Vmesh:Distributed segment storage for peer-to-peer interactive video streaming. IEEE Journal on Selected Areas in Communications,25(9):1717-1731, Dec 2007.
[76]H. Zhang, A. Goel, and R. Govindan. Improving lookup latency in distributed hash table systems using random sampling. IEEE/ACM Transactions on Net-working (TON),13(5):1121-1134, Oct 2005.
[77]D. Wang and C. K. Yeo. Superchunk-based efficient search in p2p-vod system. IEEE TRANSACTIONS ON MULTIMEDIA,13(2), April 2011.
[78]Y. Cui, B. Li, and K. Nahrstedt. ostream:Asynchronous streaming multicast in application layer overlay networks. IEEE JSAC,22:91-106, Jan 2004.
[79]J. Liu and M. Zhou. Tree-assisted gossiping for overlay video distribution. Mul-timedia Tools and Applications,29(3):211-232,2006.
[80]H. Chi, Q. Zhang, J. Jia, and X. Shen. Efficient search and scheduling in p2p-based media-on-demand streaming service. IEEE Journal on Selected Areas in Communications,25(1):119-130, Jan 2007.
[81]D.Wang and J. Liu. A dynamic skip list-based overlay for on-demand media streaming with vcr interactions. IEEE Transactions on Parallel and Distributed Systems,19(4):503-514,2008.
[82]W. Pugh. Skip lists:a probabilistic alternative to balanced trees. Communica-tions of the ACM,33(6):668-676,1990.
[83]S. Annapureddy, S. Guha, C. Gkantsidis, D. Gunawardena, and P. Rodriguez. Is high-quality vod feasible using p2p swarming? In Proceedings of WWW'07, pages 903-912,2007.
[84]Y. Zhou, D. M. Chiu, and J. C. S. Lui. A simple model for analyzing p2p streaming protocols. In Proceedings of IEEE International Conference on In Network Protocols, pages 226-235, Oct 2007.
[85]J. A. Pouwelse, P. Garbacki, D. H. J. Epema, and H. J. Sips. The bittorrent p2p file-sharing system:Measurements and analysis. In Proceedings of IPTPS'05, pages 205-216,2005.
[86]B. Fan, D. G. Andersen, M. Kaminsky, and K. Papagiannaki. Balancing through-put, robustness, and in-order delivery in p2p vod. In Proceedings of CoNEXT, 2010.
[87]J. Chen, X. Du, W. Cheng, and J. Xu. Providing efficient p2p vod service with priority based scheduling. In Proceedings of 6th International Conference on Wireless Communications Networking and Mobile Computing (WiCOM), Sep 2010.
[88]Y. Yang, A. L. H. Chow, L. Golubchik, and D. Bragg. Improving qos in bittorrent-like vod systems. In INFOCOM'10, pages 2061-2069,2010.
[89]U. Abbasi, G. Simo, and T. Ahmed. Differentiated chunk scheduling for p2p video-on-demand system. In Proceedings of 2011 IEEE Consumer Communi-cations and Networking Conference (CCNC), pages 622-626, Jan 2011.
[90]Y. Guo, C. Liang,, and Y. Liu. Aqcs:Adaptive queue-based chunk scheduling for p2p live streaming. In Proceedings of of IFIP Networking,2008.
[91]S. Liu, M. Chen, S. Sengupta, M. Chiang, J. Li, and P. Chou. P2p streaming capacity under node degree bound. In Proceedings of IEEE ICDCS'10, Jun 2010.
[92]TuDou. http://www.tudou.com.
[93]C. Wu, B. Li, and S. Zhao. Continustreaming:Achieving high playback conti-nuity of gossip-based peer-to-peer streaming. In Proceedings of IPDPS 2008, 2008.
[94]M. Jain and C. Dovrolis. End-to-end available bandwidth:measuremen-t methodology, dynamics, and relation with tcp throughput. In Proceedings of ACM SIGCOMM 2002, Aug 2002.
[95]R. Ahlswede, N. Cai, S. R. Li, and R. W. Yeung. Network information flow. IEEE Transactions on Information Theory, pages 1204-1216,2000.
[96]C. Wu and B. Li. rstream:Resilient and optimal peer-to-peer streaming with rateless codes. IEEE Transactions on Parallel and Distributed Systems, pages 77-92,2008.
[97]C. Gkantsidis and P. Rodriguez. Network coding for large scale content distri-bution. In INFOCOM'05, pages 2235-2245,2005.
[98]M. Wang and B. Li. Network coding in live peer-to-peer streaming. IEEE Transactions on Multimedia, pages 1554-1567,2007.
[99]J. Aspnes and G. Shah. Skip graphs. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'03), Jan 2003.
[100]J. Wu and B. Li. Keep cache replacement simple in peer-assisted vod systems. In Proceedings of IEEE Infocom 2009,2009.
[101]C. Zheng, G. Shen, and S. Li. Distributed prefetching scheme for random seek support in peer-to-peer streaming applications. In Proceedings of the ACM Workshop on Advances in Peer-to-Peer Multimedia Streaming(P2PMMS'05), Nov 2005.
[102]M. Wang, L. Xu, and B. Ramamurthy. Providing statistically guaranteed stream-ing quality for peer-to-peer live streaming. In Proceedings of NOSSDAV'09, 2009.
[103]Z. Liu, C. Wu, B. Li, and S. Zhao. Distilling superior peers in large-scale p2p streaming systems. In Proceedings of INFOCOM'09, April 2009.
[104]N. Parvez, C. Williamson, A. Mahanti, and N. Carlsson. Analysis of bittorrent-like protocols for on-demand stored media streaming. In SIGMETRICS'08, 2008.
[2]YouKu. http://www.youku.com.
[3]PPLive. http://www.pplive.com.
[4]黄琰,徐恪,李海涛,曹杨,姚欣.大规模p2p视频点播系统：聚焦客户端.中国科学：信息科学,2011.
[5]Online video ranking, http://www.comscore.com/Press_Events/ Press_Releases/2012/3/comScore_Releases_February_2012_U. S._Online_Video_Rankings/,March 2012.
[6]超级连接和皆字节时代的到来.http://www.Cisco.com/web/CN/ assets/pdf/Cisco_Hyperconnectivity_ebook_0610_ZH.pdf, June 2010.
[7]A. Dan, D. Sitaram, and P. Shahabuddin. Scheduling policies for an on-demand video server with batching. In Proceedings of the 2nd ACM Multimedia Confer-ence, pages 15-23,1994.
[8]C. C. Aggarwal, J. L. Wolf, and P. S. Yu. On optimal batching policies for video-on-demand storage servers. In Proceedings of 1996 International Conference on Multimedia Computing and Systems, pages 253-258, June 1996.
[9]K. A. Hua, S. Sheu, and Y. Cai. Patching:a multicast technique for true video-on-demand services. In Proceedings of the sixth ACM international conference on Multimedia, pages 191-200, Sep 1998.
[10]Y. Cai, K. Hua, and K. Vu. Optimizing patching performance. In Proceedings of the SPIE Conference on Multimedia Computing and Networking (MMCN'99), pages 204-215,1999.
[11]A. Pathan and R. Buyya. A taxonomy and survey of content delivery networks. Technical report, Grid Computing and Distributed Systems (GRIDS) Laborato-ry, University of Melbourne, Parkville, Australia,2006.
[12]C. D. Cranor, M. Green, C. Kalmanek, and J. E. Merwe. Enhanced streaming services in a content distribution network. IEEE Internet Computing,5(4):66-75,2001.
[13]J. Apostolopoulos, T. Wong, W. Tan, and S. Wee. On multiple description streaming with content delivery networks. In Proceedings of IEEE INFOCOM, 2002.
[14]优酷2011财年第四季度及全年未经审计的财务报告http://tech. sina.com.cn/i/2012-03-12/17136828025.shtml.
[15]Y. Liu, Y. Guo, and C. Liang. A survey on peer-to-peer video streaming systems. Peer-to-Peer Networking and Applications, Vol. 1, No. 1, pages 18-28, March 2008.
[16]Napster. http://www.napster.com.
[17]Gnutella. http://www.emule.org.cn.
[18]Bittorrent. http://www.bittorrent.com/.
[19]Xunlei. http://www.xunlei.com.
[20]X. Zhang, J. Liu, B. Li, and T. P. Yum. Coolstreaming/donet:A data-driven overlay network for peer-to-peer live media streaming. In Proceedings of IEEE Infocom,2005.
[21]PPStream. http://www.ppstream.com.
[22]Joost. http://www.joost.com.
[23]UUSee. http://www.uusee.com.
[24]C. Huang, J. Li, and K. W. Ross. Can internet video-on-demand be profitable. In Proceedings of ACM SIGCOMM, pages 133-144,2007.
[25]R. Schollmeier. A definition of peer-to-peer networking for the classification of peer-to-peer architectures and applications. In Proceedings of 1st International Conference on Peer-to-Peer Computing, pages 101-102, Aug 2001.
[26]Gnutella, http://www.gnutella.com.
[27]Freenet. http://freenetproject.org.
[28]Kazaa. http://www.kazaa.com.
[29]I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord:A scalable peer-to-peer lookup service for internet application. In Proceedings of the 7th ACM SIGCOMM, August 2001.
[30]A. Rowstron and P. Druschel. Pastry:Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In Proceedings of the 18th I-FIP/ACM International Conference on Distributed System Platforms, November 2001.
[31]S. Ratnasamy, M. Handley P. Francis, R. Karp, and S. Shenker. A scalable con-tent addressable network. In Proceedings of the 7th ACM SIGCOMM, August 2001.
[32]B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. Kubiatowicz. Tapestry:A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications (JSAC),22(1):41-53,2004.
[33]Y. Huang, T. Z. J. Fu, D. Chiu, J. C. S. Lui, and C. Huang. Challenges, design and analysis of a large-scale p2p vod system. In Proceedings of ACM SIGCOMM, 2008.
[34]C. Wu, B. Li, and S. Zhao. Multi-channel live p2p streaming:Refocusing on servers. In Proceedings of IEEE INFOCOM 2008,2008.
[35]D. P. Anderson. metascheduling for continous media. ACM Transactions on Computer Systems,11(3), Aug 1993.
[36]Rfc988. http://tools.ietf.org/html/rfc988.
[37]J. Kurose and K. Ross. Computer Networking:A top-Down Approach Featuring the Internet. Addison Wesley, Boston, Massachusetts,2002.
[38]W. Yiu, X. Jin, and S. Chan. Challenges and approaches in large-scale peer-to-peer media streaming. IEEE Multimedia,14(2), April 2007.
[39]C. Yeo, B. Lee, and M. Er. A survey of application level multicast techniques. Computer Communications,27(15):1547-1568,2004.
[40]M. Hosseini, D. Ahmed, S. Shirmohammadi, and N. Georganas. A survey of application-layer multicast protocols. IEEE Communications Surveys and Tuto-riala,9(1-4):58-74,2007.
[41]Y. Chu, S. G. Rao, S. Seshan, and H. Zhang. A case for end system multicast. In Proceedings of ACM Sigmetrics, pages 1-12,2000.
[42]J. Jannotti, D. K. Gifford, K. L. Johnson, M. F. Kaashoek, and J. W. O'Toole Jr. Overcast:Reliable multicasting with an overlay network. In Proceedings of USENIX OSDI, pages 197-212,2000.
[43]D. Pendarakis, S. Shi, D. Verma, and M. Waldvogel. Almi:an application lev-el multicast infrastructure. In Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems (USITS), pages 49-60,2001.
[44]V. Roca and A. El-Sayed. A host-based multicast (hbm) solution for group communications. In Proceedings of International Conference on Networking, 2001.
[45]S. Zhuang, B. Zhao, A. Joseph, R. Katz, and J. Kubiatowicz. Bayeux:an ar-chitecture for scalable and fault-tolerant wide-area data dissemination. In Pro-ceedings of the 11th International workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV), pages 11-20,2001.
[46]S. Banerjee, B. Bhattacharjee, and C. Kommareddy. Scalable application layer multicast. In Proceedings of SIGCOMM'02, pages 205-217,2002.
[47]D. Tran, K. Hua, and T. Do. Zigzag:An efficient peer-to-peer scheme for media streaming. In Proceedings of IEEE INFOCOM,2003.
[48]V. N. Padmanabhan, H. J. Wang, P. A. Chou, and K. Sripanidkulchai. Distribut-ing streaming media content using cooperative networking. In Proceedings of ACM NOSSDAV,2002.
[49]M. Castro, P. Druschel, A. Kermarrec, A. Nandi, A. Rowstron, and A. Singh. Splitstream:high-bandwidth multicast in cooperative environments. In Pro-ceedings of the 19th ACM Symposium on Operating Systems Principles (SOSP), pages 298-313,2003.
[50]V. K. Goyal. Multiple description coding:Compression meets the network. IEEE Signall Processing Magazine,18(5):74-93,2001.
[51]M. Castro, P. Druschel, A. Kermarrec, and A. Rowstron. Scribe:A large-scale and decentralized application-level multicast infrastructure. IEEE Journal of Selected Areas in Communication,2002.
[52]V. Pai, K. Kumar, K. Tamilmani, V. Sambamurthy, and A. Mohr. Chainsaw: Eliminating trees from overlay multicast. In Proceedings of IPTPS,2005.
[53]M. Zhang, J. Luo, L. Zhao, and S. Yang. A peer-to-peer network for live media streaming using a push-pull approach. In Proceedings of the 13th ACM interna-tional conference on Multimedia, pages 287-290,2005.
[54]X. Liao, H. Jin, Y. Liu, L. M. Ni, and D. Deng. Anysee:Peer-to-peer live streaming. In Proceedings of the 25th IEEE INFOCOM, April 2006.
[55]N. Magharei and R. Rejaie. Prime:Peer-to-peer receiver-driven mesh-based streaming. In Proceedings of the 26th IEEE INFOCOM, May 2007.
[56]N. Magharei, R. Rejaie, and Y. Guo. Mesh or multiple-tree:A comparative study of p2p live streaming services. In Proceedings of IEEE INFOCOM,2007.
[57]A. Kermarrec, L. Massoulie, and A. Ganesh. Probabilistic reliable dissemination in large-scale systems. IEEE Transactions on Parallel and Distributed Systems, 14(3):248-258,2003.
[58]A. Ganesh, A. Kermarrec, and L. Massoulie. Peer-to-peer membership manage-ment for gossip-based protocols. IEEE Transactions on Computers,2003.
[59]Y. Guo, K. Suh, J. Kurose, and D. Towsley. P2cast:peer-to-peer patching scheme for vod service. In Proceedings of WWW 03, pages 301-309,2003.
[60]S. Sheu, K. A. Hua, and W. Tavanapong. Chaining:A generalized batching technique for video-on-demand. In ICMCS, pages 110-117,1997.
[61]Tai T. Do, K. A. Hua, and M. Tantaoui. "p2vod:Providing fault tolerant video-on-demand streaming in peer-to-peer environment. In Proceedings of the IEEE International Conference on Communications, June 2004.
[62]B. Liu, Y. Cui, B. Chang, B. Gotow, and Y. Xue. Bittube:case study of a web-based peer-assisted video on demand system. In Proceedings of Tenth IEEE International Symposium on Multimedia, pages 242-249,2008.
[63]C. Dana, D. Li, D. Harrison, and C. Chuah. Bass:Bittorrent assisted streaming system for video-on-demand. In Proceedings of 2005 IEEE 7th Workshop on Multimedia Signal Processing, pages 1-4,2005.
[64]A. Vlavianos, M. Iliiofotou, and M. Faloutsos. Bitos:Enhancing bittorrent for supporting streaming applications. In Proceedings of INFOCOM 2006, pages 1-6,2006.
[65]D. Erman, K. De Vogeleer, and A. Popescu. On piece selection for streaming bittorrent. In Proceedings of Fifth Swedish National Computer Networking Wor-shop (SNCNW2008),2008.
[66]P. Shah and J.F. Paris. Peer-to-peer multimedia streaming using bittorrent. In Proceedings of IEEE International Performance, Computing, and Communica-tions Conference, pages 340-347,2007.
[67]N. Carlsson and D. L. Eager. Peer-assisted on-demand streaming of stored media using bittorrent-like protocols. In Proceedings of Networking'07, pages 570-581,2007.
[68]Y. Guo, S. Mathur, K. Ramaswamy, S. Yu, and B. Patel. Ponder:Performance aware p2p video-on-demand service. In Proceedings of GLOBECOM, pages 225-230,2007.
[69]X. Yang, M. Gjoka, P. Chhabra, A. Markopoulou, and P. Rodriguez. Kangaroo: video seeking in p2p systems. In Proceedings of IPTPS, page 6. USENIX,2009.
[70]Y. Guo, K. Suh, J. Kurose, and D. Towsley. A peer-to-peer on-demand streaming service and its performance evaluation. In Proceedings of the IEEE International Conference on Multimedia and Expo, July 2003.
[71]Y. Guo, K. Suh, J. Kurose, and D. F. Towsley. Directstream:A directory-based peer-to-peer video streaming service. Computer Communications, pages 520-536,2008.
[72]M. Hefeeda, A. Habib, B. Botev, D. Xu, and B. K. Bhargava. Promise:peer-to-peer media streaming using collectcast. In Proceedings of ACM Multimedia'03, pages 45-54,2003.
[73]Z. Yin and H. Jin. DHT based collaborative multimedia streaming and caching service. In Proceedings of TENCON,2005.
[74]N. Vratonjic, P. Gupta, N. Knezevic, D. Kostic, and A. Rowstron. Enabling dvd-like features in p2p video-on-demand systems. In Proceedings of 2007 Workshop on Peer-to-Peer Streaming and IP-TV (P2P-TV'07), pages 329-334,2007.
[75]W. K. Yiu, Xing Jin, and S. G. Chan. Vmesh:Distributed segment storage for peer-to-peer interactive video streaming. IEEE Journal on Selected Areas in Communications,25(9):1717-1731, Dec 2007.
[76]H. Zhang, A. Goel, and R. Govindan. Improving lookup latency in distributed hash table systems using random sampling. IEEE/ACM Transactions on Net-working (TON),13(5):1121-1134, Oct 2005.
[77]D. Wang and C. K. Yeo. Superchunk-based efficient search in p2p-vod system. IEEE TRANSACTIONS ON MULTIMEDIA,13(2), April 2011.
[78]Y. Cui, B. Li, and K. Nahrstedt. ostream:Asynchronous streaming multicast in application layer overlay networks. IEEE JSAC,22:91-106, Jan 2004.
[79]J. Liu and M. Zhou. Tree-assisted gossiping for overlay video distribution. Mul-timedia Tools and Applications,29(3):211-232,2006.
[80]H. Chi, Q. Zhang, J. Jia, and X. Shen. Efficient search and scheduling in p2p-based media-on-demand streaming service. IEEE Journal on Selected Areas in Communications,25(1):119-130, Jan 2007.
[81]D.Wang and J. Liu. A dynamic skip list-based overlay for on-demand media streaming with vcr interactions. IEEE Transactions on Parallel and Distributed Systems,19(4):503-514,2008.
[82]W. Pugh. Skip lists:a probabilistic alternative to balanced trees. Communica-tions of the ACM,33(6):668-676,1990.
[83]S. Annapureddy, S. Guha, C. Gkantsidis, D. Gunawardena, and P. Rodriguez. Is high-quality vod feasible using p2p swarming? In Proceedings of WWW'07, pages 903-912,2007.
[84]Y. Zhou, D. M. Chiu, and J. C. S. Lui. A simple model for analyzing p2p streaming protocols. In Proceedings of IEEE International Conference on In Network Protocols, pages 226-235, Oct 2007.
[85]J. A. Pouwelse, P. Garbacki, D. H. J. Epema, and H. J. Sips. The bittorrent p2p file-sharing system:Measurements and analysis. In Proceedings of IPTPS'05, pages 205-216,2005.
[86]B. Fan, D. G. Andersen, M. Kaminsky, and K. Papagiannaki. Balancing through-put, robustness, and in-order delivery in p2p vod. In Proceedings of CoNEXT, 2010.
[87]J. Chen, X. Du, W. Cheng, and J. Xu. Providing efficient p2p vod service with priority based scheduling. In Proceedings of 6th International Conference on Wireless Communications Networking and Mobile Computing (WiCOM), Sep 2010.
[88]Y. Yang, A. L. H. Chow, L. Golubchik, and D. Bragg. Improving qos in bittorrent-like vod systems. In INFOCOM'10, pages 2061-2069,2010.
[89]U. Abbasi, G. Simo, and T. Ahmed. Differentiated chunk scheduling for p2p video-on-demand system. In Proceedings of 2011 IEEE Consumer Communi-cations and Networking Conference (CCNC), pages 622-626, Jan 2011.
[90]Y. Guo, C. Liang,, and Y. Liu. Aqcs:Adaptive queue-based chunk scheduling for p2p live streaming. In Proceedings of of IFIP Networking,2008.
[91]S. Liu, M. Chen, S. Sengupta, M. Chiang, J. Li, and P. Chou. P2p streaming capacity under node degree bound. In Proceedings of IEEE ICDCS'10, Jun 2010.
[92]TuDou. http://www.tudou.com.
[93]C. Wu, B. Li, and S. Zhao. Continustreaming:Achieving high playback conti-nuity of gossip-based peer-to-peer streaming. In Proceedings of IPDPS 2008, 2008.
[94]M. Jain and C. Dovrolis. End-to-end available bandwidth:measuremen-t methodology, dynamics, and relation with tcp throughput. In Proceedings of ACM SIGCOMM 2002, Aug 2002.
[95]R. Ahlswede, N. Cai, S. R. Li, and R. W. Yeung. Network information flow. IEEE Transactions on Information Theory, pages 1204-1216,2000.
[96]C. Wu and B. Li. rstream:Resilient and optimal peer-to-peer streaming with rateless codes. IEEE Transactions on Parallel and Distributed Systems, pages 77-92,2008.
[97]C. Gkantsidis and P. Rodriguez. Network coding for large scale content distri-bution. In INFOCOM'05, pages 2235-2245,2005.
[98]M. Wang and B. Li. Network coding in live peer-to-peer streaming. IEEE Transactions on Multimedia, pages 1554-1567,2007.
[99]J. Aspnes and G. Shah. Skip graphs. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'03), Jan 2003.
[100]J. Wu and B. Li. Keep cache replacement simple in peer-assisted vod systems. In Proceedings of IEEE Infocom 2009,2009.
[101]C. Zheng, G. Shen, and S. Li. Distributed prefetching scheme for random seek support in peer-to-peer streaming applications. In Proceedings of the ACM Workshop on Advances in Peer-to-Peer Multimedia Streaming(P2PMMS'05), Nov 2005.
[102]M. Wang, L. Xu, and B. Ramamurthy. Providing statistically guaranteed stream-ing quality for peer-to-peer live streaming. In Proceedings of NOSSDAV'09, 2009.
[103]Z. Liu, C. Wu, B. Li, and S. Zhao. Distilling superior peers in large-scale p2p streaming systems. In Proceedings of INFOCOM'09, April 2009.
[104]N. Parvez, C. Williamson, A. Mahanti, and N. Carlsson. Analysis of bittorrent-like protocols for on-demand stored media streaming. In SIGMETRICS'08, 2008.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |