.png){kind=icon}
返回
An orthogonal genetic algorithm for multimedia multicast routing
.png){kind=icon}
PRE
AI
DOI：10.1109/4235.752920.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Many multimedia communication applications require a source to send multimedia information to multiple destinations through a communication network. To support these applications, it is necessary to determine a multicast tree of minimal cost to connect the source node to the destination nodes subject to delay constraints on multimedia communication. This problem is known as multimedia multicast routing and has been proved to be NP-complete, This paper proposes an orthogonal genetic algorithm for multimedia multicast routing. Its salient feature is to incorporate an experimental design method called orthogonal design into the crossover operation. As a result, it can search the solution space in a statistically sound manner and it is well suited for parallel implementation and execution. We execute the orthogonal genetic algorithm to solve two sets of benchmark test problems. The results indicate that for practical problem sizes, the orthogonal genetic algorithm can find near-optimal solutions within moderate numbers of generations.
Keyword:
genetic algorithm
multimedia multicast routing
NP-complete
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
(Dimethyl)[tris(trimethylsilyl)methyl]silyl cyanate and related species: the first silicon cyanates
PREAI
分享收藏分享收藏A weighted cooperative spectrum sensing framework for infrastructure-based cognitive radio networks
PREAI
分享收藏
查看更多内容