广东工业大学学报 ›› 2015, Vol. 32 ›› Issue (04): 118-122.doi: 10.3969/j.issn.1007-7162.2015.04.021

• 综合研究 • 上一篇    下一篇

多约束的应用层组播算法研究

韩广1,刘海林2   

  1. 广东工业大学 1.信息工程学院 广东 广州 510006;2.应用数学学院, 广东 广州 510520
  • 收稿日期:2014-06-03 出版日期:2015-12-04 发布日期:2015-12-04
  • 作者简介:韩广(1990-),男,硕士研究生,主要研究方向为智能计算、网络优化.
  • 基金资助:

    广州市科技计划项目(2014J4100209)

On Multi-constrained Application Layer Multicast Algorithm

Han Guang1, Liu Hai-lin2   

  1. 1. School of Information Engineering, Guangdong University of Technology, Guangzhou 510006, China;2. School of Applied Mathematics, Guangdong University of Technology, Guangzhou 510520, China
  • Received:2014-06-03 Online:2015-12-04 Published:2015-12-04

摘要: 组播在分布交互式应用、网络在线游戏、流媒体等方面具有广泛的应用.为满足应用层组播QoS要求,在文构建多约束应用层组播树模型,基于遗传算法、采用双染色编码方式寻找最优生成树.该算法既能满足实时性、节点负载限制,又能最小化组网资源消耗,高效利用网络资源.实验表明,该算法收敛速度快,可靠性高.

关键词: 应用层组播; 遗传算法; 最小生成树; 即时通信

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.

Key words: application layer multicast; genetic algorithm; minimum spanning tree; instant messaging

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!