CN104933492A - On-line reliability prediction and improvement method of shopping system - Google Patents

On-line reliability prediction and improvement method of shopping system Download PDF

Info

Publication number
CN104933492A
CN104933492A CN201510407544.4A CN201510407544A CN104933492A CN 104933492 A CN104933492 A CN 104933492A CN 201510407544 A CN201510407544 A CN 201510407544A CN 104933492 A CN104933492 A CN 104933492A
Authority
CN
China
Prior art keywords
mrow
msub
component
reliability
model
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201510407544.4A
Other languages
Chinese (zh)
Inventor
丁佐华
杨晓燕
徐婷
周远
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhejiang Sci Tech University ZSTU
Original Assignee
Zhejiang Sci Tech University ZSTU
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zhejiang Sci Tech University ZSTU filed Critical Zhejiang Sci Tech University ZSTU
Priority to CN201510407544.4A priority Critical patent/CN104933492A/en
Publication of CN104933492A publication Critical patent/CN104933492A/en
Pending legal-status Critical Current

Links

Landscapes

  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses an on-line reliability prediction and improvement method of a shopping system. In the method, system reliability is predicted by a time sequence analysis model ARIMA and improvement of the reliability is realized through positioning and reconfiguring an error component. The method especially comprises the following steps: (1) configuring a log file and collecting real-time system operation data; (2) according to the collected data, determining the ARIMA model ARIMA (p, d, q); (3) according to an obtained prediction model ARMA, predicting actual effect data in a future period of time; (4) calculating the reliability of the system in the future period of time; (5) searching a component which may have a fault through a spectrum positioning method when the predicted reliability is lower than a predicted value; (6) considering system reliability improvement degrees brought by adding a component which has a same function with a fault component and replacing the fault component respectively, and selecting a method which is used to improve the reliability maximumly to reconfigure the system so as to improve the reliability.

Description

Online reliability prediction and improvement method for shopping system
Technical Field
The invention relates to an online reliability prediction and improvement method for a shopping system, which carries out advanced reliability prediction on the real-time operation shopping system and provides a method for improving the reliability, thereby ensuring that the system can improve high-quality and high-reliability service.
Background
Software reliability is an important index for measuring software quality. There are many studies on the prediction of software reliability, but most of them are studies on static reliability, using data from static data in the test phase. The predicted reliability cannot reflect the real reliability of the system because the running environment and the dynamic behavior of the software are not considered; secondly, the static reliability cannot reflect the reliability of the system during operation, so that the system cannot be reconfigured to improve the reliability when the system reliability is not high. It has been proposed to combine a static reliability model with dynamic analysis to evaluate the reliability trend of the system during the operational phase; it has also been proposed to predict system real-time reliability by incorporating many sources of information, including the system's execution environment, while improving system reliability by reallocating executing components and changing the number of copies of components.
However, these methods have some disadvantages as follows: (1) the reliability of a certain time period next to the current state cannot be predicted according to the running data; (2) when the reliability is reduced, the components that affect the reduction in reliability cannot be positioned.
Disclosure of Invention
The invention aims to provide a method for predicting and improving online reliability of a shopping system aiming at the defects of the prior art.
The purpose of the invention is realized by the following technical scheme: a method for predicting and improving the online reliability of a shopping system comprises the following steps:
(1) collecting real-time operation data of the system: collecting real-time running data of the system by configuring a log file of the system, and obtaining a running log of the system by configuring log4j for a shopping system of a java application program;
(2) determining a time series analysis model for predicting failure data, namely an autoregressive integrated moving average model (ARIMA), according to the collected real-time operation data, wherein the model is in the form of ARIMA (p, d, q), p and q respectively represent an autoregressive term and a moving average term, and d represents the difference times when the time series becomes stable; determining parameters in the model according to the sample data;
(3) prediction of failure data: after the prediction model is determined, failure data of the system in a future period of time are predicted according to current data and past data; the method specifically comprises the following steps:
(3.1) smoothing processing of failure data: when failure data sequence { Y }1,Y2,…,YtWhen the sequence is not stable, the sequence is differentiated successively until a new stable sequence is obtained (X)1,X2,…,Xt-dD, wherein the difference times are the value of d; then the stationary sequence { X is repeated1,X2,…,Xt-dZero equalization processing
(3.2) model determination: estimating autoregressive coefficients and moving average coefficients of ARMA (p, q) by using a least square estimation method and a maximum likelihood estimation method; performing model order determination by using an AIC criterion, wherein the model with the minimum AIC value is the optimal model; finally, judging whether the residual sequence of the model is white noise or not, if so, checking to obtain a software reliability prediction model, and otherwise, recalculating;
(3.3) failure data prediction: predicting { X from the resulting modelt' } and then reduced to failure data YtThe predicted result of (1);
(4) and (3) predicting the reliability of the system: calculating the reliability of the system for a future period of time based on the predicted failure data and the component-based reliability calculation model; the component-based reliability model is specifically as follows:
port: port p is a tuple (M, t, c), M being a finite set of methods in port p, t representing the port type offered or required, c representing the communication type, synchronous or asynchronous;
assembly of: the component Com is a tuple (P)p,Pr,G,W),PpIs to provide a limited set of ports, PrIs a finite set of demand ports, G is a finite set of subcomponents,a port relationship representing a non-reflexive relationship, and TP ═ Pp∪Pr∪∪C∈GC.Pr,C.PpAnd C.PrPort sets representing sub-component C supply and demand, respectively;
describing the dynamic behavior of a component using port activity, the basic activity of which is considered to be the exchange of information between two ports;
port reliability prediction: when a method of a port is called, the port is considered to be accessed once;niIndicating that port p is in a time interval 0, T]The number of times of internal access; one failure data represents one error in the prediction process, fiRepresenting the number of errors in the prediction process; suppose port p has operation p1→p2Then the reliability at time tport p is defined as: <math> <mrow> <mi>r</mi> <mrow> <mo>(</mo> <mi>p</mi> <mo>&lsqb;</mo> <msub> <mi>p</mi> <mn>1</mn> </msub> <mo>&RightArrow;</mo> <msub> <mi>p</mi> <mn>2</mn> </msub> <mo>&rsqb;</mo> <mo>)</mo> </mrow> <mo>=</mo> <mn>1</mn> <mo>-</mo> <mfrac> <msub> <mi>f</mi> <mi>i</mi> </msub> <msub> <mi>n</mi> <mi>i</mi> </msub> </mfrac> <mo>;</mo> </mrow> </math>
reliability prediction of the system: the reliability of a system after a period of execution is defined as:wherein r (tr)i) Is the locus triReliability of (f) (tr)i) Is the locus triThe frequency of occurrence of (c);
(5) positioning of a fault component: if the predicted reliability is lower than an expected value, searching a component causing the reduction of the system reliability, and positioning a fault component by using a frequency spectrum positioning and maximum likelihood estimation method; assuming that the system consists of M components, denoted Cj (j ∈ {1, … …, M }), there may be E erroneous components; diagnostic report D ═<…,dk,…>For an ordered set of possible multiple erroneous component candidates, dkRanked by likelihood of error;
establishing a spectrum matrix: the spectrum matrix represents the labels of the components contained in the dynamic behavior of the system; when the system is executed once, the passed components are marked as 1, otherwise, the passed components are 0; assuming that a total of N times are performed, the spectrum matrix is represented as a matrix of N x MA; taking into account the number of passes through the component, the matrix element aijIndicating whether the component Cj passes through the component and the number of times of passing when the component Cj is executed at the ith time; the execution result is stored in a vector e, which indicates that after each execution, if the operation is passed, the operation is marked as 0, and the operation failure is marked as 1;
and (3) candidate set generation: using a minimum hit set algorithm to compute a diagnostic candidate set, a spectral-based error localization technique (SFL) can well predict failure ranks in terms of component failure probability; SFL input spectrum matrices (a, e) yielding ordered ranks of component error probabilities; the components calculate the ranking with the similarity coefficient, i.e. the highest ranked component is often wrong; the specific similarity coefficient is defined as:
<math> <mrow> <mi>s</mi> <mrow> <mo>(</mo> <mi>j</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfenced open = '{' close = ''> <mtable> <mtr> <mtd> <mfrac> <mrow> <msub> <mi>n</mi> <mn>11</mn> </msub> <mrow> <mo>(</mo> <mo>{</mo> <mi>j</mi> <mo>}</mo> <mo>)</mo> </mrow> </mrow> <mrow> <mi>d</mi> <mi>e</mi> <mi>n</mi> <mrow> <mo>(</mo> <mi>j</mi> <mo>)</mo> </mrow> <mo>=</mo> <msqrt> <mrow> <mo>(</mo> <msub> <mi>n</mi> <mn>11</mn> </msub> <mo>(</mo> <mo>{</mo> <mi>j</mi> <mo>}</mo> <mo>)</mo> <mo>+</mo> <msub> <mi>n</mi> <mn>10</mn> </msub> <mo>(</mo> <mo>{</mo> <mi>j</mi> <mo>}</mo> <mo>)</mo> <mo>)</mo> <mo>*</mo> <mo>(</mo> <msub> <mi>n</mi> <mn>11</mn> </msub> <mo>(</mo> <mo>{</mo> <mi>j</mi> <mo>}</mo> <mo>)</mo> <mo>+</mo> <msub> <mi>n</mi> <mn>01</mn> </msub> <mo>(</mo> <mo>{</mo> <mi>j</mi> <mo>}</mo> <mo>)</mo> <mo>)</mo> </mrow> </msqrt> </mrow> </mfrac> <mo>,</mo> <mi>d</mi> <mi>e</mi> <mi>n</mi> <mo>(</mo> <mi>j</mi> <mo>)</mo> <mo>&NotEqual;</mo> <mn>0</mn> </mtd> </mtr> <mtr> <mtd> <mn>0</mn> <mo>,</mo> <mi>o</mi> <mi>t</mi> <mi>h</mi> <mi>e</mi> <mi>r</mi> <mi>w</mi> <mi>i</mi> <mi>s</mi> <mi>e</mi> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>
wherein,
n11(j)=|{i{1,2,…,N}|aij>0∧ei=1}|
n10(j)=|{i∈{1,2,…,N}|aij>0∧ei=0}|
n01(j)=|{i∈{1,2,…,N}|aij=0∧ei=1}|
candidate set ordering: calculating probabilities of the candidate sets using bayesian rules; according to the candidate set dkAll observations of (d), each candidate set dkThe probability of (c) describes the error condition of the actual system; the candidate set d under the observed observation is derived by Bayes' rulekThe formula for calculating the posterior probability of (2) is:
<math> <mrow> <msub> <mi>P</mi> <mi>r</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>|</mo> <mi>o</mi> <mi>b</mi> <mi>s</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mrow> <msub> <mi>P</mi> <mi>r</mi> </msub> <mrow> <mo>(</mo> <mi>o</mi> <mi>b</mi> <mi>s</mi> <mo>|</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi>P</mi> <mi>r</mi> </msub> <mrow> <mo>(</mo> <mi>o</mi> <mi>b</mi> <mi>s</mi> <mo>)</mo> </mrow> </mrow> </mfrac> <mo>&CenterDot;</mo> <msub> <mi>P</mi> <mi>r</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>)</mo> </mrow> </mrow> </math>
let Pr(j) P denotes a component CjA priori probability of error, given that component errors are independent, candidate set dkThe prior probability of (a) is:
<math> <mrow> <msub> <mi>P</mi> <mi>r</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>)</mo> </mrow> <mo>=</mo> <msup> <mi>p</mi> <mrow> <mo>|</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>|</mo> </mrow> </msup> <mo>&CenterDot;</mo> <msup> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <mi>p</mi> <mo>)</mo> </mrow> <mrow> <mi>M</mi> <mo>-</mo> <mo>|</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>|</mo> </mrow> </msup> </mrow> </math>
Pr(obs) is a normalization factor, which requires no computation; since each execution is independent, it is possible to perform the operations independently
<math> <mrow> <msub> <mi>P</mi> <mi>r</mi> </msub> <mrow> <mo>(</mo> <mi>o</mi> <mi>b</mi> <mi>s</mi> <mo>|</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>)</mo> </mrow> <mo>=</mo> <munderover> <mo>&Pi;</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>N</mi> </munderover> <msub> <mi>P</mi> <mi>r</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>obs</mi> <mi>i</mi> </msub> <mo>|</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>)</mo> </mrow> </mrow> </math>
Wherein Pr (obs)i|dk) Is defined as follows:
<math> <mrow> <msub> <mi>P</mi> <mi>r</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>obs</mi> <mi>i</mi> </msub> <mo>|</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>)</mo> </mrow> <mo>=</mo> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <mn>1</mn> <mo>,</mo> </mtd> <mtd> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>&RightArrow;</mo> <msub> <mi>obs</mi> <mi>i</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mn>0</mn> <mo>,</mo> </mtd> <mtd> <msub> <mi>obs</mi> <mi>i</mi> </msub> <mo>^</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>|</mo> <mo>=</mo> <mo>&perp;</mo> </mtd> </mtr> <mtr> <mtd> <msub> <mi>&epsiv;</mi> <mi>ik</mi> </msub> <mo>,</mo> </mtd> <mtd> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>&RightArrow;</mo> <mo>{</mo> <msub> <mi>obs</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msub> <mi>obs</mi> <mi>N</mi> </msub> <mo>}</mo> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>
wherein:
<math> <mrow> <msub> <mi>&epsiv;</mi> <mi>ik</mi> </msub> <mo>=</mo> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <munder> <mi>&Pi;</mi> <mrow> <mi>j</mi> <mo>:</mo> <mrow> <mo>(</mo> <mi>j</mi> <mo>&Element;</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>)</mo> </mrow> <mo>^</mo> <mrow> <mo>(</mo> <msub> <mi>a</mi> <mi>ij</mi> </msub> <mo>></mo> <mn>0</mn> <mo>)</mo> </mrow> </mrow> </munder> <msup> <msub> <mi>h</mi> <mi>j</mi> </msub> <msub> <mi>a</mi> <mi>ij</mi> </msub> </msup> <mo>,</mo> </mtd> <mtd> <msub> <mi>e</mi> <mi>i</mi> </msub> <mo>=</mo> <mn>0</mn> </mtd> </mtr> <mtr> <mtd> <mn>1</mn> <mo>-</mo> <munder> <mi>&Pi;</mi> <mrow> <mi>j</mi> <mo>:</mo> <mrow> <mo>(</mo> <mi>j</mi> <mo>&Element;</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>)</mo> </mrow> <mo>^</mo> <mrow> <mo>(</mo> <msub> <mi>a</mi> <mi>ij</mi> </msub> <mo>></mo> <mn>0</mn> <mo>)</mo> </mrow> </mrow> </munder> <msup> <msub> <mi>h</mi> <mi>j</mi> </msub> <msub> <mi>a</mi> <mi>ij</mi> </msub> </msup> <mo>,</mo> </mtd> <mtd> <msub> <mi>e</mi> <mi>i</mi> </msub> <mo>=</mo> <mn>1</mn> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>
wherein h isj∈[0,1]Represents the probability that the component j is working properly;
thus, Pr (obs | d)k) Is about hjH can be obtained by maximum likelihood estimationjThe estimated value of (c) is actually the solution of the extremum problem as follows:wherein G ═ hj∈[0,1]:j=1,2,…,M};
(6) System reconfiguration: for a fault component, the component can be replaced or a normal component with the same function as the fault component can be added in the system, and the method with the highest reliability improvement is selected by calculating the reliability obtained by the two methods.
Further, in the step (2), establishing the ARIMA (p, d, q) model is completed by using Eviews statistical analysis software, which specifically includes the following processes: smoothing processing of time series data and estimation of model parameters.
Further, in the step (5), the locating of the fault component includes: and constructing a frequency spectrum matrix according to the times of each component passing each test, generating a candidate set of the fault components according to the frequency spectrum matrix, and determining the posterior probability of the candidate set by utilizing maximum likelihood estimation, wherein the largest value is the selected fault component set.
The invention has the beneficial effects that: the method of the invention carries out real-time prediction on failure data of the system in a certain time period in the future through a time series analysis model ARIMA, and predicts the reliability of the system, thereby overcoming the defects 1 in the prior art; when the predicted reliability is lower than the expected value, the components causing the system reliability to decrease are first located, and then there are two ways to reconfigure the system: the defect point 2 in the prior art is overcome by replacing the failed component and adding the component with the same function, and selecting the method with the maximum reliability improvement to reconfigure the system by judging the generated effect.
Drawings
FIG. 1 is a technical flow diagram of a service oriented system reliability prediction and enhancement method;
FIG. 2 is a partial online shopping system SCA with new components added.
Detailed Description
The present invention will be further described with reference to the accompanying drawings.
The online reliability prediction and improvement method of the shopping system provided by the invention can predict the reliability of the real-time running system at a certain time in the future and can carry out targeted reconfiguration on the system through the positioning of the fault component, thereby improving the reliability of the system. The process is described in detail below:
(1) collecting real-time dynamic data: firstly, determining reasonable variables of real-time values to be recorded by analyzing the characteristics of the system such as functional performance and the like, wherein the system with time requirement can select response time, the system with quantity requirement can select throughput and the like; second, the log file of the system is configured according to the selected variables. The present invention selects variable response times for systems with response time requirements, configuring log4j to obtain a running log of the system. Because a port-based reliability prediction model is used, failure data for all ports of the system is collected from the log. Such as the order port, has three input variables (userId, isplayed, totalpick) and two output variables (detail order, response time). By monitoring the response time value in the javaServlet and the run time value sent to the log, variable response time data is collected as shown in the following table:
time (min) Response time (ms) Time (min) Response time (ms)
1 3560 11 1980
2 3860 12 2250
3 2214 13 2750
4 1928 14 3126
5 1356 15 3584
6 780 16 3847
7 972 17 4256
8 1280 18 4895
9 1492 19 5216
10 1685 20 5872
(2) And (3) failure data prediction: and establishing an ARIMA model ARIMA (p, d, q) according to the obtained data sequence, wherein p is an autoregressive term, q is the number of moving average terms, and d is the difference times when the time sequence becomes stable. Firstly, the stationarity of the data sequence is judged according to the obtained data sequence, and a stable sequence { X ] is obtained by carrying out finite difference on an unstable sequencet}. Continuing with the example of port order, it can be seen from the data in Table 1The data sequence is in a growing trend, so the data sequence is an unstable sequence. Smoothing the data by first logarithmizing the sequence to obtain Yt=lnXt。YtThe results are shown in the following table.
Time (min) Yt Time (min) Yt
1 8.108021 11 7.700747
2 8.014996 12 7.807916
3 7.869401 13 7.956126
4 7.704361 14 8.048468
5 7.578656 15 8.160803
6 7.393263 16 8.243808
7 7.1546153 17 8.347116
8 7.314552 18 8.487146
9 7.455876 19 8.558527
10 7.590852 20 8.673341
Next, the statistical software Eviews is used to analyze YtStability of (2). Sequence Y obtained using EviwstThe unit root and the ADF value. After the ADF is subjected to the first difference processing, the ADF and the result after the first difference are both greater than 10%, so Y istIt is still unstable. Then, for Y againtThe second difference was performed and the unit root was verified, and the ADF value obtained after the second difference was-4.866626, which was less than the 1% threshold. Thus Y istAfter a second difference being stableThe sequence, i.e. d ═ 2. Let Zt=D(Yt2) represents YtThe values after the second difference remain in a stable sequence.
Secondly, parameter determination is carried out, and for the model ARIMA (p, q), the general mathematical formula is as follows: xt=φ1Xt-1+…+φpXt-p+t1 t-1+…+θq t-qTherein-tIs a white noise sequence, so it needs to be based on a stationary sequence { X }tDetermining p, q, phi1p1q. The determination of p and q requires determining the values of several groups (p, q) according to the autocorrelation coefficient and the partial autocorrelation coefficient of the stationary sequence and experience, and then determining the coefficient phi by performing maximum likelihood estimation on each group1p1qFinally, an optimal set (p, q) and corresponding coefficients phi are selected from the set1p1q(the decision can be made based on the Akaike Information Criterion (AIC) value, the smaller the AIC value, the better the corresponding (p, q)). After the model is determined, the variable values of the future time can be predicted in sequence, and whether the variable values are failure data or not can be judged according to the expected values. E.g.order port, when the model ARIMA (p,2, q) is analyzed by the sequence Zt from the previous step. And performing model optimization by using the AIC according to the autocorrelation and partial correlation results obtained by Zt, calculating different values of p and q by using different values of AIC, and finally obtaining the minimum value-5.354639 by using the AIC when (p, q) is equal to (6, 8). Thus, a model ARIMA (6,8) was obtained. To verify that the resulting model ARIMA (6,8) is the desired end result, the model ARIMA (6,8) residual sequence is analyzed to see if a white noise sequence is satisfied. Since Eviews is used for the analysis, it is only necessary to check whether the autocorrelation and partial correlation coefficients are within the confidence interval. The confidence interval is a measure of the reliability estimate, as known from the previously obtained values of the autocorrelation and partial correlation coefficients, which are both within the confidence interval. Therefore, the model was finally determined to be ARIMA (6,2, 8).
(3) And (3) predicting the reliability of the system: the reliability calculation model used by the invention is the reliability calculation of the service combination based on the portAnd (4) modeling. Suppose port p has operation p1→p2Then the reliability at time tport p is defined as:wherein n isiIndicating that port p is in a time interval 0, T]Number of accesses within, one failure data representing one error in the prediction process, fiRepresenting the number of errors in the prediction process; the reliability of the system is defined asWherein f (tr)i) Represents a track triThe frequency of occurrence of r (tr)i) Represents a track triDefined as the product of the port reliability on the trace: two ports p in sequential relationship1,p2Reliability definition of (r) (p)1;p2)=r(p1)r(p2) The reliability of the ports of two selection relations is defined asb is a Boolean condition, if b is true, then port p is selected1Executing, x (b) is 1, otherwise, selecting p2Executing, wherein x (b) is 0; for a cyclic port p, reliability is defined as(b is a Boolean condition, pr(i) Indicating the probability of exiting the loop at the ith time,or r (n × p) ═ r (p)n(n is a positive integer indicating that port p cycles n times). Still taking port order as an example, sequence Z is first predictedtAnd then returns the result to the sequence YtFinally orderPredict Xt. The response time of the next 3 minutes is predicted by the model, and the prediction results are respectively as follows: 7072.03,7816.51, 8518.68. It is clear that the port order has a response time greater than 8s only at minute 23; second, assume that the order port has passed 468 times in total. Therefore, the reliability of the port order is 1-1/468 ═ 0.9978.
The same can predict the reliability at 23 minutes for each of the remaining ports, see table below.
Meanwhile, the probabilities pb4(1) ═ 0.965, pb4(2) ═ 0.024 (stolen credit card, credit insufficient, etc.), pb4(3) ═ 0.011 (wrongly written characters, etc.), frequency of signature: f (tr1) is 56, f (tr2) is 53, f (tr3) is 78, f (tr4) is 58, f (tr5) is 85, f (tr6) is 62, f (tr7) is 49, f (tr8) is 65, f (tr9) is 57, f (tr10) is 94, f (tr11) is 56, f (tr12) is 76, and f (tr13) is 51. Thus, the predicted overall system reliability is:
<math> <mrow> <mi>r</mi> <mrow> <mo>(</mo> <mi>s</mi> <mi>y</mi> <mi>s</mi> <mi>t</mi> <mi>e</mi> <mi>m</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mrow> <msub> <mi>&Sigma;</mi> <mi>i</mi> </msub> <mi>r</mi> <mrow> <mo>(</mo> <msub> <mi>tr</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mi>f</mi> <mrow> <mo>(</mo> <msub> <mi>tr</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi>&Sigma;</mi> <mi>i</mi> </msub> <mi>f</mi> <mrow> <mo>(</mo> <msub> <mi>tr</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> </mrow> </mfrac> <mo>=</mo> <mn>0.6989</mn> </mrow> </math>
the reliability of the system is therefore lower than expected and for this reason it is necessary to find the faulty component that causes the problem.
(4) Positioning a fault assembly: when the predicted reliability is lower than the expected value of the system, it is then necessary to find the one (group) of components that is most likely to cause a reduction in the reliability of the system. First, from a set of test results, a spectrum matrix (a, e) is constructed, where a ═ aij),aijIndicates the probability that the ith test passes component j, e ═ ei),eiIs 0 or 1(0 means the ith test fails, 1 means the ith test succeeds); secondly, a diagnosis candidate set D is generated according to the spectrum matrix, and a candidate set D is obtained by using a minimum hit set algorithm STACCATO. The algorithm is divided into three steps: (1) the initialization stage ranks the components using correlation coefficients, (2) adds all components included in the failed set to a candidate set D, and (3) when | D | is zero<At L, the following is done for the components in the row that first exceed λ: remove component j, retain all e in (A, e)i=1∧aij>A of 0i*The statco algorithm is run on the new (a, e), adding the returned component to D and verifying if it is a minimum hit set.
The similarity coefficient calculation formula of the component j is as follows:
<math> <mrow> <mi>s</mi> <mrow> <mo>(</mo> <mi>j</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mrow> <msub> <mi>n</mi> <mn>11</mn> </msub> <mrow> <mo>(</mo> <mi>j</mi> <mo>)</mo> </mrow> </mrow> <msqrt> <mo>[</mo> <msub> <mi>n</mi> <mn>11</mn> </msub> <mrow> <mo>(</mo> <mi>j</mi> <mo>)</mo> </mrow> <mo>+</mo> <msub> <mi>n</mi> <mn>01</mn> </msub> <mrow> <mo>(</mo> <mi>j</mi> <mo>)</mo> </mrow> <mo>]</mo> <mo>&times;</mo> <mo>[</mo> <msub> <mi>n</mi> <mn>11</mn> </msub> <mrow> <mo>(</mo> <mi>j</mi> <mo>)</mo> </mrow> <mo>+</mo> <msub> <mi>n</mi> <mn>10</mn> </msub> <mrow> <mo>(</mo> <mi>j</mi> <mo>)</mo> </mrow> <mo>]</mo> </msqrt> </mfrac> <mo>,</mo> </mrow> </math> n11(j)=|{i|aij>0^ei=1}|,n01(j)=|{i|aij=0∧ei=1}|,n10(j)=|{i|aij》0∧ei0} |. Third, the posterior probability Pr (d) of each candidate set is calculatedk| obs), where obs ═ a, e.
Pr ( d k | obs ) = Pr ( obs | d k ) Pr ( obs ) , Since each test is independent, the test is carried out <math> <mrow> <mi>Pr</mi> <mrow> <mo>(</mo> <mi>obs</mi> <mo>|</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>)</mo> </mrow> <mo>=</mo> <munder> <mi>&Pi;</mi> <mi>i</mi> </munder> <mi>Pr</mi> <mrow> <mo>(</mo> <msub> <mi>obs</mi> <mi>i</mi> </msub> <mo>|</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> While <math> <mrow> <mi>Pr</mi> <mrow> <mo>(</mo> <msub> <mi>obs</mi> <mi>i</mi> </msub> <mo>|</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>)</mo> </mrow> <mo>=</mo> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <mn>1</mn> <mo>,</mo> </mtd> <mtd> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>&RightArrow;</mo> <msub> <mi>obs</mi> <mi>i</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mn>0</mn> <mo>,</mo> </mtd> <mtd> <msub> <mi>obs</mi> <mi>i</mi> </msub> <mo>^</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>|</mo> <mo>=</mo> <mo>&perp;</mo> </mtd> </mtr> <mtr> <mtd> <msub> <mi>&epsiv;</mi> <mi>ik</mi> </msub> <mo>,</mo> </mtd> <mtd> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>&RightArrow;</mo> <mi>obs</mi> </mtd> </mtr> </mtable> </mfenced> <mo>,</mo> </mrow> </math> Here, theikIs defined as <math> <mrow> <msub> <mi>&epsiv;</mi> <mrow> <mi>i</mi> <mi>k</mi> </mrow> </msub> <mo>=</mo> <mfenced open = '{' close = ''> <mtable> <mtr> <mtd> <mrow> <munder> <mo>&Pi;</mo> <mrow> <mi>j</mi> <mo>&Element;</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> </mrow> </munder> <msup> <msub> <mi>h</mi> <mi>j</mi> </msub> <msub> <mi>a</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> </msup> <mo>,</mo> <msub> <mi>e</mi> <mi>i</mi> </msub> <mo>=</mo> <mn>0</mn> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mn>1</mn> <mo>-</mo> <munder> <mo>&Pi;</mo> <mrow> <mi>j</mi> <mo>&Element;</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> </mrow> </munder> <msup> <msub> <mi>h</mi> <mi>j</mi> </msub> <msub> <mi>a</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> </msup> <mo>,</mo> <msub> <mi>e</mi> <mi>i</mi> </msub> <mo>=</mo> <mn>0</mn> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>,</mo> </mrow> </math> Wherein h isjIndicating the probability that component j is in error. Obtaining h by maximum likelihood estimationjAn estimate of (d). The candidate set is based on the posterior probabilityThe top candidate set is the set of components that are most likely to be in error, i.e., the set of components that need to be reconfigured, sorted from high to low. The specific calculation is as follows:
obtaining the component information and the operation condition of the system in operation from the file information of the database, and updating the frequency spectrum matrix by taking 60 seconds as the window size, as follows:
the correlation coefficient for each component is calculated as follows:
C11 C12 C21 C22 Ccs C3 Cds
n11(j) 3 2 2 5 1 1 1
n10(j) 7 3 7 4 4 4 4
n01(j) 0 1 1 1 2 2 2
S(j) 0.55 0.52 0.38 0.38 0.26 0.26 0.26
thus, ordered by correlation coefficient size<C11,C12,C21,C22,Ccs,C3,Cds>. The candidate set returned by the minimum hit set algorithm STACCATO is { { C11},{C12,C21},{C12,C22}}。
The probability values for each candidate set are calculated to determine the problem component. For candidate set { C11And can know that:
C11 1 1 1 1 1 1 1 1 1 1
e 0 1 0 0 1 0 0 0 0 1
Pr(ei|dk) h1 1-h1 h1 h1 1-h1 h1 h1 h1 h1 1-h1
therefore P isr(obs|{C11})=h1 7(1-h1)3To h is aligned with1Calculating its maximum likelihood estimation value h1When Pr (e | { C) |, (0.7)11})=2.224*10- 3. Similarly, for candidate set { C12,C21Knowing:
Pr(obs|{C12,C21})=h1 3h2 7(1-h1)(1-h2)(1-h1h2) To h is aligned with1,h2The maximum likelihood estimation value is calculated as h1=0.6417,h20.8528, so Pr(obs|{C12,C21})=2.07*10-3
For candidate set { C12,C22}:
Pr(obs|{C12,C22})=h1 3h2 28(1-h1)(1-h2 4)(1-h1h2 4) To h is aligned with1,h2The maximum likelihood estimation value is calculated as h1=0.6417,h20.9610, so Pr(obs|{C12,C22})=2.07*10-3
Knowing P by formular(d1|obs)=1.86*10-9,Pr(d2|obs)=1.92*10-10,Pr(d3|obs)=1.92*10-10. So the candidate platoon behavior { { C11},{C12,C21},{C12,C22}, i.e. component C11INIT error is the most likely.
After the faulty component is located, the system will be reconfigured.
(5) System reconfiguration: there are two ways to configure a system, namely adding a component that functions the same as a failed component and replacing the failed component. And selecting a proper configuration method by judging the reliability improvement degree brought by the two methods. When the components with the same functions as the fault components are added, the tracks of the system are increased, and the tracks need to be recalculated, and the probability and reliability of the tracks are improved; for replacing a failed component, the trajectory of the system and the probability of the trajectory will not change, but the reliability of each trajectory needs to be recalculated.
First, the reliability of the system after adding a new component is calculated. Additive for foodAdd and component C11New component C with the same INIT function11'INIT', recalculate the system reliability. As shown in FIG. 2, a new component C is added11'INIT' rear system part. Adding a new component C11After'' INIT, the system may select component C11INIT and C11' INIT begins execution in two paths, and the two start paths are mutually exclusive. Therefore, the trajectory of the system becomes twice as large. The port reliability is as follows:
the reliability of the whole system after adding the new component is as follows:
<math> <mrow> <mi>r</mi> <mrow> <mo>(</mo> <mi>s</mi> <mi>y</mi> <mi>s</mi> <mi>t</mi> <mi>e</mi> <mi>m</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mrow> <msub> <mi>&Sigma;</mi> <mi>i</mi> </msub> <mi>r</mi> <mrow> <mo>(</mo> <msub> <mi>tr</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mi>f</mi> <mrow> <mo>(</mo> <msub> <mi>tr</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi>&Sigma;</mi> <mi>i</mi> </msub> <mi>f</mi> <mrow> <mo>(</mo> <msub> <mi>tr</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> </mrow> </mfrac> <mo>=</mo> <mn>0.8693</mn> </mrow> </math>
second, the system reliability after replacement of the failed component is calculated. By means of functionally identical new components C11Replacement of failed component C by "═ INIT11System reliability is recalculated as INIT. The port reliability is shown in the following table:
the reliability of the whole system after the replacement of the failed component is as follows:
<math> <mrow> <mi>r</mi> <mrow> <mo>(</mo> <mi>s</mi> <mi>y</mi> <mi>s</mi> <mi>t</mi> <mi>e</mi> <mi>m</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mrow> <msub> <mi>&Sigma;</mi> <mi>i</mi> </msub> <mi>r</mi> <mrow> <mo>(</mo> <msub> <mi>tr</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mi>f</mi> <mrow> <mo>(</mo> <msub> <mi>tr</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi>&Sigma;</mi> <mi>i</mi> </msub> <mi>f</mi> <mrow> <mo>(</mo> <msub> <mi>tr</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> </mrow> </mfrac> <mo>=</mo> <mn>0.9546</mn> </mrow> </math>
the results of an experiment comparing the two schemes of adding a new component and replacing a failed component can be obtained, and in the experiment, when the system reliability does not reach the expected value, the effect of improving the system reliability by replacing the component is better. Therefore, in this example, replacement of the faulty group is adoptedPart C11The strategy of INIT automatically improves system reliability.
Through the 5 steps, the online reliability prediction and the online reliability improvement of the shopping system can be completed. It should be noted that: when the configuration of the system is considered, only the improvement degree of the system reliability by different methods is concerned, and the time cost and the space cost of replacing components and increasing the components are not considered; when considering both time and space costs, there may be different concerns and therefore the chosen configuration scheme will also transmit changes, and therefore several improvements may be made to the system reconfiguration without departing from the principles of the present invention, which should also be considered as the scope of protection of the present invention.

Claims (3)

1. A method for predicting and improving the online reliability of a shopping system is characterized by comprising the following steps:
(1) collecting real-time operation data of the system: collecting real-time running data of the system by configuring a log file of the system, and obtaining a running log of the system by configuring log4j for a shopping system of a java application program;
(2) determining a time series analysis model for predicting failure data, namely an autoregressive integrated moving average model (ARIMA), according to the collected real-time operation data, wherein the model is in the form of ARIMA (p, d, q), p and q respectively represent an autoregressive term and a moving average term, and d represents the difference times when the time series becomes stable; determining parameters in the model according to the sample data;
(3) prediction of failure data: after the prediction model is determined, failure data of the system in a future period of time are predicted according to current data and past data; the method specifically comprises the following steps:
(3.1) smoothing processing of failure data: when failure data sequence { Y }1,Y2,…,YtWhen the sequence is not stable, the sequence is differentiated successively until a new stable sequence is obtained (X)1,X2,…,Xt-dD, wherein the difference times are the value of d; then the stationary sequence { X is repeated1,X2,…,Xt-dZero equalization processing
(3.2) model determination: estimating autoregressive coefficients and moving average coefficients of ARMA (p, q) by using a least square estimation method and a maximum likelihood estimation method; performing model order determination by using an AIC criterion, wherein the model with the minimum AIC value is the optimal model; finally, judging whether the residual sequence of the model is white noise or not, if so, checking to obtain a software reliability prediction model, and otherwise, recalculating;
(3.3) failure data prediction: predicting { X from the resulting modelt' } and then reduced to failure data YtThe predicted result of (1);
(4) and (3) predicting the reliability of the system: calculating the reliability of the system for a future period of time based on the predicted failure data and the component-based reliability calculation model; the component-based reliability model is specifically as follows:
port: port p is a tuple (M, t, c), M being a finite set of methods in port p, t representing the port type offered or required, c representing the communication type, synchronous or asynchronous;
assembly of: the component Com is a tuple (P)p,Pr,G,W),PpIs to provide a portOf a finite set of PrIs a finite set of demand ports, G is a finite set of subcomponents,a port relationship representing a non-reflexive relationship, and TP ═ Pp∪Pr∪∪C∈GC.Pr,C.PpAnd C.PrPort sets representing sub-component C supply and demand, respectively;
describing the dynamic behavior of a component using port activity, the basic activity of which is considered to be the exchange of information between two ports;
port reliability prediction: when a method of a port is called, the port is considered to be accessed once; n isiIndicating that port p is in a time interval 0, T]The number of times of internal access; one failure data represents one error in the prediction process, fiRepresenting the number of errors in the prediction process; suppose port p has operation p1→p2Then the reliability at time tport p is defined as: <math> <mrow> <mi>r</mi> <mrow> <mo>(</mo> <mi>p</mi> <mo>&lsqb;</mo> <msub> <mi>p</mi> <mn>1</mn> </msub> <mo>&RightArrow;</mo> <msub> <mi>p</mi> <mn>2</mn> </msub> <mo>&rsqb;</mo> <mo>)</mo> </mrow> <mo>=</mo> <mn>1</mn> <mo>-</mo> <mfrac> <msub> <mi>f</mi> <mi>i</mi> </msub> <msub> <mi>n</mi> <mi>i</mi> </msub> </mfrac> <mo>;</mo> </mrow> </math>
reliability prediction of the system: the reliability of a system after a period of execution is defined as:wherein r (tr)i) Is the locus triReliability of (f) (tr)i) Is the locus triThe frequency of occurrence of (c);
(5) positioning of a fault component: if the predicted reliabilityWhen the value is lower than the expected value, searching a component causing the reduction of the system reliability, wherein a frequency spectrum positioning and maximum likelihood estimation method is used for positioning a fault component; assuming that the system consists of M components, denoted Cj (j ∈ {1, … …, M }), there may be E erroneous components; diagnostic report D ═<…,dk,…>For an ordered set of possible multiple erroneous component candidates, dkRanked by likelihood of error;
establishing a spectrum matrix: the spectrum matrix represents the labels of the components contained in the dynamic behavior of the system; when the system is executed once, the passed components are marked as 1, otherwise, the passed components are 0; assuming that a total of N times are performed, the spectrum matrix is represented as a matrix a of N × M; taking into account the number of passes through the component, the matrix element aijIndicating whether the component Cj passes through the component and the number of times of passing when the component Cj is executed at the ith time; the execution result is stored in a vector e, which indicates that after each execution, if the operation is passed, the operation is marked as 0, and the operation failure is marked as 1;
and (3) candidate set generation: using a minimum hit set algorithm to compute a diagnostic candidate set, a spectral-based error localization technique (SFL) can well predict failure ranks in terms of component failure probability; SFL input spectrum matrices (a, e) yielding ordered ranks of component error probabilities; the components calculate the ranking with the similarity coefficient, i.e. the highest ranked component is often wrong; the specific similarity coefficient is defined as:
<math> <mrow> <mi>s</mi> <mrow> <mo>(</mo> <mi>j</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfenced open = '{' close = ''> <mtable> <mtr> <mtd> <mfrac> <mrow> <msub> <mi>n</mi> <mn>11</mn> </msub> <mrow> <mo>(</mo> <mo>{</mo> <mi>j</mi> <mo>}</mo> <mo>)</mo> </mrow> </mrow> <mrow> <mi>d</mi> <mi>e</mi> <mi>n</mi> <mrow> <mo>(</mo> <mi>j</mi> <mo>)</mo> </mrow> <mo>=</mo> <msqrt> <mrow> <mo>(</mo> <msub> <mi>n</mi> <mn>11</mn> </msub> <mo>(</mo> <mrow> <mo>{</mo> <mi>j</mi> <mo>}</mo> </mrow> <mo>)</mo> <mo>+</mo> <msub> <mi>n</mi> <mn>10</mn> </msub> <mo>(</mo> <mrow> <mo>{</mo> <mi>j</mi> <mo>}</mo> </mrow> <mo>)</mo> <mo>)</mo> <mo>*</mo> <mo>(</mo> <msub> <mi>n</mi> <mn>11</mn> </msub> <mo>(</mo> <mrow> <mo>{</mo> <mi>j</mi> <mo>}</mo> </mrow> <mo>)</mo> <mo>+</mo> <msub> <mi>n</mi> <mn>01</mn> </msub> <mo>(</mo> <mrow> <mo>{</mo> <mi>j</mi> <mo>}</mo> </mrow> <mo>)</mo> <mo>)</mo> </mrow> </msqrt> </mrow> </mfrac> <mo>,</mo> <mi>d</mi> <mi>e</mi> <mi>n</mi> <mo>(</mo> <mi>j</mi> <mo>)</mo> <mo>&NotEqual;</mo> <mn>0</mn> </mtd> </mtr> <mtr> <mtd> <mn>0</mn> <mo>,</mo> <mi>o</mi> <mi>t</mi> <mi>h</mi> <mi>e</mi> <mi>r</mi> <mi>w</mi> <mi>i</mi> <mi>s</mi> <mi>e</mi> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>
wherein,
n11(j)=|{i∈{1,2,…,N}|aij>0∧ei=1}|
n10(j)=|{i∈{1,2,…,N}|aij>0∧ei=0}|
n01(j)=|{i∈{1,2,…,N}|aij=0∧ei=1}|
candidate set ordering: calculating probabilities of the candidate sets using bayesian rules; according to the candidate set dkAll observations of (d), each candidate set dkThe probability of (c) describes the error condition of the actual system; the candidate set d under the observed observation is derived by Bayes' rulekThe formula for calculating the posterior probability of (2) is:
<math> <mrow> <msub> <mi>P</mi> <mi>r</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>|</mo> <mi>o</mi> <mi>b</mi> <mi>s</mi> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mrow> <msub> <mi>P</mi> <mi>r</mi> </msub> <mrow> <mo>(</mo> <mi>o</mi> <mi>b</mi> <mi>s</mi> <mo>|</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi>P</mi> <mi>r</mi> </msub> <mrow> <mo>(</mo> <mi>o</mi> <mi>b</mi> <mi>s</mi> <mo>)</mo> </mrow> </mrow> </mfrac> <mo>&CenterDot;</mo> <msub> <mi>P</mi> <mi>r</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>)</mo> </mrow> </mrow> </math>
let Pr(j) P denotes a component CjA priori probability of error, given that component errors are independent, candidate set dkThe prior probability of (a) is:
<math> <mrow> <msub> <mi>P</mi> <mi>r</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>)</mo> </mrow> <mo>=</mo> <msup> <mi>p</mi> <mrow> <mo>|</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>|</mo> </mrow> </msup> <mo>&CenterDot;</mo> <msup> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <mi>p</mi> <mo>)</mo> </mrow> <mrow> <mi>M</mi> <mo>-</mo> <mrow> <mo>|</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>|</mo> </mrow> </mrow> </msup> </mrow> </math>
Pr(obs) is a normalization factor, which requires no computation; since each execution is independent, it is possible to perform the operations independently
<math> <mrow> <msub> <mi>P</mi> <mi>r</mi> </msub> <mrow> <mo>(</mo> <mi>o</mi> <mi>b</mi> <mi>s</mi> <mo>|</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>)</mo> </mrow> <mo>=</mo> <munderover> <mo>&Pi;</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>N</mi> </munderover> <msub> <mi>P</mi> <mi>r</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>obs</mi> <mi>i</mi> </msub> <mo>|</mo> <msub> <mi>d</mi> <mi>k</mi> </msub> <mo>)</mo> </mrow> </mrow> </math>
Wherein Pr (obs)i|dk) Is defined as follows:
wherein:
wherein h isj∈[0,1]Represents the probability that the component j is working properly;
thus, Pr (obs | d)k) Is about hjThe expression (h) can obtain the estimated value of hj by the maximum likelihood estimation method, and actually, the following extremum problem is solved:wherein G ═ hj∈[0,1]:j=1,2,…,M};
(6) System reconfiguration: for a fault component, the component can be replaced or a normal component with the same function as the fault component can be added in the system, and the method with the highest reliability improvement is selected by calculating the reliability obtained by the two methods.
2. The online reliability prediction and improvement method of shopping system as claimed in claim 1, wherein in the step (2), establishing ARIMA (p, d, q) model is accomplished by using Eviews statistical analysis software, which includes the following steps: smoothing processing of time series data and estimation of model parameters.
3. The online reliability prediction and improvement method of shopping system according to claim 1, wherein in said step (5), the location of the faulty component comprises: and constructing a frequency spectrum matrix according to the times of each component passing each test, generating a candidate set of the fault components according to the frequency spectrum matrix, and determining the posterior probability of the candidate set by utilizing maximum likelihood estimation, wherein the largest value is the selected fault component set.
CN201510407544.4A 2015-07-10 2015-07-10 On-line reliability prediction and improvement method of shopping system Pending CN104933492A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510407544.4A CN104933492A (en) 2015-07-10 2015-07-10 On-line reliability prediction and improvement method of shopping system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510407544.4A CN104933492A (en) 2015-07-10 2015-07-10 On-line reliability prediction and improvement method of shopping system

Publications (1)

Publication Number Publication Date
CN104933492A true CN104933492A (en) 2015-09-23

Family

ID=54120652

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510407544.4A Pending CN104933492A (en) 2015-07-10 2015-07-10 On-line reliability prediction and improvement method of shopping system

Country Status (1)

Country Link
CN (1) CN104933492A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105320843A (en) * 2015-10-30 2016-02-10 中山大学 Atmospheric pollutant concentration influence factor quantitative analysis method
CN105678451A (en) * 2016-01-04 2016-06-15 宁宇新 Method and device for automatically identifying financial fraud on the basis of financial data
CN109308309A (en) * 2018-07-27 2019-02-05 网宿科技股份有限公司 A kind of data service quality appraisal procedure and terminal

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1667587A (en) * 2005-04-11 2005-09-14 北京航空航天大学 Software reliability estimation method based on expanded Markov-Bayesian network
CN103383445A (en) * 2013-07-16 2013-11-06 湖北省电力公司电力科学研究院 System and method for forecasting service life and reliability of intelligent electric meter

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1667587A (en) * 2005-04-11 2005-09-14 北京航空航天大学 Software reliability estimation method based on expanded Markov-Bayesian network
CN103383445A (en) * 2013-07-16 2013-11-06 湖北省电力公司电力科学研究院 System and method for forecasting service life and reliability of intelligent electric meter

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
杨晓燕 等: "基于在线故障定位及自主适应提高软件可靠性", 《软件学报》 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105320843A (en) * 2015-10-30 2016-02-10 中山大学 Atmospheric pollutant concentration influence factor quantitative analysis method
CN105678451A (en) * 2016-01-04 2016-06-15 宁宇新 Method and device for automatically identifying financial fraud on the basis of financial data
CN109308309A (en) * 2018-07-27 2019-02-05 网宿科技股份有限公司 A kind of data service quality appraisal procedure and terminal
CN109308309B (en) * 2018-07-27 2021-04-16 网宿科技股份有限公司 Data service quality assessment method and terminal

Similar Documents

Publication Publication Date Title
US7499777B2 (en) Diagnostic and prognostic method and system
US7251582B2 (en) Fault diagnosis
US6625589B1 (en) Method for adaptive threshold computation for time and frequency based anomalous feature identification in fault log data
US20070061144A1 (en) Batch statistics process model method and system
Hu et al. Web service recommendation based on time series forecasting and collaborative filtering
CN109062189B (en) Industrial process fault diagnosis method for complex fault
US20120303348A1 (en) System and methods for fault-isolation and fault-mitigation based on network modeling
KR20140092805A (en) Dynamic outlier bias reduction system and method
US20150269293A1 (en) Diagnostic model generating apparatus and method, and abnormality diagnostic apparatus
CN111814342B (en) Complex equipment reliability hybrid model and construction method thereof
CN111552509A (en) Method and device for determining dependency relationship between interfaces
CN102055604A (en) Fault location method and system thereof
Liu et al. Accelerated life test plans for repairable systems with multiple independent risks
Hu et al. Optimization configuration of gas path sensors using a hybrid method based on tabu search artificial bee colony and improved genetic algorithm in turbofan engine
CN104933492A (en) On-line reliability prediction and improvement method of shopping system
CN116361059B (en) Diagnosis method and diagnosis system for abnormal root cause of banking business
CN115629998B (en) Test case screening method based on KMeans clustering and similarity
CN112907026A (en) Comprehensive evaluation method based on editable mesh index system
CN103914386B (en) Software defect positioning method based on input parameter characteristic spectrum
Khoshgoftaar et al. A comparative study of ordering and classification of fault-prone software modules
CN111769974A (en) Cloud system fault diagnosis method
CN110221590A (en) A kind of industrial process Multiple faults diagnosis approach based on discriminant analysis
CN106569944A (en) Constraint-tree-based onboard software test data analysis method
CN111289231B (en) Rotor system health monitoring method and system based on incomplete B-spline data fitting
CN110348005B (en) Distribution network equipment state data processing method and device, computer equipment and medium

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20150923