期刊名称:International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN:2277-6451
电子版ISSN:2277-128X
出版年度:2012
卷号:2
期号:10
出版社:S.S. Mishra
摘要:In this paper a nature inspired multi-objective optimization based on new improved Group search optimizer algorithm has been modelled to solve the NP-complete, multicast routing problem. This proposed algorithm will use an effective objective function which ensures quick convergence and finds the optimized path between the single source and multiple destination nodes based on the objective QoS metrics that include delay, delay jitter, bandwidth and packet loss. It uses an adaptive and iterative path search approach and takes the advantage of multi-group structure of GSO to quick convergence of global optimum. The perfo rmance of the proposed multi-objective group search optimizer (MOGSO) is evaluated by simulations. The simulation result s show that the proposed routing algorithm can provide best performance with an acceptable complexity and can reduce processing time which provides better network utilization than the competing algorithms.
关键词:Dynamic multicast routing; multi-objective; Combinatorial optimization problem; Group Search ;optimizer.