基于P2P网络模式VOD系统的数据传输新方法

随着计算机和网络技术发展，流媒体应用越来越受到关注。本文提出并实现了一种基于P2P网络模式的流媒体视频点播系统数据传输结构，这种新型的流媒体视频点播系统能够利用客户机的系统空间和网络资源进行视频的存储和传输。实验证明，该系统有效地降低了服务器的负荷，使服务器能够满足更多客户的点播请求，而降低了系统成本。     

P2P流媒体点播系统中的缓存管理方案的研究和实现

视频点播系统的缓存管理对系统的性能有重要的影响.回顾了现有的缓存策略,分析了P2P网络和传统中心服务器网络缓存策略的不同,然后提出一种适应P2P流媒体点播系统的缓存管理算法.给出了新型的算法描述,并构建原型系统进行性能对比测试.测试结果表明系统骨干节点的资源利用率和普通节点节目的播放质量和流畅性都得到了提高,证实了算法在P2P点播系统中的可行性和有效性.     

云辅助的P2P视频点播分发机制研究

提出一种新的流媒体分发混合网络模型P2Cloud,通过将云技术引入到P2P模式中,充分利用云技术的高可靠性、高存储及处理能力来协助P2P完成视频点播服务.针对P2Cloud模型的关键问题——视频片段的分布,引入数据片段有用值的概念,不但考虑到视频片段的流行度,同时考虑已加入节点的失效性,进而提出根据有用值来决定数据块向云平台的上传策略.并通过形式化的成本估算模型对P2Cloud点播应用成本进行量化,以指导点播服务提供商降低其部署成本.实验验证了提出的P2Cloud在用户满意度、带宽节约率及带宽消耗方面优于现有方案.     

基于同步会话管理机制的P2PVoD系统研究与设计

在视频点播系统中,由于用户节点的动态性和VCR操作的复杂性,使得资源的定位一直是P2P流媒体点播系统的难题.对典型的视频点播系统的关键技术进行了研究,在此基础上,设计了一种基于同步会话管理定位机制的P2P视频点播系统,加速了节点的资源定位,更有效地支持用户的VCR操作.仿真结果表明,与P2VoD系统相比,该系统减小了节点加入系统的延迟,降低了系统的通信负担.     

校园流媒体视频点播规划与实施

本文介绍了流媒体点播系统的研究意义,分析了流媒体及视频点播技术的原理、传输方式、流媒体格式;针对一般学院架构校园流媒体视频点播系统提出方案并简述了如何配置流媒体系统,实现网络点播。     

应用网络编码的P2P流媒体技术研究进展

P2P流媒体是一种极具潜力的流媒体内容分发技术。在P2P流媒体系统中采用网络编码,有利于进一步提升系统整体性能。针对目前流行的基于数据驱动覆盖网络的P2P流媒体系统框架,根据直播和点播这两种流媒体播送模式,深入讨论和分析了具有代表性的网络编码P2P流媒体技术方案的实现机制及其优缺点。最后,对该方向的研究趋势进行了展望。     

基于KAD网络的P2P流媒体点播系统节点路由算法的研究和改进

P2P流媒体的点播研究目前是个热点.在P2P Kademlia网架构分析的基础上,设计开发了一套基于KAD网络的P2P流媒体点播系统.首先描述了P2P Kademlia网络本身的路由与查找机制,之后提出了基于KAD网的P2P流媒体点播系统架构.然后重点描述了基于Kademlia网络的P2P流媒体的节点路由和查找改进算法,主要包括网络中P2P节点的加入机制、媒体资源发布机制、媒体资源的搜索和节点的离开机制等.通过对比实验,证明了本算法和方案支持P2P网络中的节点高效率的路由查找和维护,同时增强了P2P流媒体点播网络的健壮性和扩展性.最后展望了该领域的主要研究方向.     

基于P2P的校园点播系统设计与实现

讨论了在校园网中利用P2P技术构建校园点播平台,解决了校园网内部分流媒体点播需求,缓解了校园网总出口带宽的压力。     

基于BitTorrent的P2P VOD系统研究

在基于C/S结构的集中服务式的传统视频点播系统中,服务器和网络带宽都会成为瓶颈,不能满足用户的需求.文中以消除传统视频点播系统中的瓶颈为目标,在视频点播系统中引入P2P技术,基于开源的高效文件共享和下载软件BitTorrent,通过改进,设计了一种P2P视频点播系统.该系统采用了集中目录式P2P结构和基于分片机制的边下载边播放模式,引入并改进了多重滑动窗口模型,具有良好的响应特性.设计了一种先下载后观看的模式,该模式可在现有的网络条件下,提供非实时的高清影片点播业务.仿真实验结果表明文中的设计有效地解决了传统VOD系统的瓶颈问题.     

一种依赖社会网络的P2P视频点播推荐机制

提出一种新颖实用的视频推荐机制,用于缓解高质量P2P视频点播服务中存在的节点带宽饥饿现象.通过分析中国科技大学校园视频点播系统10个月的点播日志,发现视频在视频关联网络有聚簇的趋势,社会网络的现象明显.基于视频的社会网络特性,利用P2P视频点播系统已有的gossip协议,设计了一种新颖实用的基于社会网络的分布式视频推荐机制.利用gossip协议和视频之间的社会网络关系属性,此机制能够分布式的并且低代价的给饥饿节点推荐最优的视频.饥饿的节点通过接受推荐来避免继续陷入饥饿.实验表明该推荐机制能有效地缓解点播节点的带宽饥饿,提高P2P网络资源的利用效率.     

CircleSearch：流媒体VoD环境下的P2P搜索算法

在基于P2P的流媒体VoD环境下,搜索机制是影响服务质量的关键因素之一。该文提出一种新的基于环状网络的分布式自适应概率搜索算法——CircleSearch。它依据节点本体内容生成结构化的环状拓扑网络,保证算法的可扩展性、健壮性和分布性。自发组织基于本体距离和连接可靠性的small world覆盖网络,减小消息的转发次数,采用自适应搜索算法提高文件定位的准确性。仿真实验表明,CircleSearch以其高成功率、低服务器负载和很小的平均搜索长度实现媒体流传输的即时、稳定、可控和连续,为VoD服务提供QoS保证。     

采用分区缓存调度策略的P2P点播系统

针对在当前的P2P点播系统中,由于节目热度的差异导致数据副本分布不合理的问题,提出一个采用分区缓存调度策略的P2P流媒体点播系统设计方案。该策略将用户节点缓存区分为2个部分,分别考虑节点自身的需求和整个网络的全局需求进行调度,以优化节目数据在各节点间的分布,从而提高播放质量。通过仿真实验,验证了该系统设计与策略的有效性。     

Investigation of a large-scale P2P VoD overlay network by measurements

The proliferation of large-scale Peer-to-Peer (P2P) Video on Demand (VoD) overlays has created the demands to characterize and to understand the emergent properties of P2P VoD applications. In this paper, we investigate the P2P VoD overlay network, spanned by PPLive application, using active measurements. We have developed a piece of measurement software, named as VoDCrawler, to implement the experiment. Different from other existing work, our study focuses on the topology and the churn of the overlay networks. From the study, we have revealed the major features of the P2P VoD overlay networks and have compared them with those in P2P file sharing and live streaming systems. The discoveries we have obtained could help further investigation of the operation of the P2P VoD systems and favor the commercial developments of the P2P VoD applications.     

InstantLeap: an architecture for fast neighbor discovery in large-scale P2P VoD streaming

In large-scale peer-to-peer (P2P) video-on-demand (VoD) streaming applications, a fundamental challenge is to quickly locate new supplying peers whenever a VCR command is issued, in order to achieve smooth viewing experiences. For many existing commercial systems which use tracker servers for neighbor discovery, the increasing scale of P2P VoD systems has overloaded the dedicated servers to the point where they cannot accurately identify the suppliers with the desired content and bandwidth. To avoid overloading the servers and achieve instant neighbor discovery over the self-organizing P2P overlay, we design a novel method of organizing peers watching a video. The method features a light-weight indexing architecture to support efficient streaming and fast neighbor discovery at the same time. InstantLeap separates the neighbors at each peer into a streaming neighbor list and a shortcut neighbor list, for streaming and neighbor discovery respectively, which are maintained loosely but effectively based on random neighbor list exchanges. Our analysis shows that InstantLeap achieves an O(1) neighbor discovery efficiency upon any playback “leap” across the media stream in streaming overlays of any size, and low messaging costs for overlay maintenance upon peer join, departure, and VCR operations. We also verify our design with large-scale simulation studies of dynamic P2P VoD systems based on real-world settings.     

Measurement study on P2P streaming systems

Originally used as the default infrastructure for efficient file sharing, peer-to-peer (P2P) architecture achieved great successes. Now, the P2P model has been adopted for many other distributed applications, such as instant message and phone services, Internet gaming, and large-scale scientific computing. In recent years, P2P streaming systems experienced tremendous growth and became one of the largest bandwidth consumers on the Internet. Compared to standard file sharing systems, the streaming services show unique characteristics with more stringent time constraints and require much higher network bandwidth. It is extremely important to evaluate and analyze existing applications, and investigate the merits and weaknesses in these systems for future development. In this paper, we conduct a comprehensive measurement study on two of the most popular P2P streaming systems, namely, PPLive and PPStream. They are very popular P2P streaming applications, and serving millions of registered users with hundreds of live TV channels and millions of other video clips. In our measurement, we deploy our collectors in China, and both live TV and video-on-demand (VoD) channels are evaluated. We record run-time network traffic on the client side, compare and analyze the characteristics of these channels based on their popularity. For both categories, we perceive that, in general, the two measured P2P streaming systems provide satisfactory experience to the audiences for all channels regardless of popularity. However, the most of data are downloaded from the dedicated servers for unpopular channels. We also observe that live TV channels show better peer coordination than VoD channels. Beside the traffic, we have also collected cache replacement information for VoD channels, and these measurement results can help us understand the caching mechanism of P2P streaming systems. With the support of the cache, VoD channels perform better than their counterparts in the live TV category in terms of data transmission, workload distribution, and signal traffic overhead. Overall, our results reveal that although P2P streaming systems can usually provide excellent viewing experience for popular channels, there are still challenges to fully support unpopular channels. New designs and algorithms are in urgent need, especially for unpopular live TV channels.     

P2PVoD中基于束层的调度策略研究与设计

由于P2P环境的高度动态性和异构性,以及流媒体服务的高宽带和连续性强的特征,P2P点播系统中数据片断的调度便显得尤为重要。本文针对基于数据驱动的网状P2P点播系统提出了基于束层的调度策略,通过合理地分配紧急数据片断的调度和非紧急数据片断的调度以保证视频连续播放。模拟实验表明,该调度策略能够很好地保证视频的连续播放。     

Evaluation of a comprehensive P2P video-on-demand streaming system

Video-on-demand (VoD) streaming has recently become a popular service on the Internet, with several companies offering videos to a global audience. However, traditional client/server based VoD streaming systems can be very bandwidth intensive and expensive to maintain, especially for high quality video content. To improve the scalability these systems, the use of peer-to-peer (P2P) networking has been proposed, but despite the efficiency of applications such as BitTorrent for downloading of large files, it is not simple to use P2P techniques for streaming. Problems such as firewalls and freeloaders reduce the efficiency of both types of P2P systems, but for real-time services such as streaming, the result can be reduced playback quality. Other issues include the traffic load imposed on ISPs by P2P networks, which can motivate ISPs to interfere with the P2P traffic. Finally, protecting against malicious modification of content can increase overhead, response times, and startup delays.We consider these issues to be fundamental to the problem of P2P based VoD, but despite the large amount of research that has been done in this field, these issues have largely been ignored. To address this, we present an evaluation of the Streaming P2P Protocol (SPP) architecture. By studying the problem as a whole we have found a simple and comprehensive solution that addresses all the four issues listed above. To show that the system is not only scalable, but also that it can be implemented efficiently, we have used both simulations and experiments on PlanetLab for evaluation. The results show that the combination of cache nodes and use of end-user resources found in the SPP architecture can give a low load on servers and ISPs, even when firewalls are taken into consideration. Furthermore, we observed low startup delays and few playback errors during the PlanetLab experiments. The scalable and low-cost distribution of content possible with the SPP architecture should be suitable for both large-scale commercial distributors and users of community networks with limited resources.     

A Trace-Driven Approach to Evaluate the Scalability of P2P-Based Video-on-Demand Service

Peer-to-Peer (P2P) networks have emerged as one of the most promising approaches to improve the scalability of Video-on-Demand (VoD) service over Internet. However, despite a number of architectures and streaming protocols have been proposed in past years, there is few work to study the practical performance of P2P-based VoD service especially in consideration of real user behavior which actually has significant impact on system scalability. Therefore, in this paper, we first characterize the user behavior by analyzing a large amount of real traces from a popular VoD system supported by the biggest television station in China, cctv.com. Then we ex-amine the practical scalability of P2P-based VoD service through extensive trace-driven simula-tion under a general system framework. The results show that P2P networks scale well in provid-ing VoD service under real user behavior by obtaining a considerable good cache hit ratio. Moreover, it is observed that adopting hard cache at client side help achieves better system scal-ability than that with soft cache. We also identify the impact of various aspects of user behavior upon system scalability through detailed simulation. We believe that our study will shine insight-ful light on the understanding of practical scalability of P2P-based VoD service and be helpful to future system design and optimization.     

基于经济模型的分布式流媒体缓存策略

为提高基于P2P技术的流媒体点播系统的服务质量,提出一种基于经济模型的分布式流媒体缓存策略,采用分布式一致性算法计算视频分段的流行度,并根据内容流行度的高低给出相应的缓存置换策略。仿真实验结果表明,该策略可以有效降低服务器的负载以及启动延时,能够获得较好的性能。     

Measurement,modeling and enhancement of BitTorrent-based VoD system

BitTorrent is one of the most popular Peer-to-Peer (P2P) applications for file sharing over the Internet. Video files take up a large proportion of space among the BitTorrent shared files. Recently, BitTorrent has attracted researchers’ interests, as an alternative method of providing video on demand (VoD) service. In this paper, we concentrate on enabling BitTorrent to support VoD service in existing swarms while maintaining the download efficiency of file-sharing users. We first examine the content properties of the BitTorrent system to explore the demands and challenges of VoD service in BitTorrent swarms. The efficiency of BitTorrent for various piece selection policies is then compared through measurement on PlanetLab. We also use an optimization mathematical model to analyze the hybrid BitTorrent system in which downloading peers and streaming peers coexist. Both measurement results and model analysis indicate the problem of system efficiency decline in the BitTorrent-based VoD systems, in comparison with the original BitTorrent file-sharing system. Our proposed approach, unlike existing strategies that are limited to changing the piece selection policy to allow BitTorrent to support streaming services, modifies both piece and peer selection policies to provide a “streaming while downloading” service in the BitTorrent system with downloading peers. For the peer selection policy, a CAP (Closest-Ahead Peers) method is applied to make better use of the peers’ upload bandwidths. For the piece selection policy, a sliding window-based hybrid method that combines the rarest-first policy with the sequential policy is proposed. To demonstrate the performance of our proposed approach, an evaluation is made using various metrics on PlanetLab. The results show that our proposed method has higher throughput and better streaming continuity than the sequential policy and BiToS.