Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm

GASANT: An ant-inspired least-cost QoS multicast routing approach based on genetic and simulated annealing algorithms

“…The larger values of β increase the number of longer edges. Also, the randomly generated edges of the graph accepts their cost from [1,100], delay from [0.01,0.1] ms, and bandwidth values from range [10,50] Mbps. GASANT was run on 20, 40, 60, 80, and 100-node network graphs.…”

“…In this method, every chromosome represents a multicast tree. As a result, the coding space is greatly reduced and coding-decoding operation is omitted and the meaning of genetic operations becomes more visual and the time of conversion between encoding and solution spaces is saved [1].…”

“…This tree includes a route node (sender), some internal nodes (intermediate routers) and some leaf nodes (recipients). To carry large numbers of multicast sessions, a network must minimize the sessions' resource consumption [1]. Therefore, it is important for a multicast session to adopt a multicast tree whose network cost is minimal.…”

Multitree-Multiobjective Multicast Routing for Traffic Engineering

“…The crossover algorithm is based on the one originally presented by Zhengying et al [16]. It was also used in several other publications [6,7,15].…”

“…choose one tree from each parent; 2. identify common links of the selected pair. These links will be part of the child tree that will be in the next generation of P. Given that common links of the parents could lead to a child composed of disjoined sub-trees, new links may be added [16]; 3. connect the disjoined sub-trees until a multicast tree is constructed. At this step, the sub-trees are connected at random.…”