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.
You have full access to this open access chapter, Download conference paper PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Huilin, H.E., Fazhen, Y.I. (2014). Ant Colony Algorithm and its Application in QoS Routing with Multiple Constraints. In: Huang, YM., Chao, HC., Deng, DJ., Park, J. (eds) Advanced Technologies, Embedded and Multimedia for Human-centric Computing. Lecture Notes in Electrical Engineering, vol 260. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-7262-5_73
Download citation
DOI: https://doi.org/10.1007/978-94-007-7262-5_73
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-7261-8
Online ISBN: 978-94-007-7262-5
eBook Packages: EngineeringEngineering (R0)