A mathematical model is developed for the reliability of a system made up of m unreliable nodes arranged in a ring. The model can be used to calculate the reliability of single-ring networks in which the network recovery mechanism depends on bypassing failed stations, but link signal power margins are inadequate to overcome losses due to more than n bypass switches in series. Computational complexity is 0(n/sup 2/m+nm/sup 2//2) in time, and 0(m/sup 2//2) in memory requirements. >
['W.P. Dotson', 'Frederick Norwood', 'Charles Taylor']
Reliability polynomial for a ring network