Ant Colony Algorithm and its Application in QoS Routing with Multiple Constraints
In the modern communication network, QoS routing optimization problem acts as one of the most important types of discrete optimization problem which could normally be solved by heuristic algorithm. And Ant Colony Algorithm as a new heuristic optimization
- PDF / 1,587,541 Bytes
- 1 Pages / 439.37 x 666.142 pts Page_size
- 55 Downloads / 183 Views
Abstract In the modern communication network, QoS routing optimization problem acts as one of the most important types of discrete optimization problem which could normally be solved by heuristic algorithm. And Ant Colony Algorithm as a new heuristic optimization algorithm shows good performance in solving complex optimization problems. In this paper, Ant Colony Algorithm is presented to solve the QoS unicast routing problem under the constraints of bandwidth and delay, using the mechanism that ants are able to find the optimal path through pheromone and joining the heuristic strategy. The simulation results show that this algorithm can quickly find the routing that meets the constraints of time delay and bandwidth with minimum cost and minimum time delay. Keywords Ant colony algorithm algorithm
QoS routing
Cost
Delay
Dijkstra
H. E. Huilin (&) Y. I. Fazhen School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing 100044, China e-mail: [email protected] Y. I. Fazhen e-mail: [email protected]
Y.-M. Huang et al. (eds.), Advanced Technologies, Embedded and Multimedia for Human-centric Computing, Lecture Notes in Electrical Engineering 260, DOI: 10.1007/978-94-007-7262-5_73, Ó Springer Science+Business Media Dordrecht 2014
645
Data Loading...
