一种优化的组播网络路由树机制设计与实现  

On Optimization of Multicast Mechanism Design and Implementation of Network Routing tree

作　　者：黄伟敏[1] 李晓艳[1] 

机构地区：[1]陕西铁路工程职业技术学院机电工程系,陕西渭南714000

出　　处：《西南师范大学学报（自然科学版）》2015年第9期36-42,共7页Journal of Southwest China Normal University(Natural Science Edition)

基　　金：2011年"陕西普通高等学校教学改革"重点攻关研究项目(11GG20)

摘　　要：为实现组播用户追逐自身利益最大化,同时保证整个路由树的通信效率,基于经济机制设计理论,以成本最低为原则,提出了一种具有最小链路传输代价的组播路由树机制及实现算法.通过Floyd-Warshall和MPH算法对其进行评估.该方法可以最大限度减少信息总传输成本,减少组播指定成员之间的连接,降低数据传输成本和网络资源消耗.实例分析结果表明,该网路组播路由树机制和实现算法是可行的、有效的,具有很好的应用前景和推广价值.In order to maximize their own interests chase of multicast users,meanwhile the communication efficiency of the whole routing tree is guaranteed,based on theory of the economic mechanism design,and the principle of lowest cost,a multicast routing tree mechanism and algorithm with the smallest link transmission cost is proposed,which is assessed by Floyd-War shall algorithm and MPH,the total cost of transmission of information can be reduced maximally,multicast connections between members are reduced,and the cost of data transmission and network resource consumption is reduced.The analysis indicates that this mechanism of network multicast routing tree is feasible and effective,which is of broad application prospect and values for promotion.

关 键 词：组播路由 生成树 最小链路成本 机制设计 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]