OPTIMIZATION OF MULTIPOINT ROUTING IN BROADBAND TELECOMMUNICATION NETWORKS ON THE BASIS OF EVOLUTION STOCHASTIC OPTIMIZATION ALGORITHMS

Vladimír Olej - Radovan Vrba - Karol Blunár

   The paper presents design and analysis of evolution stochastic optimization algorithms to look for optimal multicast routing in broadband telecommunication networks. Three algorithms are described - algorithms Hill Climbing, Simulated Annealing and Genetic algorithm. Routing in broadband telecommunication networks is procedure for serve of demand for creating of connection, which arrived to the network. For to create of multipoint connection in broadband telecommunication network, which demand connection with a minimal cost of connection. Following results of computing resources, computing time and cost of design connection in broadband telecommunication networks depend on the correct selection of algorithm according to large of the network and on the parameters of algorithms. For good result of design of the networks, a compromise between kind of algorithm cost of connection and computing time of designed connection is needed. Design of the connection will approached to the optimal connection and computing time will guarantee desired criteria for routing in broadband telecommunication network.

Keywords: broadband telecommunication network, multicast routing, evolution stochastic optimization algorithms

[full-paper]