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

赵娟; 潘耘

doi:10.3969/j.issn.1007130X.2010.

计算机工程与科学 >

2010 , Vol. 32 >Issue 3: 28 - 30

DOI: https://doi.org/10.3969/j.issn.1007130X.2010.

论文

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

赵娟 ,
潘耘

展开

（咸阳师范学院计算机科学系，陕西咸阳 712000)

赵娟 (1975)，女，四川成都人，硕士，讲师，研究方向为语义Web服务和面向服务的计算；潘耘，博士，副教授，研究方向为计算机网络和复杂系统仿真。

收稿日期: 2009-05-25

修回日期: 2009-10-21

网络出版日期: 2010-03-10

收起

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

DIAO Juan ,
BO Yun

Expand

(Department of Computer Science,Xianyang Normal University,Xianyang 712000 )

Received date: 2009-05-25

Revised date: 2009-10-21

Online published: 2010-03-10

Fold

摘要

本文研究了Overlay网络中带有度约束的最小带宽多播路由问题，建立了相应的数学优化模型，设计了求解模型的启发式算法，对算法的复杂性进行了分析，并进行了数值模拟。

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

本文引用格式

赵娟 , 潘耘 . Overlay多播网络中带度约束的最小带宽多播树的求解[J]. 计算机工程与科学, 2010 , 32(3) : 28 -30 . DOI: 10.3969/j.issn.1007130X.2010.

Abstract

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 results of theoretical analysis and that of simulations suggest our proposed model and algorithms are practical and effective.

Key words： Overlay multicast;degreeconstrained;minimal bandwidth;heuristic algorithm

Options

文章导航

模态框（Modal）标题

摘要

本文引用格式

Abstract