一种基于P2P VOD的视频共享系统的研究与实现
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
流媒体应用是推动未来宽带应用的主动力,但流媒体对带宽的高占用特性使其在Internet上大规模应用面临诸多困难。传统的C/S、单源组播以及CDN(Content Delivery Network)模式面临着网络带宽、拥塞控制和费用等问题。为了更好的解决流媒体在互联网的分发问题,基于P2P的流媒体分发技术被提出来了。P2P,即端对端网络,又称为对等计算,就是通信的主机互相互为服务器,每一台主机都享受其它机器提供的服务,也为别的机器提供服务。这一模式将服务由中心推向了边缘,充分利用了网络边缘的主机的资源。P2P网络的应用很广泛,模型也很多,有各自的优缺点。
     本文介绍了一个P2P流媒体系统P2P VOD,实现了用P2P网络进行大规模流媒体共享同步播放。本文针对P2P流媒体系统需要解决的一些关键问题:单源传输与多源传输、媒体源定位机制、源节点选择机制、数据传送调度机制、激励机制这几个方面进行了讨论,介绍了P2P VOD的解决方法。P2P VOD采用有一个中心目录服务器的结构,数据传输通过P2P的方式进行。P2P VOD采用了多源传输的模式,基于AS值的源节点选择机制,播放顺序优先的数据调度的机制,基于“报答”的激励机制,保证了流媒体数据的传输和播放质量。
     P2P VOD视频共享系统主要是基于BT协议来进行扩充,并针对流媒体的播放特点:在片段选择算法上对实时性和顺序性进行了更高的要求;考虑了多种阻塞机制来鼓励系统内的Peer节点参与到文件共享中来;提出了一个简单快捷的路由算法来避免消息的泛滥以及保证播放控制协议的快速传递;利用了用户的ID编号来进行同一局域网节点协作以及防火墙穿透技术来保证更多的Peer节点参与到整个系统中来。此外,P2P VOD系统还在BT协议的基础上添加了文件播放控制扩展协议,除了能够保证系统中的所有Peer节点用户尽可能地同步观看影视资源;还能够兼容传统的BT协议,这样可以保证系统除了可以利用自己的网络外还可以同时利用现有的广泛运用的BT网络。
Streaming Media will become the main driving force for future broadband network application. But the characteristics of high bandwidth of the streaming media on the Internet are faced with many difficulties. The traditional C/S, single-source multicast and CDN (Content Delivery Network) model are facing network bandwidth, congestion control and cost issues. To better solve the problems of the streaming media used in the Internet distribution, the streaming media over P2P network technology has been proposed. P2P, that is, peer-to-peer network, also known as end to end computing, means that the hosts provide service for each other as the server. Every host enjoy the services provided by the other host, but also provide services for the others. This model will push the service from center to the edge of the network and it can make full use of the resources provide by the host in the edge of the network. P2P network has a wide range of use, and has many models. Each model has its character.
     This paper discusses a P2P streaming media system named P2P VOD system. It can achieve a large-scale streaming media share and play the media synchronization in the P2P networks. This paper discussed the key problems of the P2P streaming media system: single-source or multi-source transmission, media sources positioning mechanism, the source node selection mechanism, data transmission scheduling mechanism, incentive mechanisms in these areas were discussed, and it also introduced the solution of the P2P VOD system. P2P VOD using a central server directory server, data transmission through P2P network. P2P VOD adopted the multi-source transmission model, choose the peers based on the value of the source node AS selection mechanism, picked the file index with the high priority of data sequence mechanism, the incentive mechanism based on the "play back" method. All of these methods are used to ensure the streaming data transmission and the play quality.
     P2P VOD video sharing system is mainly used the BT protocol to expand. It also makes some improvement after considering the features of the streaming media. It adopts a higher demand of the real-time and order in the fragment chosen algorithm. It encourages all peers in the networks to share their file by using a variety of blocking mechanism. It proposes a simple and efficient routing algorithm to the flood spread of the message and to ensure that the control protocol can be rapidly broadcast by the peers. It makes use of the user's ID number for the better collaboration in the same local network and uses the technology of transmitting through the firewall to ensure more participation join in the whole system.
     In addition, the P2P VOD system add a player control expansion protocol based on the BT protocol. It not only let all users in the system watch movies synchronization, but also compatible with the traditional BT protocol. It can let the P2P VOD system run in both its own special networks and the traditional BT networks.
引文
[1] Mohamed M. Hefeeda, Bharat K. Bhargava, Purdue University. On-Demand Media Streaming Over the Internet. The Ninth IEEE workshop on Future Trends of Distributed Computing Systems(FTDCS'03). May 28-30, 2003. San Juan, Puerto Rico. p.279.
    [2] D. Xu, M. Hefeeda, S. Hambrusch, and B. Bhargava, On peer-to-peer media streaming, in Proc. ICDCS’02, Wien, Austria, Jul. 2002.
    [3] Napster.http://www.napster.com.
    [4] Gnutella.http://gnutella.wego.com.
    [5] Freenet.http://www.freenet.sourceforge.com.
    [6] Openext. http://www.openext.com.
    [7] Kugoo . http://www.kugou.com/
    [8] POCO. http://www.poco.cn/
    [9] Jon Stoica, Robert Morris, David Karger, M.Frans Kaashoek, Hari Balakrishnan, Chord A Scalable Peer-to-peer Lookup Service for Internet Applications. In Proceeding of ACM SIGCOMM 2001, San Diego, California, USA.
    [10] Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker. A Scalable Content-Addressable Network. In Proceedings of ACM SIGCOMM 2001, San Diego, California, USA.
    [11] A. Rowstron and P. Druschel. Pastry: Scalable Distributed Object Location and Routing for large-Scale Peer-to-Peer Systems. Proceedings of IFIP/ACM Middleware 2001, Nov. 2001.
    [12] K.Hildrum, J.D. Kubiatowicz, S. Rao, and B.Y. Zhao. Distributed object location in a dynamic network. In Porc. 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA 2002), pages 41-52, 2002.
    [13] Deshpande H, Bawa M, and Garcia-Molina H, streaming live media over a peer-to-peer network. In Work at CS-Stanford. Submitted for publication, 2002.
    [14] Collaborative information sharing project. http://www.cs.purdue.edu/homes /bb/p2p
    [15] Banerjee S, Bhattacharjee B, Kommareddy C, and Varghese G. Scalable applicationlayer multicast, In Proc Of ACM SIGCOMM'02. pages 205-220, Pittsburgh, PA, USA, August 2002.
    [16] Tran D, Hua K, and Do T. Zigzag: an efficient peer-to-peer scheme for media streaming. In Proc of IEEE INFOCOM'03, San Francisco, CA, USA, April 2003, IEEE.
    [17] Jack Lee Y B and Leng W T, Study of a Server-less Architecture for Video-on-Demand Applications, Proc IEEE International Conference on Multimedia and Expo. pages 233-236, Lausanne, Switzeland, 26-29 August 2002.
    [18] Padmanabhan V N, Wang H J, Chou P A, and Sripanidkulchai K. distributing streaming media content using cooperative networking. In ACM/IEEE NOSSDAV, Miami, FL, USA, May 12-14 2002.
    [19] VTRails. http://www.vtrails.com.
    [20] AllCast. http://www.allcast.com
    [21]欧建平,娄生强.网络与多媒体通信技术[M].北京:人民邮电出版社, 2002:1-20.
    [22] Wang.Y and Zhu.Q.F. Error control and cancealment for video communication:A review.Porc.IEEE,vol.86,pp.974-997,May 1998
    [23] PSchulzrinne.H,Canser.S,Frederick.R etal. A Transport Protocol for Real-Time Applications. Internet Engineering Task Force, RFC 1889,Jan,1996
    [24] PSchulzrinne.H,Rao.A,Frederick.R. Real Time Streaming Protocol(RSTP). Internet Engineering Task Force, RFC 2326,Apr.1998
    [25] Schulzrinne.H, Casner.S, Frederick.R etal. RTP: A Transport Protocol for Real-Time Applications. Internet Engineering Task Force, RFC 1889, Jan. 1996
    [26] Schulzrinne.H, rao.A, and Lanphier.R. Real Time Streaming Protocol(RTSP). Internet Engineering Task Force, RFC 2326, Apr. 1998.
    [27]罗杰文.Peer to Peer综述. http://www.intsci.ac.cn/users/luojw/papers/ review.htm. 2005
    [28]侯自强.P2P IPTV技术进展.中兴通讯技术. 2006年6月第12卷第3期.
    [29] PPLive. http://www.pplive.com.
    [30] PPStream. http://www.ppstream.com.
    [31] Groove - Peer-to-Peer Online Collaboration Killer App. http://www.groove.net.
    [32] BASETSA, SCHRULZRINNE H. An analysis of the skype peer-to-peer Internet telephony protocol [C]//Proceedings of 25th IEEE International Conference on Computer Communications, Apr 23-29, 2006 ,Barcelona, Spain. Piscataway, NJ,USA:IEEE,2006:1-11.
    [33] Skype conferencing white paper by PowerModeling: http://www. powermodeling. com/files/whitepapers/Conference%20Test%20feb%2009.pdf
    [34] W.T. Sullivan. A New Major SETI Project Based on Project Serendip Data and 100000 Personal Computers. Proc. of the Fifth Intl. Conf. on Radioastronomy. 1997.
    [35] SETI@home. http://www.pointera.com.
    [36] N Leibowitz M Ripeanu,A Wierzbicki, Internet Applications. WIAPP 2003. Proceedings. The Third. 2003
    [37] A fiat, J saia. Censorship resistant peer-to-peer content addressable networks. Proceedings of the thirteenth annual ACM-SLAM symposium on Discrete algorithms. 2002:94-103
    [38] M Datar, "Butterflies and peer-to-peer networks," Technial Report, January 2002.http://dbpubs.stanford.edu:8090/pub/2005-2.2002
    [39] Yang and Garcia-Molina, Improving Search in Peer-to-Peer Networks, In Proc. of the 22nd International Conference on Distributed Computing Systems(ICIICS'02), June 2002, http://dbpubs.stanford.edu:8090/pub/2002-28
    [40] Q.Lv,P.Cao,E.cohen,K.Li and S.Shenker, Search and Replication in Unstructured Peer-to-Peer Networks, in Proc. Of the ACW ICS,2002, http://parapet.ee.princeton. edu/-sigm2002/papers/p258-lv.pd
    [41] BitTorrent. http://www.bittorrent.org.
    [42] Mohamed Hefeeda, Ahsan Habib, Boyan Botev, Dongyan Xu, Bharat Bhargava, PROMISE: Peer-to-Peer Media Streaming using CollectCast
    [43] Wu, D., Hou, Y.T., Li, B, Wenwu Zhu, etc. An end-to-end approach for optimal mode selection in Internet videocommunication: theory and application. Selected Areas in Communications, IEEE Journal on Volume 18, Issue 6, Jun 2000 Page(s):977 - 995
    [44] S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, Topologically aware overlay construction and server selection, in Proc. INFOCOM’02, New York, USA, Jun. 2002.
    [45] T.S.Eugene Ng and Hui Zhang, Predicting Internet Network Distance weigh Coordinates-Based Approaches.
    [46] BNBT. http://sourceforge.net/projects/bnbt.
    [47] Bram Cohen, Bittorrent Protocol Specification v1.0, http://wiki.theory.org/ BitTorrentSpecification
    [48]帕累托最优, http://wiki.mbalib.com/wiki/帕累托最优.
    [49] B. Ford, P. Srisuresh, D. Kegel. Peer-to-Peer communication across Middleboxes, http://midcom-p2p.sourceforge.net/draft-ford-midcom-p2p-00.txt
    [50]超级种子模式. http://www.cppblog.com/fwxjj/archive/2006/12/12/16307.html.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700