CC BY
10
COMPARISON ANALYSIS OF RELIABILITY OF NETWORKS WITH IDENTICAL EDGES
G.Tsitsiashvili
640041, Russia, Vladivostok, Radio str. 7, IAM, FEB RAS, e-mail: [email protected],
ABSTRACT
Efficient and fast algorithms of parameters calculation in Burtin-Pittel asymptotic formula for networks with identical and high reliable edges are constructed. These algorithms are applied to a procedure of a comparison of networks obtained from a radial-circle network by a cancelling of some edges or their collapsing into nodes or by a separate reservation of these edges.
1 INTRODUCTION
A problem of a calculation of connection probabilities between nodes of a random graph is important and complicated problem in the probability theory. In general case it demands a number of arithmetical operations which increases as a geometric progression dependently on a number of the graph edges (Barlow et al. 1962), (Ushakov et al. 1985). So a construction of special methods of its complexity decreasing is actual in the reliability theory.
For random graphs with identical and high reliable edges there is the Burtin-Pittel asymptotic formula (see for example (Getsbakh, 2000)) which expresses a probability of a disconnection between initial and final edges via a minimal numberd of edges in the graph cuts and a numberc of cuts with d edges. Apparently one of the most convenient methods of a reliability calculation for graphs with identical edges is based on topological invariants (private communication of I. Gertsbakh). This method allows to calculate a network reliability directly as a polynomial of an edge reliability using the Monte-Carlo method. It allows to calculate integer coefficients c, d also. But the Monte-Carlo method is approximate and may give with a small probability a unit mistake in the coefficients definition. Such mistake may influence significantly on an accuracy of the Burtin-Pittel asymptotic formula.
This circumstance makes necessary to return to accuracy algorithms of Ford and Fulkerson (Ford et al. 1965) to calculate main asymptotic parameter d. In some cases these algorithms may be significantly simplified by a construction of some sufficient conditions in the Ford-Fulkerson problem. These conditions allow to define an influence of different connections - horizontal and vertical on a network reliability. As a result it is possible to find significant changes of the network reliability by its structural transformations like a cancelling of edges or their collapsing into nodes or their separate reservation. These considerations are made on an example of a radial-circle network with a few concentric circles.
Suppose that r = {U,W} is no oriented graph with the finite set u of nodes and the finite- set
W = {w = (u,v), u,v e U}. Assume that each edge w e W fails with the probability pw = 1 - pw, 0 < pw < 1, independently on all other edges. Denote Pr the disconnection (or failure probability) of the graph r .
Theorem 1. If pw (h) = h, w e W , then the Burtin-Pittel formula is true:
Pr ~chd , h ^ 0. (1)
2 NECESSARY VOLUME OF SEPARATE RESERVE
Suppose now that pw (h) = q = const, 0 < q < 1, w e w , and each graph edge has k -fold reserve. Such scheme of a separate reservation is analyzed detailed in [1]. Denote the graph r with k -fold reserve of each edge by rk and put N(s) = min(n: Prk < s), 0 < s < 1 . Theorem 2. The following asymptotic formula takes place:
N (s) ~ dS, s^ 0. (2)
d ln q
Proof: In the theorem 2 conditions the asymptotic formula (1) has the form
Prk ~ cqkd, k . (3)
Consequently for any s > 0 there is N1 = N1 (S) so that for k > N1 (S) the following inequality is true:
cqkd (1 - S)< Prk < cqkd (1 + S) . (4)
Fix s and suppose that s < PrN1 (s) then from the formula (4) obtain the inequalities
cqNsd (1 - S)< s < cq(Ns-1)d (1 + S) and so
lnc + N(s)dlnq + ln(1 -S)< lns < lnc + (N(s)-1)dlnq + ln(1+ S). Consequently obtain
lnc + ln (1 - S) + N(s)dln q > 1 > ln c + ln(1 + S) - dln q + N(s)dln q ln s ln s ln s ln s
and as a result the formula (2) takes place.
Remark that the asymptotic formula (1) for the failure probability Pr includes the constants c,d whereas the asymptotic formula (2) for the necessary volume of the separate reserve N(s) includes only the single constant d . To define the constant d it is sufficient to use the Ford-Falkerson algorithm (Ford et al. 1965) with a complexity proportional a cube of the edges number (Kormen et al. 2004). An accuracy calculation of the constant c is much heavier and reduces to NP - complete problem. Theorem 3. The following inequality is true:
, Jln(s/n)| fc.\
N (s)<^—-J1 +1. (5)
ln q
Proof. Indeed the probability Pr satisfies the inequality
PTk >(1 - qk )n > 1 - nqk
which leads to the formula (5).
Denote by rk the parallel connection of k independent copies of the graph r in initial and in final nodes and designate M(s) = inf(k:Prk > 1 -s) thenecessary volume of r block reserve. If the
graph r contains r acyclic ways from the initial to the final node and the minimal number of edges
1 - s
in these ways is 1 then m (s)>—r. Suppose that the graph r is a sequential connection of n
rpl
edges then it is easy to obtain that
m (s)> 1-s. (6)
P
In the formula (6) a low bound of M (s) is an increasing by n geometric progression. Analogous low bound may be obtained for a port r in which initial node u is connected with m nodes on the first floor, each node of the first floor is connected with s among m nodes of the second floor, and so on. All nodes on the 1 -th floor are connected with final node v , all edges are
directed from u to v. Such graph is called channel graph and is analyzed detailed in (Harms et al. 1995). The formulas (5), (6) allow to establish a strong asymptotic difference between the separate reserve and the block reserve. Comparison theorems of reliabilities of ports with these reserves have been established in (Barlow et al, 1962).
3 RADIAL-CIRCLE SCHEME
Consider a radial-circle graph r with m concentric circles, i radiuses and with independent edges which have failure probability pw = h .
3.1 Influence of structural changes on asymptotic of failure probability
Consider a probability Pr of a disconnection between the center u and the node v on internal circle of r . Say that circle edges provide horizontal connections and radial edges provide vertical connections in the graph r . Our problem is to analyze an influence of horizontal connections on the probability Pr if edges are high reliable and their failure probability h ^ 0 .
For a simplicity suppose that i > 3 then it is easy to find d = 3, c = 1 and the single cut with d = 3 edges consists of edges which end in the node v. As a result obtain thatPr ~ h3, h ^ 0 .
Suppose now that all circle edges have single reliability and so these edges may be collapsed into nodes. Then the graph r transforms in to a sequential connection of m parallel connections of i edges. Simple calculations show that then d = i, c=m and consequently Pr ~ mhl, h ^ 0 .
Suppose that all circle edges have zero reliability and so may be cancelled. The there is a single way between the nodes u,v which contains i edges. Consequently d = 1, c=mand so P r ~ mh , h ^ 0 .
Suppose that two circle edges connected with the node u have r -fold reserve, 2r +1 < i. Then we obtain d = 2 r +1, c = 1, Pr ~ h2r+1, h ^ 0 .
Consequently manipulations with a replacement of circle edges (which characterize horizontal connections) by absolutely reliable or absolutely unreliable or by r -fold reserves may influence significantly on the probability Pr.
3.2 Accelerated algorithm of the constant d calculation
The constant d calculation in general case has a cubic complexity and it is sufficiently large for all possible pairs of nodes. So a problem is to simplify this algorithm for some families of graphs. In (Tsitsiashvili, 2010) such simplification is made for a rectangle on a lattice. In this paper a radial-circle graph r with m concentric circles and i radiuses is considered.
Using the Ford-Falkerson theorem about an equality of maximal flow and minimal ability to handle of cuts (Ford et al. 1962) it is easy to obtain the inequality
d <S , S = min(au,av). (7)
Here au is the number of edges connected with the initial node u and av is the number of edges connected with the final node v. From the Ford-Falkerson theorem and from the inequality (7) we have that
d = s
if there are d independent (no intersected by edges) ways between the nodes u,v.
Use this sufficient condition to calculate the constant d . Denote Cu, Cv the circles which contain the nodes u,v and put Ru,Rv radiuses which contain u,v appropriately. Without a restriction of a generality suppose that Cu borders Cv. The constant d calculation. Suppose that i > 2 .
1) If the nodes u, v belong to an external circle then s = 3 and between u, v there are the following independent: two ways on the internal circle and a way via the center (Fig. 1) consequently d = 3.
2) If the nodes u, v belong to an internal circle then s = 4 and between u, v there are the following independent ways: two of them on the same circle, one way via the center and one way via external circle (Fig. 2). In this case we have d = 4 .
3) Suppose that u belongs to external circle and v to internal circle then s = 3. If u, v
belong to different radiuses then between u, v there are the following independent ways: the first
way is from u along Ru to Cv and then to v, the second way is along Cu to R and then to v,
the third way is along Cu to a radius which does not coincide with Ru, Rv then to the center and
then along Rv to v (Fig. 3a) consequently d = 3. If u, v belong to the same radius then there are
the following independent ways between u, v: the radial way, two ways along the external circle
to some radius then to the center and then along radius to v (Fig. 3b), consequently d = 3.
u u
4) Suppose that the nodes u, v belong to internal circles then s = 4 . Consider the case when these nodes belong to different radiuses.
If i = 3 then it is possible to construct the cut between u, v which consists of edges with ends on Cu and place on different radiuses (Fig. 4a) consequently d < 3. It is easy to prove that between u, v there are not cuts with two edges consequently d = 3.
If i > 3 then s = 4 and it is possible to find four independent ways between u, v (Fig. 4b) consequently d = 4 .
If the nodes u, v belong to the same radius then analogously it is possible to obtain that for i = 3 we have d = 3 , and for i > 3 we have d = 4 .
The constant c calculation.
Suppose that the node v is the center and the node u is on the mx-th concentric (from the center) circle, m1 < m . If i = 2 then c = mx. If i = 3 then for mx < m we have c = mx and for mx = m we have c = mx +1. Suppose that i = 4 then for mx < m we have c = mx +1 and for mx = m we have c = 1. Suppose that i > 4 then c = 1.
4 CONCLUSION
Remark that an application of Burtin-Pittel asymptotic formula for networks with identical and high reliable edges is sufficiently complicated procedure independently on considered (mainly heuristic arguments). So it is necessary to find some more arguments for the example of radial-circle network with a few concentric circles and radial edges with positive and fixed reliability and low reliable circle edges. This network may be considered using statements from (Tsitsiashvili et al. 2010)].
Consider the port r with fixed initial and final nodes u, v and the finite sets of nodes u and edges w . Suppose that the set w consists of no intersected subsets Wx, W2 where pw (h) = pw > 0, w e Wx,and forw eW2 we have pw (h0, h ^ 0. Denoter = {Rx,...,Rn} the set of all acyclic ways between u, v.
Theorem 4. If R1 c W1, R21W2 * 0,...,Rn IW2 * 0 then the connection probability
Pr (u, v) ^ n pw , h ^ 0 .
weR1
Using this theorem it is easy to obtain that Pr( u, v) may be approximated by a product of reliabilities of radial edges which belong to acyclic way between the nodes u, v. An accuracy and a performance of this approximation for the network with a single circle is discussed in (Tsitsiashvili et al. 2010).
The author thanks I Gerstbakh for useful discussions. Supported by Far Eastern Branch of RAS, projects 09-1-n2-07, 09-1-0MN-07.
REFERENCES
1. Barlow R.E., Proschan F. 1965. Mathematical Theory of Reliability. London and New York: Wiley.
2. Ford L.R., Fulkerson D.R. 1962. Flows in networks. Princeton university press. Princeton, New Jersey.
3. Gertsbukh I. 2000. Theory with Applications to Preventive Maintenance. Springer Verlag.
4. Harms D.D., Kraezl M. Colbourn C.J., Devitt J.S. Network reliability. Experiments with a Symbolic Algebra Environment. 1995. CRC Press. Inc.
5. Kormen T., Leizerson Ch., Rivest R. 2004. Algorithmes: construction and analysis. Moscow: Laboratory of basic knowledges.
6. Tsitsiashvili G.Sh. 2010. Asymptotic analysis of lattice reliability. Reliability: Theory and Applications. № 1: 65-70 pp.
7. Tsitsiashvili G.Sh., Losev A.S. 2010. Calculation of connectivity probability in recursively defined random networks. Reliability: Theory and Applications. V. 1 (16), № 1: 40-46 pp.
8. Ushakov I.A. et al. 1985. Reliability of technical systems: Handbook. Moscow: Radio and Communication.
