Volume 19, Issue 3 (12-2022)
JSDP 2022, 19(3): 135-146 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Ashoori Z, Azimpour J, Mazarei H. Using a Fuzzy Rule-based Algorithm to Improve Routing in MPLS Networks. JSDP 2022; 19 (3) : 9
URL: http://jsdp.rcisp.ac.ir/article-1-1073-en.html
URL: http://jsdp.rcisp.ac.ir/article-1-1073-en.html
Abstract: (1099 Views)
Today, the use of wireless and intelligent networks are widely used in many fields such as information technology and networking. There are several types of these networks that MPLS networks are one of these types. However, in MPLS networks there are issues and problems in the design and implementation discussion, for example security, throughput, losses, power consumption and so on. Basically, the performance parameters of MPLS networks are directly dependent on the type of routing performed between these networks. In this paper, a routing algorithm for energy-based routing in MPLS networks is presented which performs routing online with increasing number of requests. This algorithm guarantees bandwidth and end-to-end delay and its performance is based on the Minimum Delay and Maximum Flow (MDMF) algorithm. The purpose of this algorithm is to uniformly distribute the load across the network for all requests and to delay high-bandwidth requests and maximum end-to-end delay using a fuzzy law-based approach. In addition, the proposed algorithm optimizes the use of resources and increases the number of requests accepted. In the proposed routing algorithm, the weight of each link of the network graph is first calculated based on a multi-objective weighted sum maximization problem. The weight of links must be calculated in such a way as to determine the shortest path weighted by the sum of the minimum weights in the graph. Then, links which their residual bandwidth is less than the requested bandwidth are removed from the grid graph and in the residual subgraph, the shortest weighted path between the input-output nodes is calculated using Dijkstra algorithm and based on the weights of each link. Therefore, this algorithm only requires the remaining capacity information of the links, where assumed this information is always available. The proposed method is implemented in MATLAB software and the results show a decrease in energy consumption and improvement of network performance parameters compared to similar methods.
Article number: 9
Keywords: MPLS Networks, Energy-Based Routing, Rule-Based Fuzzy Algorithm, Bandwidth, End-to-End Delay
Type of Study: Research |
Subject:
Paper
Received: 2019/09/25 | Accepted: 2021/02/24 | Published: 2022/12/25 | ePublished: 2022/12/25
Received: 2019/09/25 | Accepted: 2021/02/24 | Published: 2022/12/25 | ePublished: 2022/12/25
Send email to the article author
| Rights and permissions | |
 |
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |
