Search of the Shortest Path in a Communication Network with Fuzzy Cost Functions
A communication network management system takes the measurements of its state variables at specific instants of time, considering them constant in the interval between two consecutive measurements. Nevertheless, this assumption is not true, since these variables evolve in real time. Therefore, uncer...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-08-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2073-8994/13/8/1534 |
| _version_ | 1797521955839016960 |
|---|---|
| author | Lissette Valdés Alfonso Ariza Sira M. Allende Alicia Triviño Gonzalo Joya |
| author_facet | Lissette Valdés Alfonso Ariza Sira M. Allende Alicia Triviño Gonzalo Joya |
| author_sort | Lissette Valdés |
| collection | DOAJ |
| description | A communication network management system takes the measurements of its state variables at specific instants of time, considering them constant in the interval between two consecutive measurements. Nevertheless, this assumption is not true, since these variables evolve in real time. Therefore, uncertainty is inherent in the processing of the measurements during the intervals so that they cannot be efficiently managed using crisp variables. In this paper, we face this problem by modeling the communications network as a type-V fuzzy graph, where both the nodes and the links are described with precision, but the cost of each link is modeled as a triangular fuzzy number. Different fuzzy cost allocation functions and fuzzy optimization strategies are described and applied to the search for the shortest path between two nodes. An experimental study has been conducted using two representative networks: the backbone network of Nippon Telegraph and Telephone Corporation (NTT) and the National Science Foundation’s Network (NFSNET). In these networks, our fuzzy cost functions and strategies have been compared with the well-known crisp equivalents. The optimal search strategies are based on the proposed Fuzzy Dijkstra Algorithm (FDA), which is described deeply. The simulation results demonstrate that in all cases the fuzzy alternatives surpass or equal the crisp equivalents with statistically significant values. Specifically, the so-called Strategy 8 presents the best throughput, as it significantly exceeds the performance of all those evaluated, achieving a Global Mean Delivery Rate (GMDR) close to 1. |
| first_indexed | 2024-03-10T08:19:54Z |
| format | Article |
| id | doaj.art-c3c49ae9b8c540cbbef05baa3281c5b8 |
| institution | Directory Open Access Journal |
| issn | 2073-8994 |
| language | English |
| last_indexed | 2024-03-10T08:19:54Z |
| publishDate | 2021-08-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Symmetry |
| spelling | doaj.art-c3c49ae9b8c540cbbef05baa3281c5b82023-11-22T10:03:05ZengMDPI AGSymmetry2073-89942021-08-01138153410.3390/sym13081534Search of the Shortest Path in a Communication Network with Fuzzy Cost FunctionsLissette Valdés0Alfonso Ariza1Sira M. Allende2Alicia Triviño3Gonzalo Joya4Electronic Technology Department, ETSI Telecommunication, Málaga University, 29071 Málaga, SpainElectronic Technology Department, ETSI Telecommunication, Málaga University, 29071 Málaga, SpainApplied Mathematics Department, Mathematics and Computer Science Faculty, Havana University, Havana 10200, CubaElectronic Technology Department, ETSI Telecommunication, Málaga University, 29071 Málaga, SpainElectronic Technology Department, ETSI Telecommunication, Málaga University, 29071 Málaga, SpainA communication network management system takes the measurements of its state variables at specific instants of time, considering them constant in the interval between two consecutive measurements. Nevertheless, this assumption is not true, since these variables evolve in real time. Therefore, uncertainty is inherent in the processing of the measurements during the intervals so that they cannot be efficiently managed using crisp variables. In this paper, we face this problem by modeling the communications network as a type-V fuzzy graph, where both the nodes and the links are described with precision, but the cost of each link is modeled as a triangular fuzzy number. Different fuzzy cost allocation functions and fuzzy optimization strategies are described and applied to the search for the shortest path between two nodes. An experimental study has been conducted using two representative networks: the backbone network of Nippon Telegraph and Telephone Corporation (NTT) and the National Science Foundation’s Network (NFSNET). In these networks, our fuzzy cost functions and strategies have been compared with the well-known crisp equivalents. The optimal search strategies are based on the proposed Fuzzy Dijkstra Algorithm (FDA), which is described deeply. The simulation results demonstrate that in all cases the fuzzy alternatives surpass or equal the crisp equivalents with statistically significant values. Specifically, the so-called Strategy 8 presents the best throughput, as it significantly exceeds the performance of all those evaluated, achieving a Global Mean Delivery Rate (GMDR) close to 1.https://www.mdpi.com/2073-8994/13/8/1534routingtype-V fuzzy graphcommunication networkDijkstra algorithmtriangular fuzzy numbershortest path |
| spellingShingle | Lissette Valdés Alfonso Ariza Sira M. Allende Alicia Triviño Gonzalo Joya Search of the Shortest Path in a Communication Network with Fuzzy Cost Functions Symmetry routing type-V fuzzy graph communication network Dijkstra algorithm triangular fuzzy number shortest path |
| title | Search of the Shortest Path in a Communication Network with Fuzzy Cost Functions |
| title_full | Search of the Shortest Path in a Communication Network with Fuzzy Cost Functions |
| title_fullStr | Search of the Shortest Path in a Communication Network with Fuzzy Cost Functions |
| title_full_unstemmed | Search of the Shortest Path in a Communication Network with Fuzzy Cost Functions |
| title_short | Search of the Shortest Path in a Communication Network with Fuzzy Cost Functions |
| title_sort | search of the shortest path in a communication network with fuzzy cost functions |
| topic | routing type-V fuzzy graph communication network Dijkstra algorithm triangular fuzzy number shortest path |
| url | https://www.mdpi.com/2073-8994/13/8/1534 |
| work_keys_str_mv | AT lissettevaldes searchoftheshortestpathinacommunicationnetworkwithfuzzycostfunctions AT alfonsoariza searchoftheshortestpathinacommunicationnetworkwithfuzzycostfunctions AT siramallende searchoftheshortestpathinacommunicationnetworkwithfuzzycostfunctions AT aliciatrivino searchoftheshortestpathinacommunicationnetworkwithfuzzycostfunctions AT gonzalojoya searchoftheshortestpathinacommunicationnetworkwithfuzzycostfunctions |