Algorithms for Searching the Shortest Path and Its Modification

N. I. Listopad, I. A. Karuk and A. A. Hayder

Digital Transformation, 2016, issue 1

Abstract: The article presents an overview of the main trends and methods of searching the shortest path information transmission in the telecommunications networks. The basic algorithms and their modifications are described. Special attention is given to the modified Dijkstra's algorithm that takes into account QoS requirements. The modified algorithm and its UML diagram are presented.

Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
https://dt.bsuir.by/jour/article/viewFile/17/18 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:abx:journl:y:2016:id:17

Access Statistics for this article

More articles in Digital Transformation from Educational Establishment “Belarusian State University of Informatics and Radioelectronicsâ€
Bibliographic data for series maintained by Ð ÐµÐ´Ð°ÐºÑ†Ð¸Ñ ().