A precise solution to the shortest path optimization problem in graphs using Z-numbers

Basit Öğe Kaydı
dc.authorscopusidTofigh Allahviranloo / 8834494700
dc.authorwosidTofigh Allahviranloo / V-4843-2019
dc.contributor.authorGüner, Nurdoğan
dc.contributor.authorOrhan, Halit
dc.contributor.authorAllahviranloo, Tofigh
dc.contributor.authorUsanmaz, Bilal
dc.date.accessioned2025-04-18T07:37:01Z
dc.date.available2025-04-18T07:37:01Z
dc.date.issued2024
dc.departmentİstinye Üniversitesi, Mühendislik ve Doğa Bilimleri Fakültesi, Yazılım Mühendisliği Bölümü
dc.description.abstractCommunication networks are exposed to internal or external risks that can affect all or part of the system. The most important components that form the infrastructure of these systems are routers, which act as nodes. In the field of graph theory, there are sophisticated techniques that can be used to optimize the path of a packet as it travels through various routers from its origin to its destination. A notable example of such an algorithm is Dijkstra’s algorithm, which is designed to efficiently determine the shortest path. The algorithm works under the assumption that the system operates under ideal conditions. Real-time systems can perform better if risk factors and optimal conditions are taken into account. The relationship between the nodes can be expressed by various metrics such as distance, delay, and bandwidth. The aforementioned metrics facilitate the calculation of the optimal path, with the ultimate objective of achieving low-latency networks characterized by rapid response times. Round-trip time (RTT) can be employed as a metric for measuring enhancements in a range of latency types, including those associated with processing, transmission, queuing, and propagation. The use of Z-numbers was employed in this study to incorporate risk into the optimal path metric. RTT was the preferred metric and reliability was represented by fuzzy linguistic qualifiers. A comparison of several scenarios was shown using a numerical example of a communication network. It is expected that this study will have a significant impact on the evolution from models that consider only ideal conditions to real-time systems that include risks using Z-numbers. © 2024 the Author(s).
dc.identifier.citationGüner, N., Orhan, H., Allahviranloo, T., & Usanmaz, B. (2024). A precise solution to the shortest path optimization problem in graphs using Z-numbers. AIMS Mathematics, 9(11), 30100-30121.
dc.identifier.doi10.3934/math.20241454
dc.identifier.endpage30121
dc.identifier.issn24736988
dc.identifier.issue11
dc.identifier.scopusqualityQ1
dc.identifier.startpage30100
dc.identifier.urihttp://dx.doi.org/10.3934/math.20241454
dc.identifier.urihttps://hdl.handle.net/20.500.12713/6464
dc.identifier.volume9
dc.identifier.wosWOS:001342882100009
dc.identifier.wosqualityQ1
dc.indekslendigikaynakScopus
dc.indekslendigikaynakWeb of Science
dc.institutionauthorAllahviranloo, Tofigh
dc.institutionauthoridTofigh Allahviranloo / 0000-0002-6673-3560
dc.language.isoen
dc.publisherAmerican Institute of Mathematical Sciences
dc.relation.ispartofAIMS Mathematics
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectDijkstra Algorithm
dc.subjectZ-Graph
dc.subjectZ-Cost
dc.subjectZ-Ranking
dc.subjectZ-Number
dc.titleA precise solution to the shortest path optimization problem in graphs using Z-numbers
dc.typeArticle

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim
İsim:
10.3934_math.20241454.pdf
Boyut:
3.9 MB
Biçim:
Adobe Portable Document Format
İndir
Lisans paketi
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
İsim:
license.txt
Boyut:
1.17 KB
Biçim:
Item-specific license agreed upon to submission
Açıklama:
İndir

Koleksiyon

Yazılım Mühendisliği Bölümü Makale Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu
WoS İndeksli Yayınlar Koleksiyonu