Title :
Reliability polynomial for a ring network
Author :
Dotson, William ; Norwood, Frederick ; Taylor, Charles
Author_Institution :
Dept. of Math., East Tennessee State Univ., Johnson City, TN, USA
fDate :
6/1/1993 12:00:00 AM
Abstract :
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(n2m+nm2/2) in time, and 0(m2/2) in memory requirements
Keywords :
polynomials; reliability; switching theory; telecommunication networks; bypass switches; computational complexity; link signal power margins; mathematical model; memory requirements; network recovery; reliability polynomial; ring network; unreliable nodes; Bit error rate; Communication networks; Computational complexity; Maintenance; Mathematical model; Polynomials; Power system modeling; Power system reliability; Switches; Telecommunication network reliability;
Journal_Title :
Communications, IEEE Transactions on
