A modified genetic algorithm for the optimization of aggregated multicast

Authors:
Hua Wang;Zuquan Ge;Chaoying Yu;Shanwen Yi
Affiliations:
School of Computer Science and Technology, Shandong University, Jinan, Shandong Province, P. R. China;School of Computer Science and Technology, Shandong University, Jinan, Shandong Province, P. R. China;School of Computer Science and Technology, Shandong University, Jinan, Shandong Province, P. R. China;School of Computer Science and Technology, Shandong University, Jinan, Shandong Province, P. R. China
Venue:
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
Year:
2009

Citing 5
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Aggregated Multicast—A Comparative Study

Cluster Computing
Tackling group-to-tree matching in large scale group communications

Computer Networks: The International Journal of Computer and Telecommunications Networking
A Scalable Overlay Multicast Architecture for Large-Scale Applications

IEEE Transactions on Parallel and Distributed Systems
AQoSM: Scalable QoS multicast provisioning in Diff-Serv networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

The large-scale increase of multicast state is the major factor preventing the wide application of multicast when there are a large number of multicast groups in the network. As a new technology of reducing forwarding states of multicast state, aggregated multicast aims to enable the multicast groups that can be integrated in the network to share one distribution tree, which reduces the number of multicast trees, thus leading to the reduction of forwarding states and improvement of network performance. A modified genetic algorithm is proposed in this paper to optimize aggregated multicast problem. Simulation results indicate that network performance is improved greatly when applying this algorithm.