An improved particle swarm algorithm for multi-objectives based optimization in MPLS/GMPLS networks

Masood, Mohsin and Fouad, Mohamed Mostafa and Kamal, Rashid and Glesk, Ivan (2019) An improved particle swarm algorithm for multi-objectives based optimization in MPLS/GMPLS networks. IEEE Access. ISSN 2169-3536 (

[thumbnail of Masood-etal-IEEEA-2019-An-improved-particle-swarm-algorithm-for-multi-objectives]
Text. Filename: Masood_etal_IEEEA_2019_An_improved_particle_swarm_algorithm_for_multi_objectives.pdf
Final Published Version
License: Creative Commons Attribution 4.0 logo

Download (33MB)| Preview


Particle swarm optimization (PSO) is a swarm-based optimization technique capable of solving different categories of optimization problems. Nevertheless, PSO has a serious exploration issue that makes it a difficult choice for multi-objectives constrained optimization problems (MCOP). At the same time, Multi-Protocol Label Switched (MPLS) and its extended version Generalized MPLS, has become an emerging network technology for modern and diverse applications. Therefore, as per MPLS and Generalized MPLS MCOP needs, it is important to find the Pareto based optimal solutions that guarantee the optimal resource utilization without compromising the quality of services (QoS) within the networks. The paper proposes a novel version of PSO, which includes a modified version of the Elitist Learning Strategy (ELS) in PSO that not only solves the existing exploration problem in PSO, but also produces optimal solutions with efficient convergence rates for different MPLS/ GMPLS network scales. The proposed approach has also been applied with two objective functions; the resource provisioning and the traffic load balancing costs. Our simulations and comparative study showed improved results of the proposed algorithm over the well-known optimization algorithms such as the “standard” PSO, Adaptive PSO, BAT, and Dolphin algorithm.


Masood, Mohsin ORCID logoORCID:, Fouad, Mohamed Mostafa, Kamal, Rashid and Glesk, Ivan ORCID logoORCID:;