DocumentCode :
2795153
Title :
An efficient factoring algorithm for computing the failure-frequencies of telecommunications networks
Author :
Hayashi, Masahiro ; Abe, Takeo
Author_Institution :
NTT Corp., Tokyo, Japan
fYear :
2004
fDate :
26-29 Jan. 2004
Firstpage :
110
Lastpage :
115
Abstract :
This paper proposes and efficient algorithm for computing the failure frequencies of telecommunications networks. The proposed method is based on a special modification that transforms the formula for computing the reliability into a formula that also gives the failure frequency. A number of algorithms have been produced, and the factoring algorithm has been shown to be the most efficient. This algorithm has not yet been transformed, because its graph operations contraction and deletion of a link produce complicated expressions in the failure-frequency case. A new matrix-style decomposition formula is derived in this paper, and allows us to transform the factoring algorithm into an algorithm that gives failure frequency as well as reliability. Some numerical examples show that this new algorithm simultaneously computes both measures with high efficiency.
Keywords :
failure analysis; matrix algebra; telecommunication network reliability; efficient factoring algorithm; failure-frequencies; matrix-style decomposition formula; telecommunications networks; Cables; Computer networks; Frequency measurement; Matrix decomposition; Size measurement; Telecommunication computing; Telecommunication network reliability; Telegraphy; Telephony; Time measurement;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Reliability and Maintainability, 2004 Annual Symposium - RAMS
Print_ISBN :
0-7803-8215-3
Type :
conf
DOI :
10.1109/RAMS.2004.1285432
Filename :
1285432
Link To Document :
بازگشت