Analysis of ports reliabilities
G. Sh. Tsitsiashvili
2008, issue 2, P. 223–228
|Asymptotical formulas for reliabilities of statical networks with unreliable arcs are obtained and their application to life time models is shown. Graphs with fixed initial and final nodes - ports are considered. Direct calculation of reliabilities for these models demands geometrically increasing volumes of arithmetical operations by numbers of arcs. Parameters of obtained asymptotical formulas are length of shortest way, minimal ability to handle of cross sections. Fast algorythms of these parameters calculations are constructed. These algorythms allow to analyze an influence of some elements parameters on reliability of complete network and to obtain conditions of invariance when this influence is absent. Narrow places of random networks are defined also. Recursively defined ports are constructed. These ports and structures are very interesting in modern surface physics, solid state physics and nanotechnology. Asymptotica formulas and algorythms of their reliability calculations with linear complexity are constructed.|
Keywords: port, reliability, asymptotical analysis, shortest way, ability to handle
Download the article (PDF-file)
| G. Sh. Tsitsiashvili, “Asymptotic Analysis of Logical Systems with Anreliable Elements”, Reliability: Theory and Applications, 2:1 (2007), 34–37.|
 Nadezhnost' texnicheskix sistem: Spravochnik, red. I. A. Ushakova, Radio i svyaz', M., 1985, 608 s.
 I. A. Ryabinin, Nadezhnost' i bezopasnost' strukturno-slozhnyx sistem, izd-vo S.-Peterb. un-ta, SPb., 2007, 276 s.
 T. Kormen, Ch. Lejzerson, R. Rivest, Algoritmy: postroenie i analiz, Laboratoriya Bazovyx Znanij, M., 2004, 955 s.