CollectCast模型中活动节点的选择算法改进  

Improved algorithm of CollectCast model in active nodes selection

作　　者：阳卫文[1] 

机构地区：[1]湖南交通工程职业技术学院,湖南衡阳421001

出　　处：《计算机工程与设计》2009年第10期2482-2485,共4页Computer Engineering and Design

摘　　要：主要讨论了非结构化的P2P流媒体系统中活动节点选择算法,分析了如何将路径带宽分配给各提供节点,从而为接收节点选出最优的活动节点集并提供尽可能大的带宽。指出了CollectCast模型在拓扑感知节点选择策略中存在的不足,提出多个节点共享多条路段情况下的路段带宽分配原则,并利用数学归纳法和递归法证明了按节点可用率大小顺序分配路径带宽可获得最大有效带宽,从而得出改进的活动节点选择算法。该算法使接收节点获得的有效带宽接近最大值,且复杂性较低。The selecting algorithm of active node on the system of unstructured P2P stream media is mainly discussed. How to distribute bandwidth among the nodes is analyzed, so that to find out the best active node sets for the receiving node and to provide max bandwidth possibly. The disadvantages of CollectCast mode on strategy of topology recognizing and node selecting is pointed out. A principle of bandwidth distribution when many nodes share multiple routes is put forward. It is proven that the maximum bandwidth is gotten if the route bandwidth be provided on sequences of availability of the nodes by mathematical induction and recursive method. At last, it advances an improved algorithm of active node selecting which can make the receiving node get the effective bandwidth close to the maximum and has low complexity.

关 键 词：CollectCast P2P 流媒体 节点选择 带宽分配 拓扑感知 

分 类 号：TN393[电子电信—物理电子学]