DocumentCode
1209565
Title
Finding the Most Reliable Routes in Communication Systems
Author
Parikh, S.C. ; Frisch, I.T.
Author_Institution
Esso Research and Engineering Co., Madison, N.J
Volume
11
Issue
4
fYear
1963
fDate
12/1/1963 12:00:00 AM
Firstpage
402
Lastpage
406
Abstract
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.
Keywords
Channel capacity; Jamming; Linear programming; Mathematics; Military communication; Organizing; Relays; Reliability engineering; Stability; Symmetric matrices;
fLanguage
English
Journal_Title
Communications Systems, IEEE Transactions on
Publisher
ieee
ISSN
0096-1965
Type
jour
DOI
10.1109/TCOM.1963.1088787
Filename
1088787
Link To Document