A Software Cost Model with Reliability Constraint under Two Operational Scenarios Satoru UKIMOTO and Tadashi DOHI Department of Information Engineering,

Slides:



Advertisements
Similar presentations
Differential Equations
Advertisements

Unità di Perugia e di Roma “Tor Vergata” "Uncertain production systems: optimal feedback control of the single site and extension to the multi-site case"
Reliability Engineering (Rekayasa Keandalan)
1 12. Principles of Parameter Estimation The purpose of this lecture is to illustrate the usefulness of the various concepts introduced and studied in.
1 Chapter 5 Continuous time Markov Chains Learning objectives : Introduce continuous time Markov Chain Model manufacturing systems using Markov Chain Able.
Lecture 8 – Nonlinear Programming Models Topics General formulations Local vs. global solutions Solution characteristics Convexity and convex programming.
A Unified Scheme of Some Nonhomogenous Poisson Process Models for Software Reliability Estimation C. Y. Huang, M. R. Lyu and S. Y. Kuo IEEE Transactions.
Visual Recognition Tutorial
1 Software Reliability Growth Models Incorporating Fault Dependency with Various Debugging Time Lags Chin-Yu Huang, Chu-Ti Lin, Sy-Yen Kuo, Michael R.
Optimization in Engineering Design 1 Lagrange Multipliers.
Maximum likelihood (ML) and likelihood ratio (LR) test
Maximum likelihood Conditional distribution and likelihood Maximum likelihood estimations Information in the data and likelihood Observed and Fisher’s.
Maximum likelihood (ML) and likelihood ratio (LR) test
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Exponential distribution Reliability and failure rate (Sec )
Visual Recognition Tutorial
Linear and generalised linear models
Constrained Optimization Rong Jin. Outline  Equality constraints  Inequality constraints  Linear Programming  Quadratic Programming.
Slide# Ketter Hall, North Campus, Buffalo, NY Fax: Tel: x 2400 Control of Structural Vibrations.
Today Wrap up of probability Vectors, Matrices. Calculus
Overview Software Quality Assurance Reliability and Availability
Exponential Distribution & Poisson Process
1 Exponential Distribution & Poisson Process Memorylessness & other exponential distribution properties; Poisson process and compound P.P.’s.
Chapter 22. Software Reliability Engineering (SRE)
Pop Quiz How does fix response time and fix quality impact Customer Satisfaction? What is a Risk Exposure calculation? What’s a Scatter Diagram and why.
Software Reliability Model Deterministic Models Probabilistic Models Halstead’s software metric McCabe’s cyclomatic complexity metrix Error seeding Failure.
ECE 355: Software Engineering
-Exponential Distribution -Weibull Distribution
Handouts Software Testing and Quality Assurance Theory and Practice Chapter 15 Software Reliability
Software Reliability SEG3202 N. El Kadri.
Reliability Models & Applications Leadership in Engineering
Networks of Queues Plan for today (lecture 6): Last time / Questions? Product form preserving blocking Interpretation traffic equations Kelly / Whittle.
Chin-Yu Huang Department of Computer Science National Tsing Hua University Hsinchu, Taiwan Optimal Allocation of Testing-Resource Considering Cost, Reliability,
Why Wait?!? Bryan Gorney Joe Walker Dave Mertz Josh Staidl Matt Boche.
Fault-Tolerant Computing Systems #4 Reliability and Availability
Part 4 Nonlinear Programming 4.1 Introduction. Standard Form.
2007 MIT BAE Systems Fall Conference: October Software Reliability Methods and Experience Dave Dwyer USA – E&IS baesystems.com.
Stochastic Optimization
Software Reliability Estimates/ Projections, Cumulative & Instantaneous Presented by Dave Dwyer With help from: Ann Marie Neufelder, John D. Musa, Martin.
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
1 Introduction Optimization: Produce best quality of life with the available resources Engineering design optimization: Find the best system that satisfies.
1 Chapter 5 Continuous time Markov Chains Learning objectives : Introduce continuous time Markov Chain Model manufacturing systems using Markov Chain Able.
O PTIMAL R EPLACEMENT AND P ROTECTION S TRATEGY FOR P ARALLEL S YSTEMS R UI P ENG, G REGORY L EVITIN, M IN X IE AND S ZU H UI N G Adviser: Frank, Yeong-Sung.
More on Exponential Distribution, Hypo exponential distribution
Expectations of Random Variables, Functions of Random Variables
Linear Programming for Solving the DSS Problems
Physics 114: Lecture 13 Probability Tests & Linear Fitting
Chapter 4 Continuous Random Variables and Probability Distributions
STATISTICS POINT ESTIMATION
12. Principles of Parameter Estimation
Exponential Distribution & Poisson Process
Discussions on Software Reliability
Part 4 Nonlinear Programming
Cumulative distribution functions and expected values
Pertemuan ke-7 s/d ke-10 (minggu ke-4 dan ke-5)
6.5 Stochastic Prog. and Benders’ decomposition
3.1 Expectation Expectation Example
Lecture 8 – Nonlinear Programming Models
Pattern Recognition PhD Course.
Software Reliability Models.
Risk-informed Decision Making under Incomplete Information
T305: Digital Communications
Part 4 Nonlinear Programming
6.5 Stochastic Prog. and Benders’ decomposition
9. Two Functions of Two Random Variables
12. Principles of Parameter Estimation
Further Topics on Random Variables: 1
Further Topics on Random Variables: Derived Distributions
Berlin Chen Department of Computer Science & Information Engineering
Further Topics on Random Variables: Derived Distributions
Further Topics on Random Variables: Derived Distributions
Presentation transcript:

A Software Cost Model with Reliability Constraint under Two Operational Scenarios Satoru UKIMOTO and Tadashi DOHI Department of Information Engineering, Graduate School of Engineering Hiroshima University, 1–4–1 Kagamiyama, Higashi-Hiroshima, 739–8527 Japan Abstract. In this paper we extend the reliability constrained cost mini-mization (RCCM) model by Helander et al. (1998) from two view points: time non- homogeneous property on software failure-occurrence process and gap between testing and operational phases of software product. The expected cost minimizations with reliability constraint are formulated as non-linear minimization problems under alternative scenario on opera-tion. We analytically develop optimization algorithms for the optimal allocation policies. Key words: software cost model, reliability constraint, operational phase, non-homogeneous Poisson process, non-linear optimization. 1 Reliability Constrained Cost Minimization We introduce RCCM (Reliability Constrained Cost Minimization) model by He-lander et al. [1]. Suppose that software consists of n components whose failure intensity functions are given by A i (i = 1, 2,..., n). More precisely, let { N i (t), t ~ 0 } be the cumulative number of software failures occurred by time t in the i-th component and be a homogeneous Poisson process (HPP), where the intensity of an HPP, A i, denotes the instantaneous software failure-occurrence rate per each failure for i-th component. The mean value functions E[N i (t)] = A i t and E[ ∑ ni =1 N i (t)] = ∑ ni =1 A i t denote the cumulative numbers of software failures occurred in the i-th component and the whole software system by time t, respectively. Let TC(A 1, A 2,..., A n ; r) and R(A 1, A 2,..., A n ; r) be the expected total op-erational cost and the quantitative software reliability, respectively, as functions of software intensity A i (i = 1, 2,..., n), where r (> 0) denotes the operational period of software after the release. Suppose that the expected total operational cost is given by the sum of individual expected operational cost, C i (A i ), for each software component i (= 1, 2,..., n): TC(A 1,A 2,...,A n ;r) = ∑ n C i (A i ;r). (1) i = 1 SoftTech 2013, ASTL Vol. 19, pp , © SERSC

Proceedings, The 2nd International Conference on Software Technology ture Notes i Com p uter Science: Authors Instructions From the property of expected operational cost for each component i, we assume that the function C  (A  ; t) is monotonically decreasing and convex in A  without any loss of generality. Helander et al. [1] assume thee kinds of cost functions; (i) linear function C  (A  ; t) = − α  A  t + β , (ii) logarithmic exponential (LogExp) function C  (A  ; t) = β  ln(1 − exp[ − A  t]), and (iii) inverse power (InvPow) func- tion C  (A  ; t) = β  /(A  t − S  )  i, for i = 1, 2,..., n, where α  (> 0), β  (> 0) and S  (> 0) are constant. Then the RCCM with a fixed t is formulated as the following minimization problem with respect to the software intensity: min  i ;  =1  2    TC(A 1,A 2,..., A ; t), s.t.R(A 1, A 2,..., A ; t) > ρ, A  > 0 for i = 1,... n, (2) where ρ in Eq.(3) is the minimum requirement of quantitative software reliability level and R(A 1, A 2,..., A ; t) means the probability that the software does not fail during the operational period t. It is common to see that the cumulative number of software failures caused by software faults is estimated by the operational profile [2] inferred in the design phase. Let 4  be the frequency to use the component i in the operational phase with E  = 4  = 1. Similar to Helander etal. [1], let µ  and p  denote the ratio of the j-th software operation (j = 1, 2,..., m), processed by component i and the probability that the j-th software operation is executed, respectively, where E  1 p  = 1 and E   = 1  = 1 µ  = 1. T h e n t h e f r e q u e n c y t o u s e t h e c o m p o n e n t  = i i s g i v e n b y 4  =  = 1 µ  p , s o t h a t t h e q u a n t i t a t i v e s o f t w a r e r e l i a b i l i t y i s derived by R(A 1, A 2,..., A ;t) = exp { − ∑  }  4  A  t (3) =1 from the HPP assumption. By solving the minimization problem in Eq.(3), the optimal software intensity for respective software components, A I (i = 1, 2,..., n), can be obtained so as to satisfy the reliability constraint. For the minimization problem in Eq.(3) with inequality constraints, it is straightforward to get necessary conditions of optimality (Kuhn-Tucker conditions) and to characterize the optimal software intensity A I. We summarize the optimal software intensity A I for three models in Table 1, where u * is the optimal Lagrange multiplier which is given as a unique solution of nonlinear equations. 2 Extended RCCM Model The common experiences suggest that the software fault-detection process in testing is represented by a non-homogeneous Poisson process (NHPP). Suppose that the software failures are caused by software faults. Let { N  (t), t > 0 } be the cumulative number of software faults detected by time t for i-th component and be an NHPP with intensity function A  (t; O s ). In the above definition, 237

Ti S p p e D to ee L g h A Software Cost Model with Reliability Constraint under Two Operational Scenarios Table 1. Optimal allocation policies. Cost HPP NHPP Linear A I = 1 — ln(  ) ( i = k  0 ( i = ̸ k ) k ) v  p ) a * ( i  0 ( ) { ( i = ̸ k ) ln + LogExp λ*λ* ln + a *  = [1[1  * ii d ln( ρ ) + E  =1 ϕ  λ * t T =  , = δ  1  =t a  F ( τ ) = 0 λ. [ 1 E  *  *  ) ] ln( p ) + 1 δ  + InvPow u*u* . ‘ 1 +1 a  = (  *  i   ) ) ei  (   i  i 0 - i +. a, 11 * i { I a r Fi  i. 1  i oe + - Q. 9 oei +1 i E :, 1  (  ) oe i a !" F1 iai +1 u = − ln(  ) − E niit 1  1-  − ln(  ) − E 4 =1  (  ) i 0 = ( 0 1, 0 2,..., 0 n ) is the model parameters (vector) included in each intensity function 0 i ( i = 1, 2,..., n ). Then the p.m.f. of the total cumulative number of software faults detected in testing is given by Pr { N ( t ) = x } = Pr { E n i =1 { A ( t ; 0 ) } x N i ( t ) = x } = exp[ − A ( t ; 0 )], (4) x ! A ( t ; 0 ) = E n A i ( t ; 0 i ) = E n f t yi i ( x ; 0 i ) dx, (5) i =1 where the functions A ( t ; 0 ) = E[ N ( t )] and A i ( t ; 0 i ) = E[ N i ( t )] are called the mean value functions. For the two- parameters case with 0 i = ( a i, b i ) ( i = 1, 2,..., n ), the mean value functions have the product forms of A i ( t ; 0 i ) = a i F i ( t ; b i ), where F i ( t ; b i ) are the cumulative distribution functions (c.d.f.) of independent and identically distributed fault-detection times in the i -th compo- nent, and a = E ni =1 a i is the expected initial number of software faults remaining before testing, i.e., lim t,„„ A ( t ; 0 ) = a and lim t,„„ A i ( t ; 0 i ) = lim t,„„ F i ( t ; b i ) = a i. Define the software debug rate in each component dA i ( t ; a i, b i ) /dt d i ( t ) = A i ( oo ; a i, b i ) − A i ( t ; a i, b i ) = f i ( t ; b i ) / { 1 − F i ( t ; b i ) }, (6) where the function fi ( t ; b i ) = dF i ( t ; b i ) /dt is the probability density function (p.d.f.) of F i ( t ; b i ), so that d i ( t ) is equivalent to the failure rate of the c.d.f. F i ( t ; b i ) and is independent of a i. It should be noted that the NHPP-based model describes the debugging process in the software testing. On the other hand, the RCCM focuses on the operational phase after the release of software, but does not link to the testing phase. Yang and Xie [3] independently consider a scenario to change from software testing phase to operational phase, and assume that the software intensity function 2 ( t ; 0 ) = E ni =1 A i ( t ; 0 i ) becomes a constant just after releasing the software. 238

Proceedings, The 2nd International Conference on Software Technology ture Notes i Com p uter Science: AuthorsInstructions For a given release time t 0, the software intensity is give as A i (t 0 ; i ) = A i. In other words, the RCCM model [1] implicitly assumes the above scenario in the operational phase and controls the software intensity, A i (i = 1, 2,..., n), in each component. We call this scenario that the software intensity becomes a constant after releasing the software Scenario 1. In this paper we propose alternative scenario, Scenario 2, where the software debug rate d i (t) in Eq.(16), but not the software intensity function A i (t), becomes a constant after the release, say, d i (t 0 ). This implies that the software failure- occurrence time distribution F i (t; b i ) after the release time t 0 ( t 0 ). Then, we have Λ i (t; i ) = a i F(t; b i ) (0 < t < t 0 ) a i F i (t ; d i (t 0 )) (7) + a i { 1 − F i (t 0 ;d i (t 0 )) }{ 1 − e − d i (t 0 )[t − t 0 ] }. (t 0 < t < t 0 + τ), It seems that Scenario 1 with constant intensity level in the operational phase leads to the linear increase of cumulative number of failures and does not reflect the testing effort spent in the testing. On the other hand, Scenario 2 implies that the software intensity changes to a specific exponential form with rate d i (t 0 ) but results the consistent behavior of the cumulative number of failures. Based on Scenario 2, we re-formulate RCCM model. Instead of the software intensity A i in the original RCCM model, we regard the expected initial number of faults in each component a i as the decision variable. Note that a i is a target variable in the software testing, so that the software testing manager will set the objective number of faults detected in each software component. For given d i (t 0 ) = d i, (i = 1, 2,..., n), we formulate the extended RCCM by min a i ;i=1,2,...,n TC(a 1,a 2,...,a i ;τ) where s.t.R(a 1,a 2,..., a n ; τ) > ρ, a i > 0 for i = 1, 2,... n, (8) ∑ n R(a 1, a 2,..., a i ;τ) = exp l − i =1 } a i (1 − exp[ − d i (t 0 ) ϕ i τ]). (9) Solving the Kuhn-Tucker conditions for three cost functions, we also summarize the optimal allocation poicy a i (i = 1, 2,..., n) in Table 1, where F(τ) = 1 − exp[ − d i (t 0 ) ϕ i τ]. References 1.Helander, M. E., Zhao, M. and Ohlsson, N.: Planning models for software reliability and cost. IEEE Transactions on Software Engineering 24 (6), 420–434 (1998). 2.Musa, J. D.: Operational profiles in software-reliability engineering. IEEE Soft-ware, 10 (2), 14–32 (1993). 3.Yang, B. and Xie, M.: A study of operational and testing reliability in software re-liability analysis. Reliability Engineering & System Safety, 70 (1), 323–329 (2000). 239