Abstract | ||
---|---|---|
IP multicast faces a serious state scalability problem when there are large numbers of groups in the network. Aggregated Multicast has been proposed as a novel solution to solve this problem, in which multiple groups shared one aggregated tree, so as to reduce the multicast forwarding states. In this paper, we propose a Ant Colony Optimization Algorithm for Aggregated Multicast on Clustering to solve the problem that the time complexity of traditional aggregated multicast algorithm increases exponentially. Simulation results show that our algorithm performs well in program execution time and aggregation degree. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1109/HPCC.2012.132 | HPCC-ICESS |
Keywords | Field | DocType |
traditional aggregated multicast algorithm,ant colony optimization algorithm,ant colony algorithm,program execution time,aggregated multicast,multicast forwarding state,ip multicast,aggregated tree,aggregation degree,time complexity,serious state scalability problem,computational complexity,optimization,algorithm design and analysis,ant colony optimization,bandwidth,genetic algorithms,clustering algorithms,network topology,constrained clustering | Ant colony optimization algorithms,Protocol Independent Multicast,Computer science,Xcast,Computer network,Multicast,Distance Vector Multicast Routing Protocol,Time complexity,Cluster analysis,IP multicast,Distributed computing | Conference |
ISSN | Citations | PageRank |
2576-3504 | 1 | 0.35 |
References | Authors | |
7 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Shanwen Yi | 1 | 9 | 1.53 |
Hua Wang | 2 | 76 | 14.82 |
Rui Zhang | 3 | 63 | 11.33 |