Minimization of Congestion in MPLS Networks by means of Flows Optimization Techniques

Abstract

In this paper, we propose an optimized model that provides QoS by minimization of the congestion in the Label Switching Path (LSP) in a MPLS networks. We analyzed Capacity and Flow Allocation (CFA) model which doesn’t consider the size of the buffer for the calculation of capacities cost; this deficiency is solved by our model which we called Allocation of the Capacity of Buffer (ACB). The results of the simulations show that the proposed model minimizes the congestion in the LSP and uniformly distribute the flow in each link compared with the models: GFA and OCL