CN103023703A - Network timely reliability accelerated test method based on M/M/s queuing model - Google Patents

Network timely reliability accelerated test method based on M/M/s queuing model Download PDF

Info

Publication number
CN103023703A
CN103023703A CN2012105528950A CN201210552895A CN103023703A CN 103023703 A CN103023703 A CN 103023703A CN 2012105528950 A CN2012105528950 A CN 2012105528950A CN 201210552895 A CN201210552895 A CN 201210552895A CN 103023703 A CN103023703 A CN 103023703A
Authority
CN
China
Prior art keywords
network
reliability
prime
model
max
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.)
Granted
Application number
CN2012105528950A
Other languages
Chinese (zh)
Other versions
CN103023703B (en
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.)
Beihang University
Original Assignee
Beihang University
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 Beihang University filed Critical Beihang University
Priority to CN201210552895.0A priority Critical patent/CN103023703B/en
Publication of CN103023703A publication Critical patent/CN103023703A/en
Application granted granted Critical
Publication of CN103023703B publication Critical patent/CN103023703B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a network timely reliability accelerated test method based on an M/M/s queuing model. The method includes the following steps that (1) components of a queuing model are obtained according to a delayed fault mechanism of a communication network queuing model, and service intensity requirements are determined; (2) a network timely reliability model is obtained; (3) a reliability accelerated model is obtained on the basis of a similarity theory; and (4) a network timely reliability accelerated test is performed. According to the network timely reliability accelerated test method based on the M/M/s queuing model, problems that current network reliability tests are overlong in test time, extremely high in costs or insufficient in quantity of short time test samples and low in confidence coefficient can be effectively solved, and thereby the test efficiency is improved.

Description

Based on the timely reliability accelerated test method of the network of M/M/s queuing model
Technical field
The invention belongs to network service and reliability engineering field, be specifically related to the timely reliability accelerated test method of a kind of network based on the M/M/s queuing model.
Background technology
Along with development and the application of network technology, to network quantitatively and the understanding of science of qualitative features, become an extremely important challenge subjects, even be called as " new science of network ".Along with popularizing that network uses, offered load increases, and has become the major issue that the network quantitative characteristic is understood by the congested timely reliability that causes.
Before a new network built up, before a kind of new service was come into operation, test was the important channel of examination network reliability.Yet, the network task cycle is generally longer, in order effectively to expose fault, the network reliability test duration is the several times of its duty cycle (list of references [1]: Zhang Jiantao often, open sword. forces network combined reliability test and inspection [J]. electronic product reliability and environmental test, 25 (2), 2007:19-22), this directly causes the lead time long.In order in reliability test, to expose fast design defect, determine the network reliability level, be necessary to take accelerated test, increase the cycle-index in the unit interval, the appearance of acceleration disturbance pattern.Acceleration model is the prerequisite of design accelerated test.For the timely reliability of network, its fault mode is that time delay is long, and the queuing mechanism of network provides support for exploring delay fault mechanism and definite acceleration model.Similarity theory is the theory of the various physical process principles of similitude in research nature and the engineering, is the theoretical foundation of determining acceleration model.
The research of existing accelerated test and acceleration model is hardware art mostly, does not carry out the exploration of reliability acceleration model and test method for communication network.The method that there is no solves the problem that the network reliability test duration is long, expense is too high or the short-term test sample size is not enough, confidence level is on the low side.
Summary of the invention
The objective of the invention is in order to solve reliability test overlong time or short-term test assessment confidence level problem on the low side, the timely reliability accelerated test method of a kind of network based on the M/M/s queuing model is proposed, by derivation and the checking of carrying out the reliability acceleration model, formulate the timely reliability accelerated test of network scheme.
The timely reliability accelerated test method of a kind of network based on the M/M/s queuing model comprises the steps:
Step 1: according to the delay fault mechanism of communication network queuing model, obtain the composition of queuing model, determine the service intensity requirement;
Step 2: obtain the timely reliability model of network;
Step 3: obtain the reliability acceleration model based on similarity theory;
Step 4: carry out the timely reliability accelerated test of network;
Advantage of the present invention and good effect are:
(1) the inventive method has proposed based on the timely reliability acceleration model of the network of queueing theory, the network reliability acceleration model of derivation and checking M/M/s queuing system under the guidance of similarity theory, this is the another application of similarity theory on accelerated test, also be its another application on network flow simultaneously, this is the core of accelerated test, is the model basis of planning accelerated test.
(2) the inventive method is the network reliability accelerated test method basis that theorizes: the acceleration model that draws according to derivation, can further determine the communication network test method, this is the popularization of product accelerated life test on network object, the problem of can effectively solve current network reliability test overlong time, expense is too high or the short-term test sample size not enough, confidence level is on the low side, and then improve test efficiency.
Description of drawings
Fig. 1 is method flow diagram of the present invention;
Fig. 2 is that OPNET sets up M/M/s queuing model exemplary plot among the present invention;
Fig. 3 is certain communication network topology exemplary plot in the embodiment of the invention.
Embodiment
The present invention is described in further detail below in conjunction with drawings and Examples.
The present invention proposes the timely reliability accelerated test method of a kind of network based on the M/M/s queuing model, comprises the steps:
Step 1: according to the delay fault mechanism of communication network queuing model, obtain the composition of queuing model, determine the service intensity requirement.
Specifically comprise the steps:
Step 1.1, obtain the composition of queuing model: the composition of queuing model by input process, arrive rule, queue discipline, service organization's structure, service time, service regulation and form.
The M/M/s queuing model, the expression input process is the negative exponent distribution that data are spaced apart λ the time of advent, arriving rule is the single arrival of data, data source totally is that infinite source is overall, queue discipline is First Come First Served, and service organization's structure is the service in parallel of s information desk, and capacity is infinite, service time, service regulation was for once serving the queuing model of individual data in order to obey the negative exponent distribution that average service time is μ.(list of references [2] Tang Yinghui, Tang individual. queueing theory-basis and analytical technology [M]. Beijing: Science Press, 2006:33) after network packet arrives, idle such as switch presence service platform, then begin to provide data exchange service, otherwise wait in line, until all packets in front are finished exchanges data.If residence time is long, when reaching failure criterion, delay fault occurs then.
Step 1.2 determines that the service intensity of queuing model requires: work as ρ s=λ/s μ<1 o'clock, ρ sExpression queuing model service intensity, queuing model can reach statistical equilibrium, consists of probability distribution residence time, is the precondition of the inventive method; Otherwise data arrive accumulation can be more and more, and queuing model can't reach stable state, and queuing delay can be in time and increases progressively trend, and this situation is inquired into delay fault and had little significance.
Step 2: obtain the timely reliability model of network;
Specifically comprise the steps:
Step 2.1 is determined the timely reliability expression of network, and reliability is the metric of reliability on probability, and in time reliability expression is in network:
R=P{D≤D max} (1)
In the formula, D represents network data transmission time delay, D MaxThe maximum delay that the expression user allows, namely failure criterion, R represents the timely reliability of network, P represents that the actual time delay of network is no more than the probability of the maximum delay of user's permission.
Step 2.2 is determined distribution function residence time, and distribution function residence time of the queuing model of M/M/s is:
The queuing system of M/M/s residence time distribution function according to list of references [2] Tang Yinghui, Tang individual. queueing theory-basis and analytical technology [M]. Beijing: Science Press, 2006:33 can access.
W ( t ) = P ( W ≤ t ) = 1 - e - μt [ 1 + p s 1 - ρ s μt ] , ρ = s - 1 , 1 - e - μt - p s ( s - ρ - 1 ) ( 1 - ρ s ) [ e - μt - e - μ ( s - ρ ) t ] , ρ ≠ s - 1 . - - - ( 2 )
In the formula: W is the residence time of packet in model, for the stand-by period and service time sum.T is the time independent variable.The residence time W of W (t) expression packet in model is no more than the probability of t.
Figure BDA00002609949900032
Figure BDA00002609949900033
When queuing model was determined, the service number of units was s, and s is constant, p sFor Number of Customers in the model is the probability of s, expression formula can be designated as p s=f (ρ).
In fact, formula (2) is exactly the expression formula of the timely reliability of communication network.In the formula (2), t is exactly given time delay threshold value D MaxConvolution (1) and formula (2), the timely reliability model of network can be expressed as:
R = P ( D ≤ D max ) = 1 - e - μ D max [ 1 + p s 1 - ρ s μD max ] , ρ = s - 1 , 1 - e - μD max - p s ( s - ρ - 1 ) ( 1 - ρ s ) [ e - μD max - e - μ ( s - ρ ) D max ] , ρ ≠ s - 1 . - - - ( 3 )
In the formula: R is the timely reliability of network.
Step 3: obtain the reliability acceleration model based on similarity theory;
Specifically comprise the steps:
If formula (3) is the reliability model of primitive network, then the reliability model of similar network is:
R ′ = 1 - e - μ ′ D max ′ [ 1 + p ′ s 1 - ρ ′ s μ ′ D max ′ ] , ρ ′ = s - 1 , 1 - e - μ ′ D max ′ - p ′ s ( s - ρ ′ - 1 ) ( 1 - ρ ′ s ) [ e - μ ′ D max ′ - e - μ ′ ( s - ρ ′ ) D max ′ ] , ρ ′ ≠ s - 1 . - - - ( 4 )
In the formula: R' is the timely reliability of similar network, D' MaxThe maximum delay that the expression user allows,
Figure BDA00002609949900043
Figure BDA00002609949900044
λ ' is the similar network data interval time of advent, and μ ' is the average service time of similar network, and the service number of units is s.
Make the service number of units s in the similar network not change, consider
Figure BDA00002609949900045
Figure BDA00002609949900046
p s=f (ρ), actual in the formula (3) have 4 physical quantitys, and namely R, λ, μ and D make affinity constant be respectively c R, c λ, c μAnd c D, represent in the similar network variation multiple of relevant parameter in the parameter and primal system, that is:
R ′ = c R · R μ ′ = c μ · μ λ ′ = c λ · λ D max ′ = c D · D ma - - - ( 5 )
For simplicity, require reliability R' in the similar network and the reliability R in the primitive network to remain unchanged, that is: c R=1; And it is equal according to the affinity constant of interarrival time and average service time to take the mean, i.e. c μ=c λAccording to similar first theorem, simultaneous formula (3), formula (4) and (5) then can get: c μC D=1
Thus, obtain 3 similarity criterions of M/M/s queuing model, this criterion is the reliability acceleration model:
c R = 1 c μ = c λ c μ · c D = 1 - - - ( 6 )
Along with the increase of network data arrival intensity, the packet number that arrives in the same time increases, and the reliability information amount increases.Require in order to reach the required data volume of reliability test truncation (the demonstration test scheme [S] of list of references [3] GB5080.5-85. equipment dependability success of the test rate. the Ministry of Electronics Industry of the People's Republic of China (PRC), the .1985:5-9 of Ministry of Astronautics Industry), network data arrives intensity and increases c λDoubly, the test duration can reduce c λDoubly, the data volume of twice test is constant.The pass of namely testing duration and network data arrival intensity is:
c λ=t/t′ (7)
In the formula: t is primitive network test duration, and t ' is similar network test duration.
Step 4: use the OPNET emulation platform reliability acceleration model is verified;
Specifically comprise the steps:
Step 4.1 is set up the M/M/s queuing model with OPNET;
Step 4.2, design is chosen λ, μ and D based on the reliability model of the primitive network of M/M/s queuing model, and test duration t, carries out OPNET emulation;
Step 4.3, design is chosen λ, μ and the corresponding similarity factor c of D based on the reliability model of the similar network of M/M/s queuing model according to (6) formula λ, c μAnd c D, determine similar network reliability model parameter, and test duration t ', satisfy t'=t/c λ, carry out OPNET emulation;
Step 4.4 is calculated the timely reliability of primitive network and similar network, and is compared.In the emulation, the statistical method of the timely reliability of network is:
R=N n/N t (8)
In the formula, N tThe total number of packet of expression Internet Transmission, N nThe expression network transfer delay is no more than the maximum delay D that the user allows MaxThe packet number, namely transmit timely packet number.
Constantly calculate reliability at primitive network with the corresponding t of similar network, calculate its mean square error.If increase in the emulation of multiple in the failure criterion of many groups and stress, primitive network and similar Reliability of network mean square error think that then this acceleration model is correct and reasonably all within the acceptable range.
Step 5: carry out the timely reliability accelerated test of network;
Specifically comprise the steps:
Step 5.1 is determined network data collection quantity, and the hypothetical network model is the M/M/s queuing model, and delay fault is obeyed binomial distribution, value check upper limit R, discrimination ratio D, producer risk α and consumer's risk β.So, can check in the Delay quantity that requirement needs to collect packet at least in the reliability compliance test.
Step 5.2 is obtained the accelerated test parameter, if primitive network mission profile parameter and time delay threshold value are λ, μ and D Max, the test duration is t.Choose λ, μ and D according to (6) formula rule MaxCorresponding similarity factor c λ, c μAnd c D, can obtain λ ', μ ' and D ' MaxCarrying out duration according to the accelerated test parameter is t'=t/C λThe reliability accelerated test, obtain the timely reliability of this accelerating network.It is identical with the timely reliability of primitive network that this value can be thought, namely can obtain the timely reliability of primitive network.
Embodiment:
Emulation part in the embodiment of the invention is specifically set forth the simulating, verifying of the middle acceleration model of the inventive method take OPNET queuing model shown in Figure 2 as example, and test portion is set forth concrete reliability accelerated test scheme take actual communication networks shown in Figure 3 as example.
3 nodes are arranged among Fig. 2, are respectively data sending terminal (src), queueing mechanism (queue) and data receiver (sink).At transmitting terminal the distribution of packet arrival interval and long data packet can be set, queue discipline and distribution service time can be set at the queueing mechanism place.
The timely reliability accelerated test method of network based on the M/M/s queuing model of the present invention, step as shown in Figure 1, wherein step 1, two, three identical with embodiment the inside is not repeated herein, step 4 and five concrete grammars are as follows:
Step 4: use the OPNET emulation platform reliability acceleration model is verified that concrete grammar is:
Step 4.1 is set up the M/M/s queuing model with OPNET, and as shown in Figure 2: this data arrival interval and long data packet distribution that is in the src data sending terminal selects the exponential negative exponent to distribute, and the transaction module of queue queueing mechanism is selected acb_fifo_ms.
Step 4.2, design is based on the reliability model of the primitive network of M/M/s queuing model, choose certain λ, μ, t and D, carry out OPNET emulation: in this checking case, the network service rate is 9,600bit/s, data arrive intensity and obey the negative exponent distribution that average is 2.67packet/s, and data package size is obeyed the negative exponent distribution that average is 9,000bit, the service number of units is 5, i.e. ρ s=0.5.The hypothetical network delay fault is obeyed binomial distribution, get check upper limit R=0.999, discrimination ratio D=1.50, producer risk α and consumer's risk β are 10%, so, require to need at least to collect the Delay of 32922 packets in the reliability compliance test, therefore needed at least emulation 3.425 hours, just can arrive the packet of this quantity.Use OPNET emulation 4 hours, altogether collect 35789 packets.
Step 4.3, design is chosen c based on the reliability model of the similar network of M/M/s queuing model according to (6) formula rule λ, c μ, c tAnd c D, determine similar network reliability model parameter, and test duration t ', carry out OPNET emulation: get c μ=c λ=4, C D=c t=0.25, t'=1 hour, t 0State is identical constantly.So, the network service rate is 19200bit/s, and the negative exponent distribution that average is 5.34packet/s is obeyed at the average data interval time of advent, and data package size is obeyed the negative exponent distribution that average is 9000bit.According to acceleration model, 36000 packets are collected in emulation 1 hour altogether.
Step 4.4 is calculated the timely reliability of primitive network and similar network, and is compared.In the emulation, the statistical method of the timely reliability of network is:
R=N n/N t (8)
In the formula, N tThe total number of packet of expression Internet Transmission, N nThe expression network transfer delay is no more than the maximum delay D that the user allows MaxThe packet number, namely transmit timely packet number.
In former network and similar network respectively take 8 minutes and 2 minutes as the interval, point estimate according to the end-to-end timely reliability of formula (8) computing network, and under different delay fault criterions, calculate the mean square error of primitive network and the timely reliability of similar network, as shown in table 1.In the present embodiment, when primitive network time delay threshold value when 2 ~ 5s changes, mean square error illustrates that all less than 0.02 under the value of different delay fault criterions, the applicability of the method is all stronger.Along with the increase of time delay threshold value, its mean square error is more and more less, and primitive network is higher with the similitude of similar network on reliability.Table 1 has also been discussed the absolute error of two timely reliabilitys of network, and it is worth all less than 3 * 10 -3, and the delay fault threshold value is stricter, i.e. the higher network of reliability to calculating, and absolute error is less, and the accuracy of this acceleration model is higher.
Table 1 failure criterion is on the impact of acceleration model
Figure BDA00002609949900071
Table 2 has further been discussed network to be increased under the multiple at different stress, the mean square error of primitive network and similar Reliability of Network.Here, when stress increased multiple 2 ~ 12 times of variations, the mean square error of two timely reliabilitys of network and absolute error changed little.This explanation, the multiple that network stress increases does not affect primitive network and the similitude of similar network on reliability.
Table 2 stress increases multiple to the impact of acceleration model
Figure BDA00002609949900082
In above-mentioned analysis, because each Δ t time period (Δ t=8min in the primitive network, Δ t=2min in the similar network) 1200 data of only having an appointment, so the timely reliability of two networks remains in certain error, absolute error is all 10 -4Near.If increase the data volume of unit interval, then error will significantly reduce.Table 3 be the information desk number on the impact of similar network, can find out that the variation of information desk number does not affect the applicability of the method yet.
Table 3 information desk number is on the impact of acceleration model
Figure BDA00002609949900083
Step 5: carry out the timely reliability accelerated test of network, the theoretical model of corresponding diagram 2, test portion are set forth concrete reliability accelerated test scheme take actual communication networks shown in Figure 3 as example:
Communication network is by two end systems among Fig. 3, and a switch forms.End system can be the system with specific function, such as AFDX avionics subsystem, also can be the common notebook in the local area network (LAN).Here end system mainly is to carry out transceiving data, sends data flow by end system A and is finally received by end system B by switch.
Step 5.1 is determined network data collection quantity, and the tentation data bag is the M/M/s queuing model by the time delay of switch, and delay fault is obeyed binomial distribution.According to user's requirement, as get check upper limit R=0.999, discrimination ratio D=1.50, producer risk α and consumer's risk β are 10%.So, by relevant criterion (the demonstration test scheme [S] of list of references [3] GB5080.5-85. equipment dependability success of the test rate. the Ministry of Electronics Industry of the People's Republic of China (PRC), the .1985:5-9 of Ministry of Astronautics Industry) can check in the Delay quantity that requirement needs to collect packet at least in the reliability compliance test, be 32922 packets herein.
Step 5.2 is obtained the accelerated test parameter, if primitive network mission profile parameter and time delay threshold value are λ=1packet/s, μ=2packet/s and D Max=50ms, the test duration is can collect at least 32922 packets more than the t=9.145h.Choose λ, μ and D according to (6) formula rule MaxCorresponding similarity factor c λ, c μAnd c D, can obtain λ ', μ ' and D ' MaxAs get c μ=c λ=4, c D=0.25, D Max=12.5ms.Carrying out duration according to the accelerated test parameter is t'=t/c λThe reliability accelerated test of=9.145/4=2.23h by hardware tools or each packet of software measurement time delay by switch, just can obtain stipulating to be no less than the delay data of 32922 packets.Utilize the delay data of these acquisitions, can calculate the timely reliability R of this accelerating network in conjunction with (8) formula, be assumed to be 0.99, it is identical with the timely reliability of primitive network that this reliability value can be thought, can think that namely the timely reliability of primitive network is 0.99.

Claims (1)

1. the timely reliability accelerated test method of the network based on the M/M/s queuing model comprises the steps:
Step 1: according to the delay fault mechanism of communication network queuing model, obtain the composition of queuing model, determine the service intensity requirement;
Specifically comprise the steps:
Step 1.1, obtain the composition of queuing model: the composition of queuing model by input process, arrive rule, queue discipline, service organization's structure, service time, service regulation and form;
The M/M/s queuing model, the expression input process is the negative exponent distribution that data are spaced apart λ the time of advent, arriving rule is the single arrival of data, data source totally is that infinite source is overall, queue discipline is First Come First Served, and service organization's structure is the service in parallel of s information desk, and capacity is infinite, service time, service regulation was for once serving the queuing model of individual data in order to obey the negative exponent distribution that average service time is μ; After network packet arrives, idle such as switch presence service platform, then begin to provide data exchange service, otherwise wait in line, until all packets in front are finished exchanges data; If residence time is long, when reaching failure criterion, delay fault occurs then;
Step 1.2 determines that the service intensity of queuing model satisfies ρ s=λ/s μ<1, ρ sExpression queuing model service intensity;
Step 2: obtain the timely reliability model of network;
Specifically comprise the steps:
Step 2.1 is determined the timely reliability expression of network, and in time reliability expression is in network:
R=P{D≤D max} (1)
In the formula, D represents network data transmission time delay, D MaxThe maximum delay that the expression user allows, namely failure criterion, R represents the timely reliability of network, P represents that the actual time delay of network is no more than the probability of the maximum delay of user's permission;
Step 2.2 is determined distribution function residence time, and distribution function residence time of the queuing model of M/M/s is:
W ( t ) = P ( W ≤ t ) = 1 - e - μt [ 1 + p s 1 - ρ s μt ] , ρ = s - 1 , 1 - e - μt - p s ( s - ρ - 1 ) ( 1 - ρ s ) [ e - μt - e - μ ( s - ρ ) t ] , ρ ≠ s - 1 . - - - ( 2 )
In the formula: W is the residence time of packet in model, for the stand-by period and service time sum; T is the time independent variable; The residence time W of W (t) expression packet in model is no more than the probability of t;
Figure FDA00002609949800012
Figure FDA00002609949800013
When queuing model was determined, the service number of units was s, and s is constant, p sFor Number of Customers in the model is the probability of s, expression formula can be designated as p s=f (ρ);
In fact, formula (2) is exactly the expression formula of the timely reliability of communication network; In the formula (2), t is exactly given time delay threshold value D MaxConvolution (1) and formula (2), the timely reliability model of network can be expressed as:
R = P ( D ≤ D max ) = 1 - e - μ D max [ 1 + p s 1 - ρ s μD max ] , ρ = s - 1 , 1 - e - μD max - p s ( s - ρ - 1 ) ( 1 - ρ s ) [ e - μD max - e - μ ( s - ρ ) D max ] , ρ ≠ s - 1 . - - - ( 3 )
In the formula: R is the timely reliability of network;
Step 3: obtain the reliability acceleration model based on similarity theory;
Specifically comprise the steps:
If formula (3) is the reliability model of primitive network, then the reliability model of similar network is:
R ′ = 1 - e - μ ′ D max ′ [ 1 + p ′ s 1 - ρ ′ s μ ′ D max ′ ] , ρ ′ = s - 1 , 1 - e - μ ′ D max ′ - p ′ s ( s - ρ ′ - 1 ) ( 1 - ρ ′ s ) [ e - μ ′ D max ′ - e - μ ′ ( s - ρ ′ ) D max ′ ] , ρ ′ ≠ s - 1 . - - - ( 4 )
In the formula: R' is the timely reliability of similar network, D' MaxThe maximum delay that the expression user allows,
Figure FDA00002609949800023
Figure FDA00002609949800024
λ ' is the similar network data interval time of advent, and μ ' is the average service time of similar network, and the service number of units is s;
Make the service number of units s in the similar network not change, consider
Figure FDA00002609949800026
p s=f (ρ), actual in the formula (3) have 4 physical quantitys, and namely R, λ, μ and D make affinity constant be respectively c R, c λ, c μAnd c D, represent in the similar network variation multiple of relevant parameter in the parameter and primal system, that is:
R ′ = c R · R μ ′ = c μ · μ λ ′ = c λ · λ D ′ max = c D · D ma - - - ( 5 )
If the reliability R' in the similar network and the reliability R in the primitive network remain unchanged, that is: c R=1; And it is equal according to the affinity constant of interarrival time and average service time to take the mean, i.e. c μ=c λAccording to similar first theorem, simultaneous formula (3), formula (4) and (5) then can get: c μC D=1;
Thus, obtain 3 similarity criterions of M/M/s queuing model, this criterion is the reliability acceleration model:
c R = 1 c μ = c λ c μ · c D = 1 - - - ( 6 )
Along with the increase of network data arrival intensity, the packet number that arrives in the same time increases, and the reliability information amount increases, and network data arrives intensity increase c λDoubly, the test duration reduces c λDoubly, the data volume of twice test is constant, and the pass of namely testing duration and network data arrival intensity is:
c λ=t/t′ (7)
In the formula: t is primitive network test duration, and t ' is similar network test duration;
Step 4: carry out the timely reliability accelerated test of network;
Specifically comprise the steps:
Step 4.1 is determined network data collection quantity, and the hypothetical network model is the M/M/s queuing model, and delay fault is obeyed binomial distribution, value check upper limit R, discrimination ratio D, producer risk α and consumer's risk β; Check in the Delay quantity that requirement needs to collect packet at least in the reliability compliance test;
Step 4.2 is obtained the accelerated test parameter, if primitive network mission profile parameter and time delay threshold value are λ, μ and D Max, the test duration is t; Choose λ, μ and D according to (6) formula rule MaxCorresponding similarity factor c λ, c μAnd c D, obtain λ ', μ ' and D ' MaxCarrying out duration according to the accelerated test parameter is t'=t/c λThe reliability accelerated test, obtain the timely reliability of this accelerating network; It is identical with the timely reliability of primitive network that this value is thought, namely obtains the timely reliability of primitive network.
CN201210552895.0A 2012-12-18 2012-12-18 Network timely reliability accelerated test method based on M/M/s queuing model Active CN103023703B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210552895.0A CN103023703B (en) 2012-12-18 2012-12-18 Network timely reliability accelerated test method based on M/M/s queuing model

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210552895.0A CN103023703B (en) 2012-12-18 2012-12-18 Network timely reliability accelerated test method based on M/M/s queuing model

Publications (2)

Publication Number Publication Date
CN103023703A true CN103023703A (en) 2013-04-03
CN103023703B CN103023703B (en) 2015-04-22

Family

ID=47971857

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210552895.0A Active CN103023703B (en) 2012-12-18 2012-12-18 Network timely reliability accelerated test method based on M/M/s queuing model

Country Status (1)

Country Link
CN (1) CN103023703B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103942610A (en) * 2014-04-04 2014-07-23 同济大学 Reconfigurable manufacturing system polymorphic configuration optimization method based on tasks
CN106845820A (en) * 2017-01-16 2017-06-13 北京航空航天大学 A kind of NFV system reliability assessment methods based on performance margin
CN111752243A (en) * 2020-06-12 2020-10-09 中国电子产品可靠性与环境试验研究所((工业和信息化部电子第五研究所)(中国赛宝实验室)) Production line reliability testing method and device, computer equipment and storage medium
CN113947263A (en) * 2021-12-22 2022-01-18 产业互联科技(北京)有限公司 Intelligent airport service desk scheduling prediction method
CN117176618A (en) * 2023-11-03 2023-12-05 中国西安卫星测控中心 Performance evaluation method for network data exchange software system

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101741641A (en) * 2009-11-30 2010-06-16 北京航空航天大学 Method for reliability test of communication network services based on link circuits
CN101957760A (en) * 2010-10-21 2011-01-26 浙江工商大学 Method for measuring process execution time
CN102035667A (en) * 2009-09-27 2011-04-27 华为技术有限公司 Method, device and system for evaluating network reliability
CN102571454A (en) * 2012-02-21 2012-07-11 北京航空航天大学 Reliability test and index verification method for communication network service based on failure distribution

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102035667A (en) * 2009-09-27 2011-04-27 华为技术有限公司 Method, device and system for evaluating network reliability
CN101741641A (en) * 2009-11-30 2010-06-16 北京航空航天大学 Method for reliability test of communication network services based on link circuits
CN101957760A (en) * 2010-10-21 2011-01-26 浙江工商大学 Method for measuring process execution time
CN102571454A (en) * 2012-02-21 2012-07-11 北京航空航天大学 Reliability test and index verification method for communication network service based on failure distribution

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
MEINAN LI, ET AL.: "The failure distribution for service layer of communication networks", 《CONSUMER ELECTRONICS, COMMUNICATIONS AND NETWORKS (CECNET), 2012 2ND INTERNATIONAL CONFERENCE ON》 *
WUYUE REN, ET AL.: "The applicability of traditional sampling techniques in the measurement of LAN availability", 《QUALITY, RELIABILITY, RISK, MAINTENANCE, AND SAFETY ENGINEERING (ICQR2MSE), 2012 INTERNATIONAL CONFERENCE ON》 *
李硕: "通信网络服务可靠性参数分析_", 《通信网络服务可靠性参数分析》 *
江逸楠: "网络可靠性评估方法综述", 《网络可靠性评估方法综述 *

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103942610A (en) * 2014-04-04 2014-07-23 同济大学 Reconfigurable manufacturing system polymorphic configuration optimization method based on tasks
CN103942610B (en) * 2014-04-04 2017-12-26 同济大学 The polymorphic configuration optimization method of reconfigurable manufacturing system of task based access control
CN106845820A (en) * 2017-01-16 2017-06-13 北京航空航天大学 A kind of NFV system reliability assessment methods based on performance margin
CN106845820B (en) * 2017-01-16 2020-07-24 北京航空航天大学 NFV system reliability evaluation method based on performance margin
CN111752243A (en) * 2020-06-12 2020-10-09 中国电子产品可靠性与环境试验研究所((工业和信息化部电子第五研究所)(中国赛宝实验室)) Production line reliability testing method and device, computer equipment and storage medium
CN111752243B (en) * 2020-06-12 2021-10-15 中国电子产品可靠性与环境试验研究所((工业和信息化部电子第五研究所)(中国赛宝实验室)) Production line reliability testing method and device, computer equipment and storage medium
CN113947263A (en) * 2021-12-22 2022-01-18 产业互联科技(北京)有限公司 Intelligent airport service desk scheduling prediction method
CN117176618A (en) * 2023-11-03 2023-12-05 中国西安卫星测控中心 Performance evaluation method for network data exchange software system
CN117176618B (en) * 2023-11-03 2024-01-09 中国西安卫星测控中心 Performance evaluation method for network data exchange software system

Also Published As

Publication number Publication date
CN103023703B (en) 2015-04-22

Similar Documents

Publication Publication Date Title
CN103023703B (en) Network timely reliability accelerated test method based on M/M/s queuing model
CN102780581B (en) AFDX (Avionics Full Duplex Switched Ethernet) end-to-end delay bound claculation method based on random network calculus
CN103914475A (en) Method, system and device for predicting video views
CN108880946B (en) Estimation method for data communication time delay between main station of wide area monitoring system and PMU (power management unit)
CN114039918B (en) Information age optimization method and device, computer equipment and storage medium
CN102571454B (en) Reliability test and index verification method for communication network service based on failure distribution
Basu et al. Verification of an AFDX infrastructure using simulations and probabilities
CN102904755B (en) Method and device for measuring quality of user experience of mobile-internet services
CN102508774A (en) Modeling method for software reliability growth model based on novel environmental factor function
CN103326901A (en) Method and system for testing broadband network performance of power system
Pries et al. On the usability of OpenFlow in data center environments
CN103218295B (en) The method of testing of ESB message handling ability and system
Li et al. An efficient method for evaluating the end-to-end transmission time reliability of a switched Ethernet
CN116700920A (en) Cloud primary hybrid deployment cluster resource scheduling method and device
Cassandras et al. Scheduling policies using marked/phantom slot algorithms
CN108446861A (en) Multi-source data quality evaluation method of power dispatching system based on directed graph sorting
CN112771816B (en) Method and device for predicting network rate
CN107688878B (en) Air Quality Forecast method and device
Jelenkovic et al. Capacity regions for network multiplexers with heavy-tailed fluid on-off sources
CN104251784A (en) Reliability accelerated testing method of combined stress of integrated mechanical and electrical product
Rösch et al. Delay modeling for virtualization-based Co-simulation of IEC 61850 substations
Jin et al. Fast simulation of background traffic through fair queueing networks
Kamoun Performance evaluation of a queuing system with correlated packet-trains and server interruption
Kamoun Performance analysis of two priority queuing systems in tandem
Al-Khatib et al. Traffic modeling and performance evaluation of wireless smart grid access networks

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant