CC BY
16
A HEURISTIC METHOD FOR RELIABILITY REDUNDANCY OPTIMIZATION OF FLOW NETWORKS
Kumar Pardeep * and Chaturvedi D.K. ** •
Department of Instrumentation, Kurukshetra University, Kurukshetra, - 136 119, India e-mail: [email protected]*, [email protected]** Corresponding author
Pahuja G.L. •
Department of Electrical Engineering, National Institute of Technology, Kurukshetra - 136 119, India e-mail: [email protected]
ABSTRACT
In flow networks, from the quality and service management point of view, measurement of the transmission ability of a network to meet the customers demand is very important. To meet the ultra high reliable requirements of such networks, a heuristic method for reliability redundancy optimization of flow networks using composite performance measure (CPM) integrating reliability and capacity has been proposed. The method is based upon the selection of main flow paths and backup paths and then optimizing main paths on priority basis. Thus, the reduced computation work makes the proposed algorithm suitable for designing of large, reliable telecommunications networks.
Keywords: flow networks; capacity related reliability; constrained redundancy optimization; heuristic algorithm.
1 INTRODUCTION
Constrained reliability redundancy optimization of networks has generally been studied with reliability as connectivity measure. The practical systems such as computer networks, telecommunication networks, transportation systems, electrical power transmission networks, internet etc. can only transport limited amount of flow therefore these are termed as flow limited networks. To meet the ultra high reliability requirements of such networks, a heuristic method for reliability redundancy optimization of flow networks has been proposed.
Literature is enriched with reliability redundancy optimization of networks with connectivity only as a measure of performance (Sharma & Venkateswaran 1971, Aggarwal 1976, Golden & Magnanti 1977, Gopal et al. 1978, Lee 1980, Bodin et al. 1982, Xue 1985, Dinghua 1987, Fredman & Tarjan 1987, Kim & Yum 1993, Shen 1995, Martins & Santos 1997, Schrijver 1998, Ahuja 1998, Kuo & Prasad 2000, Kuo et al. 2001, Park et al. 2004, Pascoal et al. 2005, Kumar et al. 2009, 2010a, b, 2011). However, reliability redundancy optimization of flow networks has rarely been studied. In present days context existing methods do not fulfil the requirements of management of quality of service. The reliability redundancy optimization techniques discussed in Gopal et al. (1978), Dinghua (1987), Kim & Yum (1993), Shen (1995), Park et al. (2004), Kumar et al. (2009, 2010a, b, 2011) are not suited to flow networks. This paper presents a technique for reliability redundancy optimization of flow networks using combined performance measure named capacity related reliability (CRR).
A path is a sequence of arcs and nodes connecting a source to a sink. All the arcs and nodes of network have its own attributes like delay, reliability and capacity etc.. From the quality and service management point of view, measurement of the transmission ability of a network to meet the customers demand is very important (Lin 2006). When a given amount of flow is required to be transmitted through a flow network, it is desirable to optimize the network reliability to carry the desired flow. In such cases, the system reliability is the measure of quality of the system capability to transmit desired flow. The capacity of each arc (the maximum flow passing the arc per unit time) has two levels, 0 and/or a positive integer. The system reliability is the probability that the maximum flow through the network between the source and the sink is not less than the demand (Golden & Magnanti 1977, Lee 1980, Bodin et al. 1982, Fredman & Tarjan 1987, Ahuja 1998, Lin
2003, 2004, Pahuja 2004, Lin 2006, 2007a, b). For determining the reliability it is generally assumed that network is capable of transmitting any required amount of flow between source (s) and terminal (t) nodes of the network. This presumption is neither valid nor justifiable for real life systems as links and nodes can carry only limited amount of flow. In 1980 Lee did the pioneer work of integrated both capacity and reliability & named it combined performance measure as capacity related reliability (CRR) and also termed such networks as flow networks. Max-Flow-Min-Cut theorem has been used to determine the capacity of the network (Sharma & Venkateswaran 1971, Xue 1985, Shen 1995, Martins & Santos 1997, Schrijver 1998, Lin 2003,
2004, Park et al. 2004, Lin 2006, 2007a, b).
2 COMPOSITE PERFORMANCE MEASURE
Reliability under flow constraint is a more realistic performance measure for flow networks. The concept of weighted reliability introduced by Aggarwal (1976) requires that all the successful states qualifying connectivity measure of the network be enumerated. The probability of each success state is evaluated and is multiplied by the normalized weight (Aggarwal 1985). Rushdi (1988) evaluated the same performance index as evaluated by Aggarwal 1985 using decomposition approach. Methods given by Aggarwal (1985), Rushdi (1988), and Shakti (1995) generate both cancelling (failed) and non-cancelling (success) terms.
The following section presents a heuristic algorithm for reliability redundancy optimization of flow networks using composite performance measure (CPM) and the method has been utilized to determine the capacity related reliability performance index.
2.1 Notation
al(X) Sensitivity factor of lth minimal path set
bi(xi) Subsystem selection factor for ith subsystem with xf components Cj Total amount of resource j available
gj (x.)/
! ! Amount of resources-j consumed in subsystem-i with xt components / Cost of
cji(x)
subsystem i for jth constraint.
h(.) Function yielding system reliability; dependent on number of subsystems (n) and configuration of subsystems
k Number of constraints, j = 1, 2,..., k
L(x) (Lx ,L ,..., Lx ), Lower limit of each subsystem i,
m Number of main minimal path sets, l = 1, 2,., m n Number of subsystems, i = 1, 2,., n P lth minimal path set of the system
Ps (l1,l2, ■■■,lmmy. priority vector s.t. l1 and lmm are the number of minimal path sets arranged
in decreasing order of path selection parameter al(X).
Q(x) Unreliability of subsystem i with x, components. r Reliability of a component at subsystem i. R(x) Reliability of subsystem i with xi components.
Rr Residual resources [total resource available (CJ) - resources consumed (Xg J x,)] Rs (X) System reliability
S(x) Set of variables that have been used as key-elements in a given decomposed expressions
U(x) (Ux ,U ,...,Ux ), Upper limit of each of subsystem i, x* Optimal solution
xt Number of components in subsystem i; i = 1,2,.. ..n X A vector (x},.........xn)
AR Increment in ith stage reliability when a unit is added in parallel to the ith stage
2.2 Assumptions
Following are the assumptions for the rest of the sections:
1. The system and all its subsystems are coherent.
2. Subsystem structures (other than coherence) are not restricted.
3. The networks are modelled with the help of graphs, the paths (ordered pair of arcs and the members of the ordered pair are reliability and capacity respectively) where in are assigned as the weight of each link.
4. Each link can have only two stages up and down.
5. The network nodes are perfect. If the nodes are not perfect, the method needs to be modified to deal with nodes failures.
6. All component states are mutually and statistically independent.
7. All constraints are separable and additive among components.
8. Each constraint is an increasing function of x, for each subsystem.
9. Redundant components cannot cross subsystem boundaries.
2.3 Composite Performance Measure (CPM)
The weighted reliability measure i.e. composite performance measure (CPM), integrating both capacity and reliability may be stated as by [27, 28]:
CPM = TotiR (1)
ieS(x)
Where rot; is the normalized weight and is defined as:
Ot, = Capi / Capmax
i.e. the ratio of capacity in the ith state to the maximum capacity (Capmax) of the system and Ri probability of the system being in state Si and is computed as:
R, = Pr{S,}= n PJ x nqk (2)
J / Sj =1 k / Sik =0
2.4 Capacity Functions of Networks
The capac ity function of different arcs connected in parallel is [25]:
C(X )par = Z Cap, (3)
iex
and the capacity function of different arcs connected in series is:
C(X )ser = min{ Cap } (4)
The rules for connecting series and parallel arcs to integrate capacity and reliability to give composite performance measure are expressed as:
CR (X )Ser = { min Cap,} n r, (5)
iex i=1
n n (6)
CR (X )par = Z Cap,. U ri i = 1 i = 1
CPM for series and parallel networks can be defined as:
CPMpar = CR(X)par / Capmax (7)
and CPMser = CR(X)ser / Capmax (8)
3 PROBLEM FORMULATION AND HEURISTIC METHOD
3.1 Problem Formulation
The general constrained redundancy optimization problem in complex systems can be reduced to the following integer programming problem (Kuo et al. 2001):
Maximise
Rs(X) = h(R^),..., Rn(xn)), (9)
(10)
subject to 2 g/ (x, ) < Cj, j = 1, 2, ..., k
i = 1
and 1 < xt <Uxi, i = 1, 2, ..., n.
3.2 Proposed Heuristic Method
In real life systems all the arcs are not simultaneously connected to carry flow from source to sink. Hence a flow path set is the arcs and nodes that actually carry traffic. In these practical systems all the path sets are not utilized for transfer of information (Hayashi & Abe 2008). The flow is transmitted through the main path(s) and in case of failure of this path(s), a backup path completes the task of main path. The backup path(s) come in operation only when the main paths fail thus, enhancing the reliability of the network, it is presumed that the main path(s) and backup path(s) for the network are known. The proposed algorithm first optimizes the main path(s) and then back up path(s) using redundancy optimization technique. This leads to more efficient use of resources which are generally limited. Unlike existing heuristics, a stopping criterion has been applied to switch from reliability redundancy optimization of main path(s) to reliability redundancy optimization of backup paths. The algorithm considers sensitivity factor as the criteria for selecting the main path from the list of given main paths and then a subsystem for applying redundancy within the chosen flow path.
3.3 Steps of the Proposed Method
Step1: Firstly select the main path sets m and back up flow paths of the flow Network.
Step2: Let xi = 1 for all i; i = 1, 2,..., n.
Step3: Calculateat(X), l = 1, 2,., m for each minimal path set and find l* such that ai*( X ) = max [ a, (X) ] and
n R (xt)
al (X ) =-r^-,
S L( g/ (Xi)/ kCj)
ieP, j =1
l = 1,2,3.........m.
Step4: For the chosen minimal path set - l* find i such that b** (x* ) = max [ bi (xi) ] and
= AR .
bi(Xi) = 1 , for each i e Pi
2(gj (Xi)/kCj)
j=1
where AR = (1 - Q2 i (Xi))-R (x )
Step5: Check, by adding one redundant subsystem to unsaturated subsystem i :
i) if no constraints are violated, add one redundant subsystem to unsaturated subsystem i by replacing with x., +1, and go to step 3.
ii) if at least one constraint is exactly satisfied and others are not violated, then add one
•* 1 *
redundant subsystem to unsaturated subsystem i by replacing x* with x.„ +1. The x = X is the
optimal solution. Go to step 6.
iii) if at least one constraint is violated, then remove minimal path set l* from further
consideration and consider the next path having maximum al* (X) value and go to step 4.
*
iv) if all minimal path sets are now excluded from further consideration, then X = X is the optimal solution; else go to step 3
Step6: In case any resources are still available optimize the backup paths as discussed in
Step2.
Step4: Evaluate the composite performance measure (CPM) for each subsystem of the network.
Step5: Evaluate the system reliability using the CPM of the each subsystem. 4 COMPUTATION AND RESULTS
To illustrate the performance of the proposed algorithm a network having six arcs {x1, x2, x3, x4, x5, x6} and five minimal path sets {y1, y2, y3, y4, y5} as shown in the Figure 1 is considered and solved for capacity related redundancy reliability optimization using CPM (7 and 8). System reliability is determined using Bayes method. The network shown in Figure 1 is a bench mark problem, considered by Hayashi & Abe (2008).
Using Baye's method, the Reliability of the above system can be expressed as:
RS(X) = R3 [1- Q6 {1-OQ1Q2X1-Q4Q5)}] (11)
+ Qs[1-(1-R2R5)(1-RIR4)]*Q6
Figure 1 Illustration Network
The simple minimal path sets of the Network are
P1 = {1, 3, 5}, P2 = {2, 3, 4}, P3 = {1, 4}, P4 = {6}, P5 = {2, 5}
The problem is solved for data given in Table 1. Using this initial data the general problem of constrained reliability redundancy allocation has been solved using the steps discussed in Section 3.3 above. The problem is solved by considering the flow path sets P1, P2, P3 and P4 as main path sets and P5 as backup path. The proposed algorithm gives the optimal solution (3, 1, 1, 2, 1, 4) with system reliability Rs = 0.999998458, the optimized subsystem reliability probability Ri and unreliability probabilities Qi are shown in Table 2.
Table 1 Data for Fig. 1
i 1 2 3 4 5 6
ri 0.70 0.75 0.8 0.85 0.7 0.9
gi1 / cli 2 3 2 3 1 3
C1 30
Table 2 Optimized subsystem reliability/unreliability for Fig. 1
i Xl X2 X3 x4 x5 X6
X* 3 1 1 2 1 4
Ri 0.973 0.75 0.8 0.9775 0.7 0.9999
Qi 0.027 0.25 0.2 0.0225 0.3 0.0001
The capacity of each subsystem of the flow path is taken as 100 and the capacity of flow paths of the network is determined using proposed approach as:
P1 =min {3*100, 100, 100} =100 P2 =min {100, 100, 100} =100 P3 =min {3*100, 2*100} =200 P4 =min {4*100} =400
(12)
/
Next the composite performance measure CPM expression (13) is derived using (7 and 8) and the value for CPM for an assumed flow of 200 is suppose to pass through the flow path and it comes out to be 1.0000 .
CPMp, = [R, R 3*5 ] (13)
Cap max
= (100/200) x 0.973 x 0.8 x 0.7 = 0.27244 CPMK = [ * 2 R3 R4] (14)
Cap max
= (100/200) x 0.75 x 0.8 x 0.9775 = 0.29325 CPM P3 = min Cap i [ R1R4] (15)
Cap max
= (200/200) x 0.973 x 0.9775 = 0.9511075 CPMP4 = [ R6] (16)
Cap max
= (400/200) x 0.9999
= (2) x 0.9999 as 0 < (min Cap,/ Capmax ) < 1 so = 1x 0.9999 = 0.9999
Composite performance measure integrating the reliability with capacity is calculated as:
CPMNetwork = 1- (1-CPMP1) (1-CPMP2) (1-CPMP3) (1-CPMP4)
= 1- (1-0.27244) x (1-0.29325) x (1- 0.9511) x (1- 0.9999)
= 1.0000
The above result shows that proposed method is capable of optimizing the flow network to transport the desired capacity through the network with highest reliability. However, the selection of main paths and backup paths will affect the quality of composite performance measure. Hence the proper choice of these paths may be done using cardinality criteria (Kumar et al. 2010b) or any other hierarchical measures of importance.
5 CONCLUSIONS
This paper has presented a new model for designing reliable flow networks capable of transmitting required flow. The proposed algorithm utilizes the concept of main and backup flow paths. The choice of backup and flow paths is application specific and paths with minimum cardinality may be selected as main path and disjoint paths can be the backup paths. The numerical example demonstrates that the proposed algorithm is fast for designing large, reliable telecommunications networks because the task of optimization is reduced, as only few paths are selected as main paths.
REFERENCES
Sharma J. and Venkateswaran K. V. 1971, "A direct method for maximizing the system reliability," IEEE Trans. Reliability, vol. R-20, no. 1, pp. 256-259.
Aggarwal K. K. 1976, "Redundancy optimization in general system IEEE Trans. Reliability, vol R-25, pp. 330-332.
Golden B. L. and Magnanti T. L. 1977, "Deterministic network optimization: A bibliography," Networks, vol. 7, no. 2, pp. 149-183.
Gopal K., Aggarwal K. K., and Gupta J. S. 1978, "An improved algorithm for reliability optimization," IEEE Trans. Reliability, vol. R-27, no. 5, pp.325-328.
Lee S. H. 1980, "Reliability Evaluation of Flow Networks'', IEEE Tr. Rel. Vol. R-29, pp.
24-26.
Bodin L. D., Golden B. L., Assad A. A., and Ball M. O. 1982, "Routing and scheduling of vehicles and crews: the state of the art," Computers and Operations Research, vol. 10, no. 2, pp. 63-211.
Aggarwal K. K. 1985, "Integration of Reliability and Capacity in Performance Measure of Telecommunication Network", IEEE Trans. Reliability, vol. R-34, pp. 184-186.
Xue J. 1985, "On multistate system analysis," IEEE Trans. Reliability, vol. 34, no. 4, pp. 329-337.
Dinghua S. 1987, "A new heuristic algorithm for constrained redundancy-optimization in complex systems," IEEE Trans. Reliability, vol. R-36, no.5, pp. 621-623.
Fredman M. L. and Tarjan R. E. 1987, "Fibonacci heaps and their uses in improved network optimization algorithms," J. ACM, vol. 34, no. 3, pp. 596-615.
Rushdi M. 1988, "Performance Indexes of Telecommunication Networks", IEEE Trans. Reliability, vol. R-37, pp. 57-64.
Rai S., and Soh S. 1991, "A computer Approach for Reliability Evaluation of Telecommunication networks with heterogeneous Link capacities", IEEE trans. On Reliability, Vol. 40, pp 441-451.
Kim J. H. and Yum B. J. 1993, "A heuristic method for solving redundancy optimization problems in complex systems," IEEE Trans. Reliability, vol. 42, no. 4, pp. 572-578.
Varshney, Joshi, and Chang A. R. 1994, "Reliability modeling and performance evaluation of variable link capacity networks", IEEE Trans. Reliability, vol. 43(3), pp. 378-382.
Shen Y. 1995, "A new simple algorithm for enumerating all minimal paths and cuts of a graph," Microelectronics and Reliability, vol. 35, no. 6, pp. 973-976.
Shakti K. 1995, "Some Aspects of Reliability Related Performance Evaluations of Computer Communication Networks'', Ph.D. Thesis, Kurukshetra University, Kurukshetra.
Martins E. D. Q. V. and Santos J. L. E. D. 1997, "An algorithm for the quickest path problem," Operations Research Letters, vol. 20, no. 4, pp. 195-198.
Schrijver 1998, Theory of Linear and Integer Programming. NY: John Wiley & sons, pp. 155-156.
Ahuja R. K. 1998, "Minimum cost-reliability ratio problem," Computers and Operations Research, vol. 16, no. 1, pp. 83-89.
Kuo W. and Prasad V. R. 2000, "An Annotated Overview of System-Reliability Optimization", IEEE Trans. Reliability, vol. 49(2), pp.176-187.
Kuo, W. Prasad, R., Tillman, F.A. and Hwang, C.L. 2001 Optimal Reliability Design Fundamentals and Applications, Cambridge University Press.
Lin Y. K. 2003, "Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network," Computers and Operations Research, vol. 30, no. 4, pp. 567-575.
Park C. K., Lee S., and Park S. 2004, "A label-setting algorithm for finding a quickest path," Computers and Operations Research, vol. 31, no. 14, pp. 2405-2418.
Lin Y. K. 2004, "Reliability of a stochastic-flow network with unreliable branches & nodes
under budget constraints," IEEE Trans. Reliability, vol. 53, no. 3, pp. 381-387.
Pahuja G. L. 2004, "Reliability Evaluation and Optimization Recent and New Approaches", Ph.D. thesis, Kurukshetra University, Kurukshetra.
Pascoal M. M. B., Captivo M. E. V., and Climaco J. C. N. 2005, "An algorithm for ranking quickest simple paths," Computers and Operations Research, vol. 32, no. 3, pp. 509-520.
Lin Y. K. 2006, "Reliability of a computer network in case capacity weight varying with arcs, nodes and types of commodity", Reliability Engineering and System Safety, vol. 2(5), pp. 1-7.
Lin Y. K. 2007,
a. "Reliability evaluation for an information network with node failure under cost constraint," IEEE Trans. Systems, Man and Cybernetics-Part A: Systems and Humans, vol. 37, no. 2, pp. 180-188.
b. "On a multi-commodity stochastic-flow network with unreliable nodes subject to budget constraint," European Journal of Operational Research, vol. 176, no. 1, pp. 347-360.
Hayashi M. and Abe T. 2008, "Evaluating Reliability of Telecommunications Networks Using Traffic Path Information", IEEE Trans. Reliability, vol. 57(2), pp. 283-294, 2008. pp. 283294.
Kumar P., Chaturvedi D. K. and Pahuja G. L. 2009, Heuristic algorithm for constrained redundancy reliability optimization and performance evaluation. Proc. IMechE, Part O: J. Risk and Reliability, vol. 223 (4), 381-386.
Kumar P., Chaturvedi D. K. and Pahuja G. L. 2010,
a. "Heuristic Methods for Solving Redundancy Allocation in Complex Systems", Int. J. of Reliability and Safety, vol. 4, No. 2/3, pp. 285-298.
b. "An efficient heuristic algorithm for determining optimal redundancy allocation of complex networks", Reliability Theory and Applications, vol. 3(18), pp.15-28.
Kumar P., Chaturvedi D. K. and Pahuja G. L. 2011, "Constrained Reliability Redundancy Optimization of Complex Systems using Genetic Algorithm", MIT Int. J of Electrical and Instrumentation Engineering, vol. 1, No. 1, pp. 41-48.
