• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊
论文

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

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.

Cite this article

DIAO Juan , BO Yun . On the Degree Constrained Minimal Bandwidth Multicast Routing Problem in Overlay Networks[J]. Computer Engineering & Science, 2010 , 32(3) : 28 -30 . DOI: 10.3969/j.issn.1007130X.2010.

Outlines

/