An immune algorithm for the optimization of aggregated multicast

Authors:
Hua Wang;Zuquan Ge;Fangji Zhu;Chaoying Yu
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 6
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
Multicast tree aggregation in large domains

NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Large-scale deployment of multicast applications is limited by the number of states that are set in routers for multicast groups. Aggregation is a natural solution to reducing the multicast forwarding states. In the way of sharing a common distribution tree among several groups, the approach to aggregated multicast reduces the number of forwarding states and improves network performance. Finding the best aggregation tree is an NP-complete problem, which requires approximate algorithms for the solution. Traditional greedy algorithm is not suitable for large scale network because of long computation time and low degree of aggregation. In this paper, an immune algorithm is proposed to solve the problem of aggregated multicast optimization. The immune approach achieves better solution by generating antibody of different antigens, which enables the algorithm to search in the vast space for the best solution. Simulations have shown that the immune algorithm has better performance than other algorithms in both the aggregation degree and the state reduction ratio.