{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:14:15Z","timestamp":1761808455704,"version":"build-2065373602"},"reference-count":35,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2021,8,20]],"date-time":"2021-08-20T00:00:00Z","timestamp":1629417600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100009473","name":"Universidad de M\u00e1laga","doi-asserted-by":"publisher","award":["Own Research and Transfer Plan"],"award-info":[{"award-number":["Own Research and Transfer Plan"]}],"id":[{"id":"10.13039\/100009473","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>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\u2019s 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.<\/jats:p>","DOI":"10.3390\/sym13081534","type":"journal-article","created":{"date-parts":[[2021,8,22]],"date-time":"2021-08-22T23:00:09Z","timestamp":1629673209000},"page":"1534","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Search of the Shortest Path in a Communication Network with Fuzzy Cost Functions"],"prefix":"10.3390","volume":"13","author":[{"given":"Lissette","family":"Vald\u00e9s","sequence":"first","affiliation":[{"name":"Electronic Technology Department, ETSI Telecommunication, M\u00e1laga University, 29071 M\u00e1laga, Spain"}]},{"given":"Alfonso","family":"Ariza","sequence":"additional","affiliation":[{"name":"Electronic Technology Department, ETSI Telecommunication, M\u00e1laga University, 29071 M\u00e1laga, Spain"}]},{"given":"Sira M.","family":"Allende","sequence":"additional","affiliation":[{"name":"Applied Mathematics Department, Mathematics and Computer Science Faculty, Havana University, Havana 10200, Cuba"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7516-2878","authenticated-orcid":false,"given":"Alicia","family":"Trivi\u00f1o","sequence":"additional","affiliation":[{"name":"Electronic Technology Department, ETSI Telecommunication, M\u00e1laga University, 29071 M\u00e1laga, Spain"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9256-0870","authenticated-orcid":false,"given":"Gonzalo","family":"Joya","sequence":"additional","affiliation":[{"name":"Electronic Technology Department, ETSI Telecommunication, M\u00e1laga University, 29071 M\u00e1laga, Spain"}]}],"member":"1968","published-online":{"date-parts":[[2021,8,20]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1749","DOI":"10.1049\/el:20001154","article-title":"Strategies for updating link states in QoS routers","volume":"36","author":"Ariza","year":"2000","journal-title":"Electron. Lett."},{"key":"ref_2","first-page":"39","article-title":"Trapezoidal Fuzzy Numbers (a,b,c,d): Arithmetic Behavior","volume":"2","author":"Bansal","year":"2011","journal-title":"Int. J. Phys. Math. Sci."},{"key":"ref_3","first-page":"1190","article-title":"Arithmetic Operations on Generalized Trapezoidal Fuzzy Number and its Applications","volume":"3","author":"Banerjee","year":"2012","journal-title":"Turk. J. Fuzzy Syst."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/S0165-0114(01)00011-2","article-title":"Unified approach to fuzzy graph problems","volume":"125","author":"Blue","year":"2002","journal-title":"Fuzzy Sets Syst."},{"key":"ref_5","unstructured":"Rojas, I., Joya, G., and Catala, A. (2019). Searching the Shortest Pair of Edge-Disjoint Paths in a Communication Network. A Fuzzy Approach. Advances in Computational Intelligence, Springer International Publishing."},{"key":"ref_6","unstructured":"Vald\u00e9s, L., Ariza-Quintana, A., Alonso, S., and Joya-Caparr\u00f3s, G. (2021, July 31). An Implementation of the Dilkstra Algorithm for Fuzzy Costs (Technical Report). Available online: https:\/\/hdl.handle.net\/10630\/17478."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Rojas, I., Joya, G., and Gabestany, J. (2013). Study of Alternative Strategies to Selection of Peer in P2P Wireless Mesh Networks. Advances in Computational Intelligence, Springer.","DOI":"10.1007\/978-3-642-38682-4"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0020-7373(75)80002-2","article-title":"An experiment in linguistic synthesis with a fuzzy logic controller","volume":"7","author":"Mamdani","year":"1975","journal-title":"Int. J. Man Mach. Stud."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1016\/j.asoc.2013.10.012","article-title":"An improved ranking method for fuzzy numbers with integral values","volume":"14","author":"Yu","year":"2014","journal-title":"Appl. Soft Comput."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.1109\/49.536364","article-title":"Quality-of-service routing for supporting multimedia applications","volume":"14","author":"Zheng","year":"1996","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Guerin, R.A., Orda, A., and Williams, D. (1997, January 3\u20138). QoS routing mechanisms and OSPF extensions. Proceedings of the GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record, Phoenix, AZ, USA.","DOI":"10.1109\/GLOCOM.1997.644603"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1016\/S0031-8914(53)80099-6","article-title":"Routing High-bandwidth Traffic in Max-min Fair Share Networks","volume":"19","author":"Dirac","year":"1953","journal-title":"Physica"},{"key":"ref_13","unstructured":"Ma, Q., and Steenkiste, P. (1997, January 28\u201331). On Path Selection for Traffic with Bandwidth Guarantees. Proceedings of the IEEE International Conference on Network Protocols, Atlanta, GA, USA."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Tomovic, S., Radusinovic, I., and Prasad, N. (2015, January 8\u201311). Performance comparison of QoS routing algorithms applicable to large-scale SDN networks. Proceedings of the International Conference on Computer as a Tool (EUROCON 2015), Salamanca, Spain.","DOI":"10.1109\/EUROCON.2015.7313698"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1023\/A:1019810526535","article-title":"DORA: Efficient Routing for MPLS Traffic Engineering","volume":"10","author":"Boutaba","year":"2002","journal-title":"J. Netw. Syst. Manag."},{"key":"ref_16","unstructured":"Al-Jawad, A., Shah, P., Gemikonakli, O., Comsa, I.S., and Trestian, R. (July, January 29). Performance evaluation of routing strategies over multimedia-based SDNs under realistic environments. Proceedings of the 6th IEEE Conference on Network Softwarization (NetSoft), Ghent, Belgium."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"2447","DOI":"10.1007\/s00500-014-1572-6","article-title":"Peer selection in P2P wireless mesh networks: comparison of different strategies","volume":"19","author":"Montesinos","year":"2015","journal-title":"Soft Comput."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Umezaki, K., Spaho, E., Barolli, L., Xhafa, F., Younas, M., and Iwashige, J. (2012, January 12\u201314). An Integrated Fuzzy-based Trustworthiness System for P2P Communications in JXTA-Overlay. Proceedings of the 2012 Seventh International Conference on Broadband, Wireless Computing, Communication and Applications, Victoria, BC, Canada.","DOI":"10.1109\/BWCCA.2012.25"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1550147717707897","DOI":"10.1177\/1550147717707897","article-title":"Multi-hop clustering routing algorithm based on fuzzy inference and multi-path tree","volume":"13","author":"Tian","year":"2017","journal-title":"Int. J. Distrib. Sens. Netw."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.asoc.2015.12.012","article-title":"Improving hybrid ad hoc networks: The election of gateways","volume":"41","year":"2016","journal-title":"Appl. Soft Comput."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"2552","DOI":"10.1016\/j.eswa.2012.10.063","article-title":"Type-2 fuzzy decision support system to optimise MANET integration into infrastructure-based wireless systems","volume":"40","author":"Yuste","year":"2013","journal-title":"Expert Syst. Appl."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1601","DOI":"10.1016\/S0898-1221(03)00139-1","article-title":"The canonical representation of multiplication operation on triangular fuzzy numbers","volume":"45","author":"Chou","year":"2003","journal-title":"Comput. Math. Appl."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.1016\/j.asoc.2011.11.011","article-title":"Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment","volume":"12","author":"Deng","year":"2012","journal-title":"Appl. Soft Comput."},{"key":"ref_24","first-page":"117","article-title":"Railway Route Optimization System Using Fuzzy Dijkstra\u2019s Algorithm","volume":"9","author":"Mullai","year":"2016","journal-title":"Int. J. Appl. Math. Sci."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Agafonov, A., and Myasnikov, V.V. (2018, January 24\u201327). Vehicle routing algorithms based on a route reservation approach. Proceedings of the IV International Conference on Information Technology and Nanotechnology, Samara, Russia.","DOI":"10.1088\/1742-6596\/1096\/1\/012029"},{"key":"ref_26","unstructured":"Hajek, P., Godo, L., and Esteva, F. (2013). Fuzzy Logic and Probability. arXiv."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Zimmermann, H. (1991). Fuzzy Set Theory and Its Applications, Kluwer Academic Publishers.","DOI":"10.1007\/978-94-015-7949-0"},{"key":"ref_28","unstructured":"Klir, G.L., and Yuan, B. (1995). Fuzzy Sets and Fuzzy Logic. Theory and Applications, Prentice Hall PTR."},{"key":"ref_29","unstructured":"Rosen, E., Viswanathan, A., and Callon, R. (2021, July 31). RFC3031: Multiprotocol Label Switching Architecture. Available online: https:\/\/www.rfc-editor.org\/info\/rfc3031."},{"key":"ref_30","first-page":"9","article-title":"Cross-Layer Path Computation for Dynamic Traffic Grooming: In Mesh WDM Optical Networks","volume":"Volume 2","author":"Xin","year":"2005","journal-title":"Proceedings of the 43rd Annual Southeast Regional Conference\u2014ACM-SE 43"},{"key":"ref_31","unstructured":"Varga, A. (2021, June 01). OMNeT++ Discrete Evente Simulator. Available online: https:\/\/omnetpp.org\/."},{"key":"ref_32","unstructured":"Ariza, A. (2021, June 01). Flow Simulator to Test QoS Wired Protocols. Available online: https:\/\/github.com\/aarizaq\/flowsimulator."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1057\/jors.2010.138","article-title":"Solving multi-objective multicast routing problems by evolutionary multi-objective simulated annealing algorithms with variable neighbourhoods","volume":"62","author":"Xu","year":"2011","journal-title":"J. Oper. Res. Soc."},{"key":"ref_34","unstructured":"Foundation, N.S. (2021, June 01). Review of NSFNET, Available online: https:\/\/www.nsf.gov\/pubs\/stis1993\/oig9301\/oig9301.txt."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.jda.2017.01.001","article-title":"Hybrid Bellman\u2013Ford\u2013Dijkstra algorithm","volume":"42","author":"Dinitz","year":"2017","journal-title":"J. Discret. Algorithms"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/8\/1534\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:47:48Z","timestamp":1760165268000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/8\/1534"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,20]]},"references-count":35,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2021,8]]}},"alternative-id":["sym13081534"],"URL":"https:\/\/doi.org\/10.3390\/sym13081534","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2021,8,20]]}}}