A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Particle Swarm Optimization for Multi-constrained Routing in Telecommunication Networks
2011
International Journal of Computer Network and Information Security
By our analysis, the QoS routing is the optimization problem under the satisfaction of multiple QoS constraints. The Particles Swarm Optimization (PSO) is an optimization algorithm which has been applied to finding shortest path in the network. However, it might fall into local optimal solution, and is not able to solve the routing based on multiple constraints. To tackle this problem, we propose a new method of solving the multiple constraints routing. This paper firstly sets up a multi
doi:10.5815/ijcnis.2011.04.02
fatcat:xwnkj3zyk5hmjcobmm3oyqhrja