首页 | 本学科首页   官方微博 | 高级检索  
     

基于大数据量实时流媒体P2P树算法研究
引用本文:孙为,张宝杰,车嵘. 基于大数据量实时流媒体P2P树算法研究[J]. 兰州理工大学学报, 2006, 32(6): 107-110
作者姓名:孙为  张宝杰  车嵘
作者单位:兰州理工大学,现代网络教育学院,甘肃,兰州,730050;西安通信学院,通信装备教研室,陕西,西安,710106
摘    要:为了解决大数据实时流媒体传输(LRST)的QoS可控机制问题,根据现有的P2P模型,提出了一种新的基于RTCP的P2P树算法模型LrstP2P.该模型依托于RTCP XR协议和最小树深算法,通过三层模型的动态算法,增强了新用户加入网络时对父节点选择的有效性,优化了用户通信过程中由于节点的随机性和网络拓扑的易变性的应对策略,改进了数据传输的稳定性和实时性.通过实验,证实了该算法的优越性.

关 键 词:大数据量实时流媒体  P2P  LrstP2P  RTCP
文章编号:1673-5196(2006)06-0107-04
收稿时间:2006-06-19
修稿时间:2006-06-19

A P2P-tree algorithm based on large-volume real-time streaming media
SUN Wei,ZHANG Bao-jie,CHE Rong. A P2P-tree algorithm based on large-volume real-time streaming media[J]. Journal of Lanzhou University of Technology, 2006, 32(6): 107-110
Authors:SUN Wei  ZHANG Bao-jie  CHE Rong
Abstract:In order to solve the problem of controllability mechanism of QoS for large-volume real-time streaming medium transport,a new RTCP-based P2P-tree algorithm model LrstP2P was proposed according to the P2P model available.Based on the protocol RTCP XR and by means of dynamic algorithm with three-level model,the availability of the parent node choice strategy was enhanced for the users when they took part in the network,the self-administration aimed at variable network topology and randomness of nodes encountered in communication process of the users was optimized,and the system reliability and service delay were unproved.The advantages of this LrstP2P algorithm were justified by the experiment performed.
Keywords:large-volume real-time streaming media  P2P  LrstP2P  RTCP
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号