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

多约束的应用层组播算法研究
引用本文:韩广,刘海林. 多约束的应用层组播算法研究[J]. 广东工业大学学报, 2015, 32(4): 118-122. DOI: 10.3969/j.issn.1007-7162.2015.04.021
作者姓名:韩广  刘海林
作者单位:广东工业大学 1.信息工程学院 广东 广州 510006;2.应用数学学院, 广东 广州 510520
基金项目:广州市科技计划项目(2014J4100209)
摘    要:组播在分布交互式应用、网络在线游戏、流媒体等方面具有广泛的应用.为满足应用层组播QoS要求,在文构建多约束应用层组播树模型,基于遗传算法、采用双染色编码方式寻找最优生成树.该算法既能满足实时性、节点负载限制,又能最小化组网资源消耗,高效利用网络资源.实验表明,该算法收敛速度快,可靠性高.

关 键 词:应用层组播; 遗传算法; 最小生成树; 即时通信  
收稿时间:2014-06-03

On Multi-constrained Application Layer Multicast Algorithm
HAN Guang,LIU Hai-Lin. On Multi-constrained Application Layer Multicast Algorithm[J]. Journal of Guangdong University of Technology, 2015, 32(4): 118-122. DOI: 10.3969/j.issn.1007-7162.2015.04.021
Authors:HAN Guang  LIU Hai-Lin
Affiliation:1. School of Information Engineering, Guangdong University of Technology, Guangzhou 510006, China;2. School of Applied Mathematics, Guangdong University of Technology, Guangzhou 510520, China
Abstract:Multicast has wide applications in distributed interactive applications, online games, streaming media and etc.To meet the application layer multicast QoS requirement, this paper builds a multi-constrained application layer multicast tree model and tries to find the optimal spanning tree based on genetic algorithm and dichromatic coding. The algorithm can meet the real-time requirement and node load limit as well as minimize network resource consumption and take full advantage of network resources. It turns out to be featured by fast convergence and high reliability.
Keywords:application layer multicast   genetic algorithm   minimum spanning tree   instant messaging,
本文献已被 万方数据 等数据库收录!
点击此处可从《广东工业大学学报》浏览原始摘要信息
点击此处可从《广东工业大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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