A New Routing Algorithm in MPLS Networks using Fuzzy AHP method with guaranteed bandwidth and Delay end-to-end

Multi-protocol Label Switching(MPLS) is presented as a new approach that combines the advantages of using routing in the third layer of the network and the second layer of the data link. But the most important part of this technology is the implementation of traffic engineering. The most important requirement for traffic engineering is to available network resources (such as bandwidth) across the network to efficiently select the LSP paths. Our main goal in this research is to load balance in the infrastructure of MPLS networks using the Fuzzy AHP method and the Dijkstra algorithm while guaranteeing bandwidth and end-to-end delay. In the proposed algorithm for weighing links, we have used fuzzy AHP techniques, which makes it impossible to use links that are in critical condition when routing. And to improve performance, we have implemented a new approach using high priority bits in network packets to transfer them to destinations. Finally, we simulate the proposed algorithm in MATLAB software and compared it with the MIRA and MDMF and BGLC and GA PSO algorithms. The simulation results show that the proposed MPLS_FAHP algorithm is better than other algorithms in terms of the number of requests accepted (call blocking ratio) and Mean Length and Maximum Flow.