一种推拉结合的P2P流媒体数据传输调度算法

主要研究P2P流媒体系统的数据传输调度策略对播放延迟的影响,通过分析CoolStreaming模型的单一拉策略和Gridmedia模型的推拉结合策略,指出它们在播放延迟方面的不足,从而提出了一种推拉结合的数据传输策略:在推传输模式下的数据分配策略对节点的播放延迟起到关键作用,给出一个Least-Delay数据分配算法使得接收节点的播放延迟接近最小值,并通过模拟实验验证了该算法的有效性。     

基于宽带城域网的P2P流媒体直播模型与方法

为了解决现行P2P直播系统存在启动延时长、画面质量差的问题,提出了一种基于分布式树状拓扑结构的模型架构及其实现方法。该模型由服务器组、超级节点组和普通节点组共同组成分布式P2P流媒体分发网络,通过采用非平衡的MDC编码方案和动态的普通节点服务请求策略,有效解决了启动延时过长的问题;通过优化节点缓冲区的基本结构,并采用推拉结合的缓冲区调度策略,大大提高了网络的分发效率,有效解决了节点播放不畅的问题。实验证明,与现行直播系统相比,该模型具有更短的播放启动延时和更好的播放体验。     

一种基于拥塞发现的强化学习P2P网络视频点播预取策略

在P2P(Peer to Peer)网络视频点播中设计合理的视频内容预取策略,可以有效地解决视频观看中出现的缓冲等待时间过长、服务器负载过大等问题。而现有的P2P网络视频预取方法往往考虑了视频内容的发现而忽略了节点本身的状态监控,在网络拥塞发生时存在视频播放观看不佳的情况。提出了一种基于拥塞发现的强化学习P2P网络视频点播预取策略,通过监测节点的拥塞状况以及带宽等参数,采用Q-learning学习算法综合评估网络节点,引导视频预取节点的选择,减少了对网络拥塞节点视频内容的预取。实验结果表明,该方法能提高视频播放流畅性,避免用户在节点发生拥塞时等待时间过长,提高了视频播放效率。     

基于Donet的P2P流媒体直播优化调度算法

为了提高P2P流媒体系统的整体性能,改善节点的播放质量,针对现有调度算法启动延迟大和节点带宽利用率不高问题,提出了一种可动态调节各节点中待请求紧急数据的流媒体直播优化调度算法(LOSA).该算法不仅考虑了流媒体直播的时间特性,同时还考虑了如何减少紧急数据请求的等待时间以及对Peer节点上传带宽的充分利用.实验结果表明,LOSA算法缩短了终端用户观看视频的延迟,提高了媒体流的连续性.     

P2P视频直播数据调度算法

P2P技术解决了传统流媒体应用中的不能支持大用户的问题.而数据调度算法一直是P2P研究中的热点问题.在给出了P2P视频直播系统中节点能力的定义和计算方法后,结合BT中的Rarest First策略,提出了一种基于节点能力的适用于P2P视频直播系统的数据调度算法.该算法既考虑了流媒体数据具有时间限制的特性,同时也考虑了如何能充分的利用节点的上传带宽,增进了系统的负载平衡.     

一种媒体直播的P2P自适应网络快速传输模型磁

为解决媒体流在网络直播的低延迟与可扩展性,结合P2P的特点,研究了一种基于P2P的自适应网络快速传输模型。该模型首先对网络节点状态进行分类,通过一种位索引机制实现节点状态的识别,接着在MST 覆盖网络基础上,探讨了一种面向请求节点构建MST的P2P媒体直播系统,并提出了一种自适应网络快速传输控制算法。数学模型分析与模拟结果表明提出的模型能较大程度地缩短端到端传播的延迟时间,且减少跳点数与服务负载,从而进一步提升了媒体播放的流畅性,为采用P2 P技术实现媒体的快速直播提供了很好的参考与借鉴。     

P2P VoD中基于视频片段关联性的节点自组织策略

视频点播系统中的节点可以在任意时刻选择任意视频并进行拖放等交互式操作,在这一操作过程中会产生播放延迟,影响用户观看满意度,为保证播放流畅性以提高用户满意度,节点需要快速响应该行为产生的查找目的片段请求,在P2P VoD中有效的节点组织策略是实现节点快速定位目的节点的关键.所提策略利用视频片段关联性这一特点,不去具体挖掘各个片段之间关联性强度,使有相似兴趣爱好的节点自组织在一起以实现快速查找目的片段;对该策略引出的节点邻居优化问题,给出近似优化算法.仿真对比实验表明了该策略在降低跳播观看时延和提高系统可扩展性上的有效性.     

一种用于P2P流媒体系统的动态树-网状网混合覆盖网络

应用层覆盖网络是因特网P2P流媒体系统的主要组成和有效解决方案,它的构建直接影响到系统的视频传输质量.目前的覆盖网络主要有树形(tree)和网状网结构(mesh),但是这两种结构的覆盖网络都有其自身固有的缺点:树形结构对节点动态性的容忍能力差,丢包累积,网状网结构数据包传输延时较大.本文结合两种覆盖网络的优点.利用网状网动态分配数据包的思想,动态分配描述流,提出一种用于P2P流媒体系统的动态树-网状网混合覆盖网络.仿真和分析表明.本覆盖网络有效地克服了树形结构丢包累积和网状网结构数据包传输延时大的缺点,能够自适应节点动态性和网络带宽的波动,降低丢包率,减小传输延时.     

一种实时纠错的P2P模式网络立体电视播放系统

随着宽带网络飞速发展,网络立体电视将成为未来视频主流业务.提出一种实时纠错的P2P模式网络立体电视播放系统的解决方案,该方案利用P2P技术进行视频传输,利用LDPC码进行纠错.经实验证明,在高斯噪声下,纠错后的立体视频与未纠错的相比,PSNR值平均提高约15dB.通过在CERNET2网络中测试,系统充分保证了立体视频的正常观看,同时系统配备认证功能,并且兼容IPv4和IPv6网络环境,能够为未来网络立体电视产业化发展提供有力支持.     

基于网络编码的P2P流媒体直播系统研究

针对目前存在的P2P流媒体直播系统不能充分利用网络资源的问题,提出了一种基于网络编码的P2P流媒体直播方案。该方案充分利用了Peer节点的计算能力,即在对媒体数据进行存储转发前先进行网络编码,以提高数据块的下载速率以及节省网络带宽资源。实验结果表明,在同等网络状况下,利用了网络编码后节点的播放质量有了明显的改善,尤其是在网络状况不好的情况下改善更为明显。     

一种基于P2P的短视频分享系统

现有在线短视频分享策略通常采用C/S架构,给视频服务器带来较大的带宽压力。为此,提出一种采用点对点方式的在线短视频分享系统IShare,该系统结合用户点播偏好和视频文件之间的社会网络特性实现视频分享。IShare主要包括基于点播兴趣的节点分簇和视频数据源节点的查找2个核心技术。实验结果表明,IShare具备较好的视频数据源节点查找能力,可降低视频服务器带宽资源消耗。     

一种分层P2 P流媒体系统重叠网的构建策略

基于Peer-to-Peer(P2P)技术的流媒体应用具有部署效率高及可扩展性好等突出优势。而采用分层视频编码技术的P2P流媒体系统把原视频流分解为多个视频层数据进行分发,让节点能够选择与自己带宽资源相匹配的视频质量,使其很好地适应节点的异构性。但是各分层视频数据传输的路径存在较大差异,使重叠网构建策略面临更大的挑战。因此定义了基于分层视频编码技术环境下的P2P流媒体重叠网络构建问题,并证明该问题是一个NP难问题。提出了一种构建重叠网的集中启发式算法,同时还提出了一种基于视频组(Streaming Group)的分布式重叠网络构建策略。通过大规模网络仿真实验验证了基于该分布式重叠网构建策略的分层流媒体系统具备低服务器带宽占用、高数据获取率等优点。     

Diverse community: Demand differentiation in P2P live streaming

Peer-to-Peer (P2P) technology has become an attractive approach for enabling large-scale video streaming applications, but the factor of users’ subjective preferences is not paid enough attention in such networks. As users have various demand on video qualities, we can provide them with video streams at different resolutions without impairing their satisfaction. The adaptive streaming rate technique is a promising method. However, in providing adaptive streaming rate services, P2P live streaming design faces the following challenge: how to provide all users with uninterrupted video with their desired qualities in case that their demand dynamically changes? To shed more light on this problem, we first derive a model and formulate the problem as a resource demand vs supply problem. Then we present a framework to address the challenge via efficient bandwidth allocation and group cooperation. Through comprehensive simulations, we evaluate the effectiveness of the proposed framework, and conclude that it effectively helps existing solutions, such as Partial Participation Scheme (PPS), achieve better performance.     

An efficient hybrid push-pull methodology for peer-to-peer video live streaming system on mobile broadcasting social media

With the rapid growth of wireless communication technology, the availability of highly flexible and video-friendly mobile terminal platforms (such as smartphones and tablets), the emergence of major video content providers (like YouTube, Ustream, and PPTV, which provide a large catalog of attractive contents), Peer-to-Peer (P2P) live video streaming over the wireless and Internet is becoming more and more attractive to users. One of the main challenges is to provide a good quality of service though the dynamic behavior of the network. Traditionally, tree-based model uses a push method, that broadcaster transfers data to other users. This model has low start-up delay. However, there are two main problems in this method: if the bandwidth of an internal node is low, children nodes may lose data and when an internal node failure, other nodes can’t receive data until completing the recovery of the tree. On the other hand, mesh-based model uses a pull method, has low bandwidth of a neighbor node by pulling necessary data from a number of neighbor nodes. However, mesh-based model requires large buffers to support pull data from neighbor peers and there is an adjustment between minimum delay by sending pull request and overhead of whole system. So, both models have their own strengths and weaknesses. This paper proposes a new hybrid push-pull live P2P video streaming protocol called MobileCast that combines the benefits of pull and push mechanisms for live video delivery. We present new topology for P2P network with more stable and provide better video streaming quality. Our main goal is to minimize the network end-to-end delay, startup time, overhead, packet loss compared to the pure mesh networks, pure tree networks and provide a good quality of service though the dynamic behavior of the network.

     

Adaptive,incentive and scalable dynamic tree overlay for P2P live video streaming

In this paper, we propose a new multicast tree framework to be used in peer-to-peer (P2P) live video streaming systems. The proposed system, adapts the tree links under high peer churn and runs in a totally distributed manner. In order to provide this dynamism and seamless streaming at the same time, we propose a cross layer design involving scalable video codec, backup parents and hierarchical clusters. The performance of the system is measured in real world environment PlanetLab that has nodes distributed all over the world. The experiments show that the proposed system provides high quality of experience (QoE) in terms of Peak Signal to Noise Ratio (PSNR), playback delay and duration of pauses. The proposed system also provides incentive mechanism to its users.     

An efficient scheduling algorithm for scalable video streaming over P2P networks

During recent years, the Internet has witnessed rapid advancement in peer-to-peer (P2P) media streaming. In these applications, an important issue has been the block scheduling problem, which deals with how each node requests the media data blocks from its neighbors. In most streaming systems, peers are likely to have heterogeneous upload/download bandwidths, leading to the fact that different peers probably perceive different streaming quality. Layered (or scalable) streaming in P2P networks has recently been proposed to address the heterogeneity of the network environment. In this paper, we propose a novel block scheduling scheme that is aimed to address the P2P layered video streaming. We define a soft priority function for each block to be requested by a node in accordance with the block’s significance for video playback. The priority function is unique in that it strikes good balance between different factors, which makes the priority of a block well represent the relative importance of the block over a wide variation of block size between different layers. The block scheduling problem is then transformed to an optimization problem that maximizes the priority sum of the delivered video blocks. We develop both centralized and distributed scheduling algorithms for the problem. Simulation of two popular scalability types has been conducted to evaluate the performance of the algorithms. The simulation results show that the proposed algorithm is effective in terms of bandwidth utilization and video quality.     

P2P流媒体服务方案及其关键技术研究

根据近年来P2P流媒体服务方案的研究成果,归纳并总结P2P流媒体的关键技术,包括覆盖网络构建技术、数据调度技术以及各种优化技术。由此可知,P2P流媒体是一种性价比高、扩展性好的流媒体服务体系,并指出P2P流媒体可进一步的研究方向为P2P流媒体的应用与测量、理论分析与建模、体系架构以及与视频编码、移动网络技术的结合等。     

移动对等直播流媒体系统的服务质量保证机制研究

随着移动网络及移动智能终端的发展和日益普及,移动对等(P2P)网络流媒体方面的研究已成为当前的热点。然而,P2P流媒体的移动化面临两大问题,一是流媒体的差异化服务,二是终端移动过程中的服务质量保证。针对终端的差异性,本文提出了自适应多码率服务的思想,在一个P2P节目流拓扑中,发布多个子流,用户根据自己的网络状况和能力,缓冲全部或者部分子流,并根据网络环境的变化,动态地改变自身缓冲和播放的流,为邻居节点提供差异化的服务;同时提出了一种跨域移动服务质量保证机制,包括数据预缓存、数据暂存等策略。实验证明上述方法能有效提高移动对等直播流媒体系统的服务质量。     

一种基于P2P的视频点播系统设计

在计算机发展领域中,目前有一项新兴的技术———视频点播技术(VOD),它是一种根据观众的要求播放节目的系统,随时提供交互式视频服务,主要用于实现多用户对网络多媒体文件的共享播放。文中将P2P与Internet上重要的媒体传输技术———流媒体技术相结合提出了一个基于P2P的视频点播系统的具体设计与实现方案,讨论了系统设计和实现过程中采用的相关技术与方法,采用点组技术,重点提出了一种新的发现机制。