Title :
Analysis of network performability based on relations of network states
Author_Institution :
Dept. of Inf. & Eng., Beijing Univ. of Posts & Telecommun., China
Abstract :
The paper presents algorithms for network performability calculation based on the network state relations. According to the discussion of the relation of throughput in network states when there are different number of failed links, we obtain algorithms for calculating the exact value of the network performability. Based on the relations of the states in which the network has maximum and minimum throughputs, respectively, when there are different number of failed links, we obtain fast algorithms for determining the exact value, approximate value, and upper and lower bounds of network performability
Keywords :
approximation theory; telecommunication links; telecommunication network reliability; approximate value; exact value; failed links; fast algorithms; lower bound; maximum throughput; minimum throughput; network performance; network reliability; network states; upper bound; Algorithm design and analysis; Computer networks; Degradation; Large-scale systems; Performance analysis; Probability; Telecommunication traffic; Throughput;
Conference_Titel :
Communications, 1996. ICC '96, Conference Record, Converging Technologies for Tomorrow's Applications. 1996 IEEE International Conference on
Conference_Location :
Dallas, TX
Print_ISBN :
0-7803-3250-4
DOI :
10.1109/ICC.1996.533671
