A Fast Scalable Evolutionary Algorithm for the QoS Multicast Routing Problem
Salah Al-Sharhan, Fakhri O. Karray, Wail Gueaieb · Intelligent Automation & Soft Computing · 2008
Abstract The increasing demand of real-time multimedia services makes of quality of service based routing a serious challenge for next-generation networks. The complexity of this NP-complete problem significantly increases with the size of the network. A new evolutionazybased multicast routing algorithm is presented in this paper. It is based on computational intelligence techniques that integrate in an efficient manner the merits of genetic algorithms and the concepts of competitive leazning in the area of artificial neural networks. Population-based incremental learning algorithm is utilized, among other techniques, to construct a delay bounded multicast tree. The proposed algorithm is capable of simultaneously satisfying several key quality of service requirements that aze necessazy for real-time multimedia applications. The main objective of the algorithm is to construct a multicast tree that is characterized by a minimum cost and a bounded end-to-end delay and residual bandwidth. It is shown through ...