.png){kind=icon}
.png){kind=icon}
Return
An orthogonal genetic algorithm for multimedia multicast routing
.png){kind=icon}
PRE
AI
DOI：10.1109/4235.752920.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
genetic algorithm
multimedia multicast routing
NP-complete
Journal
IF:
12
Papers:
1.8K
Citations:
2.4W
Organization
No organization information available