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

一种基于策略函数的应用层组播路由算法
引用本文:潘国庆,李陶深.一种基于策略函数的应用层组播路由算法[J].微机发展,2008,18(5):138-140.
作者姓名:潘国庆  李陶深
作者单位:广西大学计算机与电子信息学院 广西南宁530004
基金项目:广西自然科学基金资助项目(桂科自0640026)
摘    要:由于IP组播存在可扩展性差、难以管理等方面的缺陷,研究人员提出了应用层组播。实时传输是应用层组播技术的一个主要应用领域,对网络延迟有严格的限制。文中着重研究构建最小延迟应用层组播树的算法,提出一种基于策略函数构造应用层最小直径组播树的启发式算法BCT-H。该算法采用策略函数迭代的选择使生成树直径最短的路径,从而有效地减少了网络中的转发时延和同一条链路的重复分组数量。模拟实验表明该算法能够有效地降低链路强度,减少组播树的时延。

关 键 词:应用层组播  带宽  时延约束  策略函数  组播树
文章编号:1673-629X(2008)05-0138-03
修稿时间:2007年8月19日

An Application Layer Multicast Routing Algorithm Based on Strategy Function
PAN Guo-qing,LI Tao-shen.An Application Layer Multicast Routing Algorithm Based on Strategy Function[J].Microcomputer Development,2008,18(5):138-140.
Authors:PAN Guo-qing  LI Tao-shen
Affiliation:PAN Guo-qing, LI Tao-shen (School of Computer,Electronics and Information, Guangxi University, Nanning 530004, China)
Abstract:Due to sparse deployment of IP multicast in the Internet,application-layer multicast(ALM)has been proposed.Real time transmission,which is delay sensitive,is an important aspect of application-layer multicast.It is crucial to build an efficient multicast tree to guarantee the lower delay.Focuses on the algorithms of the minimum-delay spanning tree for the application-layer multicast,and proposes an improved BCT-H(balance compact tree-heuristic) algorithms based on strategy function.By using strategy function,this algorithm iteratively chooses the path which makes diameter of the spanning tree the shortest,thus decreases the transmitting latency of the network and the number of repeated grouping in the same link path.The simulation results show that the algorithms can effectively reduce link stress and decrease multicast tree latency.
Keywords:application layer multicast  bandwidth  delay limited  strategy function  multicast tree
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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