Computer Engineering & Science >
On the Degree Constrained Minimal Bandwidth Multicast Routing Problem in Overlay Networks
Received date: 2009-05-25
Revised date: 2009-10-21
Online published: 2010-03-10
In this paper, we investigate the degreeconstrained 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.
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.1007130X.2010.
/
| 〈 |
|
〉 |