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

基于分簇结构的P2P流媒体混合分发算法
引用本文:陈瑞昭,刘永广.基于分簇结构的P2P流媒体混合分发算法[J].华南师范大学学报(自然科学版),2010,1(1):8-41.
作者姓名:陈瑞昭  刘永广
作者单位:1.广东轻工职业技术学院
基金项目:广东省计算机网络重点实验室开放基金资助项目(cn200407);;广东轻工职业技术学院自然科学基金资助项目(KX010405)
摘    要:提出了一种基于分簇结构的混合分发算法,算法采用分簇的方法将流媒体中的节点资源进行簇划分,形成由簇头、簇内节点构成的分簇网络结构,簇头与簇内节点通过拉拽算法来获得数据,而簇头间采用推送分发算法.仿真结果表明,该算法能提高数据块复制速度,减少数据传播时延,有效降低系统的控制开销,提高了播放连续度.

关 键 词:对等网络    流媒体    P2P覆盖网        推送算法
收稿时间:2009-09-15

A HYBRID SCHEDULING ALGORITHM FOR P2P STREAM BASED ON CLUSTERING
CHEN Ruizhao,LIU Yongguang.A HYBRID SCHEDULING ALGORITHM FOR P2P STREAM BASED ON CLUSTERING[J].Journal of South China Normal University(Natural Science Edition),2010,1(1):8-41.
Authors:CHEN Ruizhao  LIU Yongguang
Institution:Department of Management;Guangdong Industry Technical College;Guangzhou 510300;China
Abstract:A hybrid scheduling algorithm based on clustering is presented. In the algorithm, node resources are divided into cluster head and cluster nodes by clustering method and form a clustering network structure. For the network, data is obtained by push algorithm between cluster heads and heads, while pull algorithm between cluster heads and inter-cluster nodes. Simulations show that the algorithm can increase the speed of data block duplication, reduce the data propagation delay and the control overhead of stre...
Keywords:peer-to-peer  stream media  P2P overlay network  clustering  push algorithm  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《华南师范大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《华南师范大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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