覆盖组播的最小覆盖代价路由算法  

Overlay multicast routing algorithm with minimum overlay cost

作　　者：林龙新[1] 周杰[1] 张凌[1] 叶昭[1] 

机构地区：[1]华南理工大学广东省计算机网络重点实验室,广州510641

出　　处：《计算机应用》2008年第10期2569-2572,2576,共5页journal of Computer Applications

基　　金：国家973计划项目(2003CB314805);国家科技基础条件平台项目(2005DKA64001);2005年粤港关键领域重点突破项目

摘　　要：与IP组播相比,覆盖组播通常会消耗更多的底层网络资源。因此,在覆盖网中构造组播转发树时,考虑合理地利用底层网络资源具有一定的实际意义。给出覆盖代价的概念,把覆盖组播路由问题归结为求无向完全图的度和延迟受限、具有最小覆盖代价的生成树问题,求解的目标是在满足应用需求和端用户主机性能要求的同时使所消耗的底层网络资源最少。给出了求解该问题的启发式遗传算法,通过仿真实验验证了该算法的有效性。Compared with IP muhieast, overlay multicast usually consumes more underlying network resources. Therefore, utilizing the underlying network resources effectively has some practical significance when constructing the multicast delivery tree based on overlay network. The concept of overlay cost was proposed, and the overlay multicast routing problem was defined to find a degree and delay constrained spanning tree with the minimum overlay cost for an undirected complete graph. The goal of the solution was to satisfy the applications＇ requirements and the end hosts＇ performance needs, and to make the consumption of underlying network resources minimum at the same time. A heuristic genetic algorithm for this problem was given, and the simulation results verify the effectiveness of the algorithm.

关 键 词：覆盖组播 覆盖代价 生成树 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]