Abstract
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. The 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
MulticastComputer scienceRouting (electronic design automation)CrossoverComputer networkSource-specific multicastXcastDistance Vector Multicast Routing ProtocolProtocol Independent MulticastDistributed computingBenchmark (surveying)Genetic algorithmPragmatic General MulticastAlgorithmTheoretical computer scienceMultimediaArtificial intelligenceMachine learning
Affiliated Institutions
Related Publications
New spectral methods for ratio cut partitioning and clustering
Partitioning of circuit netlists in VLSI design is considered. It is shown that the second smallest eigenvalue of a matrix derived from the netlist gives a provably good approxi...
Routing in ad-hoc networks using minimum connected dominating sets
We impose a virtual backbone structure on the ad-hoc network, in order to support unicast, multicast, and fault-tolerant routing within the ad-hoc network. This virtual backbone...
Co-clustering documents and words using bipartite spectral graph partitioning
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we ...
A routing protocol for packet radio networks
Abstract : The authors present a new distance-vector routing protocol for a packet radio network. The new distributed routing protocol, Wireless Routing Protocol (WRP), works on...
Ad-hoc on-demand distance vector routing
An ad-hoc network is the cooperative engagement of acollection of mobile nodes without the required intervention of any centralizedaccess point or existing infrastructure. In th...
Publication Info
- Year
- 1999
- Type
- article
- Volume
- 3
- Issue
- 1
- Pages
- 53-62
- Citations
- 266
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
266
OpenAlex
25
Influential
211
CrossRef
Cite This
Qingfu Zhang,
Yiu-Wing Leung
(1999).
An orthogonal genetic algorithm for multimedia multicast routing.
IEEE Transactions on Evolutionary Computation
, 3
(1)
, 53-62.
https://doi.org/10.1109/4235.752920
Identifiers
- DOI
- 10.1109/4235.752920