Abstract
This paper presents two algorithms for determining the most reliable paths of a communication network, taking into account both the reliabilities of nodes and links. A network is modeled by a linear graph. The first algorithm adapts a node labeling scheme; second is based on the shortest-path matrix algorithm. Both algorithms can be applied to oriented and nonoriented nonsymetric networks. The numerical examples confirm that both algorithms efficiently handle networks with hundreds of nodes and edges. The total amount of computation, expressed by the number of multiplications and comparisons, increases in the labeling procedure with the square of the number of nodes, and in the matrix method with the cube of the number of nodes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.