A genetic-inspired multicast routing optimization algorithm with bandwidth and end-to-end delay constraints

Abstract

This paper presents a genetic-inspired multicast routing algorithm with Quality of Service (i.e., bandwidth and end-to-end delay) constraints. The aim is to efficiently discover a minimurn-cost multicast tree (a set of paths) that satisfactorily helps various services from a designated source to multiple destinations. To achieve this goal, state of the art genetic-based optimization techniques are employed. Each chromosome is represented as a tree structure of Genetic Programming. A fitness function that returns a tree cost has been suggested. New variation operators (i.e., crossover and mutation) are designed in this regard. Crossover exchanges partial chromosomes (i.e., sub-trees) in a positionally independent manner. Mutation introduces (in part) a new sub-tree with low probability. Moreover, all the infeasible chromosomes are treated with a simple repair function. The synergy achieved by combing new ingredients (i.e., representation, crossover, and mutation) offers an effective search capability that results in improved quality of solution and enhanced rate of convergence. Experimental results show that the proposed GA achieves minimal spanning tree, fast convergence speed, and high reliability. Further, its performance is better than that of a comparative reference.