Finding the Most Reliable Routes in Communication Systems

It is shown that the problem of finding the most reliable route between two stations in a communication system can be reduced to the problem of finding the shortest path between two nodes in a weighted linear graph. The known methods for finding the shortest path in a linear graph are extended to apply to any communication system, and simplified algorithms and computer subroutines are presented.