基于P2P技术的流媒体分发模型分析

点对点(P2P)流媒体通过在流媒体服务系统中引入P2P技术,在不增加成本的同时有效提升服务能力,并有效避免了P2P应用的诸多弊端,是当前网络条件下一种较理想的多媒体分发技术。文章将介绍主要的几种P2P流媒体分发模型,并对不同模型的优缺点进行比较讨论。     

P2P流媒体中的多发送端选择算法

 在多对单P2P流模式下,如何选择多个发送端,并为其最优地分配发送速率和数据是一个难题.为此,提出了一种新的多发送端选择和最优速率及数据分配算法(MSRDA).首先把待解决的问题模型化为线性最优化问题,然后给出了求解最优化问题的算法.不同于已有的算法只按链路的丢包率来选择发送端,MSRDA根据到各发送端链路的丢包率与链路的可用带宽比升序排序来选择多发送端,并最优地分配发送速率和数据.理论分析和仿真实验结果表明:在不同的网络条件下MSRDA能有效地减少聚合带宽的丢包率,并具有自适应性,优于现有同类算法.     

P2P网络流媒体关键技术

P2P网络流媒体技术一直是学术界和产业界的研究热点.本文围绕覆盖网络拓扑结构,对现有的P2P流媒体系统作了全面的归类总结,深入介绍和分析了覆盖网络构建、数据块调度策略等P2P流媒体核心技术,并概要讨论视频编码、网络编码、覆盖网络拓扑优化、安全与激励机制等P2P流媒体相关增强技术.对典型P2P流媒体系统的性能进行了比较,...     

CDN与P2P结合的技术在流媒体分发和交付系统中的应用

从电信运营商的角度分析了CDN技术和P2P技术在流媒体分发和交付系统中各自的特点。在此基础上,将CDN与P2P技术相结合,提出了CDN P2P架构,并阐述了此架构作为流媒体分发和交付系统的应用实现和优点。     

基于P2P技术的流媒体应用探讨

通过对数字媒体在互联网环境下传播应用的探讨,深入理解P2P技术与流媒体技术的完美融合而产生的互联网新型应用的工作机制和特点,最后,提出流媒体应用未来发展方向和待解决的技术问题。     

移动P2P流媒体业务及市场分析

分析了移动P2P流媒体业务,阐述了移动P2P网络应用的业务、计费及运营模式,探讨了3G网络中移动P2P流媒体的应用。     

P2P模型构造及资源搜索算法研究

Peer-to-Peer(P2P)对于分布式文件共享具有很好的前景,但当前的P2P系统仍然缺乏有效的信息搜索机制。针对P2P网络中资源查找以及其自身存在的问题,提出了一种分布式二叉树索引模型,通过度量网络中结点属性相似性,对所有结点进行渐近分组,形成层次性逻辑二叉树覆盖网络。在信息搜索时,查询只路由到相关的结点上,减少信息搜索时的平均搜索路径长度,从而改善搜索效率。     

CDN与P2P结合的技术在流媒体分发和交付系统中的应用

从电信运营商的角度分析了CDN技术和P2P技术在流媒体分发和交付系统中各自的特点。在此基础上,将CDN与P2P技术相结合,提出CDN+P2P架构,并阐述了该架构实现流媒体分发和交付系统的优点。     

一种基于访问频率的非结构化P2P复制策略

旨在通过数据复制来提高非结构化P2P系统的数据访问效能,提出了基于访问频率的复制策略—AFRE算法,该算法通过赋予不同时间片的访问记录不同的权重,计算数据的局部访问频率,并将适量的数据副本放置到节点度较大的节点.实验证明,提出的复制策略在副本总数明显减少的情况下,能够获得较好的平均查询长度及优于其他常用复制策略的查询成功率.     

网络编码在P2P流媒体播放系统的应用

P2P流媒体系统近年来发展非常迅速,显示了巨大的生命力,但是另一方面现有的P2P流媒体系统又存在很多问题：文件定位技术、节点选择技术、网络不稳定性及网络带宽等等。大量的理论研究表明,网络编码可以提高系统的稳定性,提高网络带宽的利用率,而SIP协议可以有效控制和管理P2P网络。文章将网络编码和SIP协议应用到P2P流媒体系统中,目的是解决现有P2P流媒体系统的普遍问题。试验结果表明,应用网络编码技术和SIP协议的P2P流媒体播放系统,在网络健壮性、播放质量、网络资源利用率等方面都有良好的改善。     

基于P2P流媒体直播系统的数据传输策略

针对P2P模式下视频流媒体直播系统的数据传输策略用改进的模拟退火算法进行了优化。以全局规划的思想建立了P2P视频流媒体的数据传输策略数学模型VMDTSA-P2P,模型充分考虑了可用出口带宽和可用性时间对播放连续性的影响,把它们作为获取最优解的目标函数因子,并用改进后的模拟退火算法进行解的寻优,相比于传统的数据传输策略,在具有大量用户的情况下加快了新节点从伙伴节点中选择数据块提供节点的速度,并且保证得到近似最优的数据块提供节点组合,减少了视频流媒体直播系统播放的延迟,从而提高了播放的连续性、流畅性,保证了视频播放的质量。通过该算法在模拟P2P系统中的实现,验证了该算法在P2P系统中对数据传输的准确性和高效性。     

Research on grouping strategy of SIP-based streaming media P2P live broadcast network

The rapid development of Internet has led to the explosion of information sharing, and how to supervise the sharing is a main research topic on current Internet. Aiming at the disadvantage that the current Peer-to-Peer （P2P） is hard to manage and control, this paper presents a Session Initial Protocol （SIP）-based P2P network of three-level architecture. SIP middleware is introduced to the middle level of the three-layer architecture. By the connection function of the SIP signaling, the P2P transmission on media-level can be controlled. Using SIP＇s register and authentication function, the manage layer can manage the whole P2P network. Based on the aforementioned architecture, this paper investigates the grouping strategy on a live broadcast application in P2P network. Combined with the function of SIP register, the paper works on several grouping strategies, sets up models to manage users by grouping them, presents a weight-based K-means IP address grouping algorithm, and realizes it. The experiment shows that the grouping strategy presented in this paper can solve the problem of group sharing of network resource, and can realize the efficient-sharing, reasonable-distributing of network resource     

P2broadcast: a hierarchical clustering live video streaming system for P2P networks

This work describes a novel live video streaming system for P2P networks, referred to as P2broadcast. The video streaming service has bandwidth requirements to guarantee presentation quality. Therefore, a scalable strategy to quickly find a path from a media server to a client with abundant bandwidth is very important. A common approach in the literature is the bandwidth first (BF) scheme, which allows a newcomer to adopt a BF tree traversal scheme to find its parent peer on the P2P overlay tree to retrieve the media content. The BF scheme is likely to build a deep overlay tree, resulting in long start‐up latency as the number of peers on the overlay tree grows. P2broadcast reduces start‐up latency by organizing peers into hierarchical clusters and making the overlay tree become a ‘short‐and‐wide’ tree. The hierarchical clustering structure enables a newcomer to find its parent peer among the set of peers that are more likely to provide large available bandwidth only. Limiting the set of potential parent peers not only reduces start‐up latency but also improves the system availability. Additionally, unlike the BF scheme that only concerns available bandwidth, P2broadcast utilizes a cost function to evaluate the appropriateness of a potential parent peer. The cost function considers the depth of the newcomer on the overlay tree, making the overlay tree become a short‐and‐wide tree. In addition to start‐up latency reduction, the short‐and‐wide tree feature also alleviates the service interruption probability due to the leaving or failure of a peer. Our simulation results show that P2broadcast greatly outperforms the BF scheme in terms of system availability, and achieves around 66% savings in start‐up latency and 10% decrement in service interruption probability. Copyright © 2005 John Wiley & Sons, Ltd.     

Timely traffic identification on P2P streaming media

Since the year of 2006,peer-to-peer (P2P) streaming media service has been developing rapidly,the user scale and income scale achieve synchronous growth.However,while people enjoying the benefits of th...     

P2P流媒体稳态传输模型分析

应用排队理论证明了P2P流媒体系统在稳态时可模型化为多个M/M/n排队系统串联的排队链,在此基础上以节点的播放缓存状态为研究对象,建立了P2P流媒体系统的稳态传输模型。考察了不同chunk调度策略下节点的传输特性,以此验证模型的准确性,并进一步考察了P2P流媒体节点数量、节点缓存大小对传输特性的影响。     

Adaptive streaming of multi-view video over P2P networks

In this paper, we propose a novel solution for the adaptive streaming of 3D representations in the form of multi-view video by utilizing P2P overlay networks to assist the media delivery and minimize the bandwidth requirement at the server side. Adaptation to diverse network conditions is performed regarding the features of human perception to maximize the perceived 3D. We have performed subjective tests to characterize these features and determined the best adaptation method to achieve the highest possible perceived quality. Moreover, we provide a novel method for mapping from scalable video elementary stream to torrent-like data chunks for adaptive video streaming and provide an optimized windowing mechanism that ensures timely delivery of the content over yanl?? gibi. The paper also describes techniques generating scalable video chunks and methods for determining system parameters such as chunk size and window length.     

A game model for information dissemination in live streaming e-commerce environment

As a new form of social e-commerce, live streaming e-commerce is becoming increasingly popular among Chinese consumers. Live streaming brings huge opportunities, and we can take measures to further expand the dissemination of live streaming information. A live streaming information dissemination game model based on social evolutionary game theory is presented to simulate multiple complex live streaming e-commerce networks. The introduction of incentive mechanism in the model further quantifies the internal relation between rewards and live streaming information dissemination to a certain extent and predicts the ratings of live streaming in networks with different update frequency of social relationships. The simulation results indicate that the reputation environment in social networks, adjusting frequency of relationship, pre-broadcast rewards to post-broadcast rewards ratio all have certain ranges of impact on information dissemination in live streaming e-commerce environment and then affect the live streaming ratings. These findings offer insights into the dissemination of live streaming information in social networks.     

Video streaming over P2P networks: Challenges and opportunities

A robust real-time video communication service over the Internet in a distributed manner is an important challenge, as it influences not only the current Internet structure but also the future Internet evolution. In this context, Peer-to-Peer (P2P) networks are playing an imperative position for providing efficient video transmission over the Internet. Recently, several P2P video transmission systems have been proposed for live video streaming services or video-on-demand services over the Internet. In this paper, we describe and discuss existing video streaming systems over P2P. Efficient (delay tolerant and intolerant) data sharing mechanisms in P2P and current video coding trends are elaborated in detail. Moreover, video streaming solutions (live and on-demand) over P2P from the perspective of tree-based and mesh-based systems are explained. Finally, the conclusion is drawn with key challenges and open issues related to video streaming over P2P.