摘要
对有度和延时约束的覆盖多播路由问题展开研究,提出了一种新的自适应覆盖多播路由协议——AOMRP.该协议采用分布式策略,在构建多播树时针对可能出现的情况自适应地采用2种不同的启发式局部优化算法:当多播树局部存在可能父节点时,通过调节某一启发因子,新节点可以在最小延时优先策略和减少局部端系统资源耗费策略之间进行折衷并执行加入动作;当多播树局部不存在可能父节点时,通过调节另一启发因子,新节点可以选择某一分支继续向树的叶节点方向作探测.仿真实验结果表明,通过选择适当的启发参数,AOMRP能够获得较低的节点拒绝率.
The degree and delay constrained routing problem in overlay multicast was studied, and a novel adaptive overlay multicast routing protocol called adaptive overlay multicast routing protocol (AOMRP) is proposed. Adopting the distributed strategy, the protocol uses two different heuristic local optimum algorithms adaptively for situations that may arise when constructing a multicast tree: when there are potential parents in the local multicast tree, the new node can make a trade-off between minimum delay preference strategy and local resource consumption reduction strategy and then join the tree by adjusting one of the heuristic parameters. When there is no potential parent in the local multicast tree, the new node can select some branch for further detecting towards the leaf nodes by adjusting another heuristic parameter. The simulation results show that AOMRP can achieve a lower rejection rate of members through choosing proper values of the two heuristic parameters.
出处
《东南大学学报(自然科学版)》
EI
CAS
CSCD
北大核心
2007年第3期374-379,共6页
Journal of Southeast University:Natural Science Edition
基金
国家自然科学基金资助项目(90604003
60573133)
关键词
覆盖多播
路由协议
自适应
启发式算法
overlay multicast
routing protocol
adaptive
heuristic algorithm