Two Algorithms for Determining the Most Reliable Path of a Network

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… (More)

Topics

1 Figure or Table

Slides referencing similar topics