摘要
本文探讨了在高速包交换计算机网络中 ,具有端到端时延限制的多播路由问题。提出了一种新颖的基于蚂蚁算法的多播路由优化算法 ,该算法是完全分布式的。仿真实验表明 ,用该算法产生的多播路由树的费用比已存在的主要算法更好 ,并且适应于多播成员数的变化。
This paper studies the problem of multicast routing with end to end delay constraint in high speed packet switched computer networks A novel approach using ant algorithm is proposed to optimize the multicast routes and this approach is fully distributed The simulation results show that the network cost of the routing trees generated by our approach is better than the other major existing algorithms,and flexible in multicast membership changes
出处
《通信学报》
EI
CSCD
北大核心
2001年第3期70-74,共5页
Journal on Communications
基金
原邮电部重点项目基金!资助项目 (980 6 1)
