Overlay多播网络中带度约束的最小带宽多播树的求解  

On the Degree-Constrained Minimal Bandwidth Multicast Routing Problem in Overlay Networks

作　　者：赵娟[1] 潘耘[2] 

机构地区：[1]咸阳师范学院计算机科学系,陕西咸阳712000 [2]中国传媒大学计算机学院,北京100024

出　　处：《计算机工程与科学》2010年第3期28-30,共3页Computer Engineering & Science

基　　金：咸阳师范学院人才引进项目(06XSYK281)

摘　　要：本文研究了Overlay网络中带有度约束的最小带宽多播路由问题,建立了相应的数学优化模型,设计了求解模型的启发式算法,对算法的复杂性进行了分析,并进行了数值模拟。In this paper, we investigate the degree-constrained minimal bandwidth multicast routing problem in overlay networks, build a corresponding optimization model, and design a heuristic algorithm and a genetic algorithm for the problem. The complexity analysis and numerical experiments according to these two algorithms are also presented. Both the resuits of theoretical analysis and that of simulations suggest our proposed model and algorithms are practical and effective.

关 键 词：Overlay多播 度约束 最小带宽 启发式算法 

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