Научная статья на тему 'Multi-line Markov closed queuing system for two maintenance operations'

Multi-line Markov closed queuing system for two maintenance operations Текст научной статьи по специальности «Математика»

CC BY
68
13
i Надоели баннеры? Вы всегда можете отключить рекламу.
Область наук

Аннотация научной статьи по математике, автор научной работы — R. V. Kakubava

In the given paper multi-component standby system with renewable elements is considered. For it multiline closed Markov queuing model for two maintenance operations – replacements and renewals, is constructed and investigated. In this model the numbers of main elements as well as standby ones, also the numbers of replacement units as wall as renewal ones are arbitrary. An economic criterion for dependability planning (structural control) of considered system is introduced, the optimization problem is stated and partially investigated.

i Надоели баннеры? Вы всегда можете отключить рекламу.
iНе можете найти то, что вам нужно? Попробуйте сервис подбора литературы.
i Надоели баннеры? Вы всегда можете отключить рекламу.

Текст научной работы на тему «Multi-line Markov closed queuing system for two maintenance operations»

MULTI-LINE MARKOV CLOSED QUEUING SYSTEM FOR TWO MAINTENANCE OPERATIONS

R. V. Kakubava

Georgian Technical University, Tbilisi, Georgia

r.kakubava@gmail.com

ABSTRACT

In the given paper multi-component standby system with renewable elements is considered. For it multiline closed Markov queuing model for two maintenance operations - replacements and renewals, is constructed and investigated. In this model the numbers of main elements as well as standby ones, also the numbers of replacement units as wall as renewal ones are arbitrary. An economic criterion for dependability planning (structural control) of considered system is introduced, the optimization problem is stated and partially investigated.

1. INTRODUCTION

The investigation of the problem of construction and investigation of maintenance models for multi-component systems is one of the topical directions in the modern reliability theory [10], [5]. This problem plays a key role in the dependability planning (structural control by economic criteria) of telecommunication and production systems [1], [4]. Let's consider the last statement in detail.

Since the beginning of the second half of the 80ies of the last century considerable changes have taken place in the field of telecommunication, affecting the interests of telecommunication service providers, as well as users and equipment manufacturers.

Here we mean de-monopolization in the field of telecommunication services in almost all developed countries of the world; creation of open market of traditional and new types of service and as a sequence, intensification of competition between telecommunication service providers; strengthening of requirements on the part of users; rapid development and inculcation of new technologies, architectures, etc.

The result of these changes is a considerable increase of interest to the problems of dependability of telecommunication networks and their components.

The essence of this is: low dependability threatens telecommunication service providers with not only possible loss of clients, but also directly affects the economical indices. The refuse of service to users, because of non-serviceability of telecommunication means, is expressed in lost income and frequently in direct losses caused by penal sanctions claimed by users.

Naturally, this problem was in the focus of ITU (International Telecommunications Union). Namely, ITU has issued recommendation E.862 "Dependability planning of telecommunication networks" (Geneva, 1992), which by ITU's assignment was prepared by Swedish experts.

Recommendation E.862 is concerned with models and methods for dependability planning, operation and maintenance of telecommunication networks and the application of these methods to various services in international network.

For all that, this Recommendation gives quite convincing preference to analytical methods for dependability planning, _compared to other methods.

In particular, it is ascertained that the application of the analytical methods gives economically the best-balanced level of dependability, seen from the customer's point of view. This reduces the risk of customer's complaints and loss of business to competitors, as well as the risk of

unnecessary investments. It is, therefore, considered to be the best general way of planning for administration, as well as for customers[5].

After this ITU has worked out a lot of documents on the problems of telecommunication service quality and dependability. According to ITU documents Quality of Service (QoS) is the degree of service a provider performs for a client, including the existing agreement relation between them(Service Level Agreement -SLA).

SLA between service providers and users regulates technical, organizational, legal and financial aspects and is becoming an important factor in competition in the developed countries.

A substantial part of SLA is the list of dependability indices and the values the guarantee of their provision being given by the provider. And this is not accidental, as dependability is one of the most important determining factor of quality.

Thus, service provider, i.e., company that leases telecommunication channels has to fundamentally study his possibilities, collect and process statistic data so that to have full idea about the quality of the provided service. Only in this way is it possible to rationally estimate the given guarantees, compensation forms and size he will have to pay in behalf of the client if SLA demands will be broken. In these conditions the optimization of dependability and structure of telecommunication networks and their components acquire particularly great importance.

Described situation, along with other new important developments (circumstances) yet again confirms necessity to construct and research complex systems' reliability and maintenance new, more adequate models.

Simultaneously, until now, models of standby multi-component systems with repairable elements, that would take into account a number of very essential factors, have been developed neither in the mathematical theory of reliability and maintenance nor in the queuing theory, which is the theoretical basis of the reliability models for complex repairable systems.

One of such factors is the length of time, required for the replacement of the failed element in a complex system. The necessity of consideration of this factor has long been emphasized by the leading reliability theory and practice experts [8], [9], [2]. However, only a few simple cases have so far been investigated in this direction. Simultaneously, modern methods of mathematical theory of reliability allow to construct and investigate such models [6], [7].

The matter is that in a majority of cases in which the reliability is investigated, the replacement of the failed element is not regarded as a separate operation.

For relatively simple systems there is no need for making such an assumption, since the replacement operation can be included in the complex maintenance operation, which is a sequence of two operations: repair and replacement.

However, after the failure of some element in renewable multi-element standby systems, the necessity of its replacement by a serviceable standby one comes to the foreground and thus the replacement is quite naturally distinguished as an independent maintenance operation.

In other cases it is supposed that the replacement time length is essentially smaller, than the repair time length, and therefore can be neglected (instant replacement).

But in many systems, especially in complex production ones, the time length of the replacement operation frequently has the same order as the repair time length and may even exceed it. Therefore the assumption about an instant replacement is quite rough. Such an assumption is especially inadmissible in the conditions of a generalized interpretation of the notions of the reliability theory given below.

Namely, the failure of some element is understood as the occurrence of an event when this element cannot execute the definite category of tasks with stated priority. This may be caused not only by the loss of element serviceability, but also by other factors, for example, when an element is switched over to the execution of higher priority tasks, readjustment, heating and so on. Within the framework of such an approach, under the repair time we mean the length of time during which an element is unserviceable in a generalized sense, i.e. is not able to fulfil the above-mentioned flow of

tasks. From this generalized interpretation of the notions of failure and repair we easily come to the notion of standby and other notions in a generalized sense. For the background and usefulness of such an interpretation see [3].

2. SYSTEM DESCRIPTION

The basic model in the form of a closed queuing system with two types of service operations is described as follows.

The technical system consists of m main and n standby elements. All elements are identical. It is supposed that for the normal operation of the system, the serviceability of all m main elements is desired. However, if their number is less than m, then the system continues to function but with lower economic effectiveness. The main elements fail with intensity a and the standby ones - with intensity P. A failed main element is replaced by a serviceable standby one if there is such a possibility in the system. In the opposite case (all standby elements are non-serviceable, or the serviceable standby elements are already intended for the replacement of earlier failed main elements) the replacement will be carried out as soon as it becomes possible. The failed elements, both the main and the standby ones, are repaired and become identical to the new ones. There are k and replacement and l repair units in the system. The time lengths of replacement and repair operations have distribution functions F (x ) and G(x ), respectively(Figure 1).

Di D2 Renewal

Figure 1.. General Scheme of Closed Queuing System for Replacements and Renewals

Di, D2, D3, D4 - disciplines of distribution to resources for requests; Qi - queue to replacement units; Q2 - queue to repair units.

Only a few particular cases of the described system have so far been investigated in the reliability and queuing theories, namely:

1. m = 1, n = 1 ;

2. m = 1, n = 2;

3. m = 2, n = 1;

4. M/M/N, i.e. the repair time length has an exponential distribution, while the replacement time length equals zero (instant replacement);

5. some similar cases have also been investigated.

In the last 6-7 years the specialists of Georgian Technical University have succeeded in making considerable progress in the investigation along these lines. In particular, the models have been constructed and partly investigated for the following cases:

1. m, n, k, l are arbitrary; the functions F(x) and G(x) are exponential;

2. m, n and the function F(x) are arbitrary; k = l = 1 and the function G(x) is exponential;

3. m, n and the function G(x) are arbitrary; k = l = 1 and function F(x) is exponential;

4. some similar statements have also been considered.

3. THE MATHEMATICAL MODEL

In this section we construct and investigate the mathematical model for the case where m, n, k and l are arbitrary. The replacement and repair time lengths have exponential distribution functions with parameters A and / respectively.

For describing of considered system we introduce the random processes, which determine the states of considered system at the moment t.

i(t) - the number of elements missed in main group of elements;

j(t) - the number of nonserviceable (failed) elements in the system;

Denote, p(i, j, t) = P{i(t) = i; j(t) = j}, i = 1, m; j = 0, n + i.

We suppose that there exists lim p(i, j, t ) = p(i, j) ;

t

Regarding to the functions introduced above we construct a system of usual linear differential first order equations (Kolmogorov equations), which in steady mode transforms into the system of linear algebraic equations. They form four groups of equations describing the following merged states of the considered system:

1. A free state (in the system there are no requests neither for replacement nor for renewal);

2. Replacement (only the replacement operation is carried out in the system);

3. Repair (only the repair operation is carried out in the system);

4. Replacement and repair (both the replacement and the repair operation are carried out in the system).

Hence, in the case k < l < n < m we obtain the mathematical model in steady state mode in the form of the system of linear algebraic equations regarding p(i, j), i = 1, m; j = 0, n + i.

1. Free state

(ma + np)P(0,0) = AP(1,0) + /P(0,1) (1.1)

2. Replacement

(m - i)a + nß + X)P(i,0) = (i + 1)XP(i +1,0) + ßP(i,1),0 < i < k ; (2.1)

(m - i)a + (n +1 - k)ß + kX)P(i,0) = kXP(i +1,0) + ßP(i,1), k < i < m ; (2.2)

(m + n - k)ß + kX)P(m,0) = /uP(m,1) ; (2.3)

3. Renewal

ma + (n - j)ß + jß)p(0, j) = Xp(1, j) + ( j + 1)ßp(0, j +1) + (n - j + 1)ß.p(0, j -1) ,

1<j</; (3.1)

ma + (m - j)ß + lß)p(0, j) = Xp(1, j) + ßp(0, j +1) + (n - j + 1)ß.p(0, j -1) ,

l<j<n; (3.2)

ma + lß)p(0, n) = Xp(1, n) + ß.p(0, n -1) ; (3.3)

4. Replacement and Renewal

(m - i)a + (n - j)ß + X + jß)p(i, j) = (m - i + 1)ap(i -1, j -1) + + (n - j + 1)ßP(i, j -1) + (i + 1)Xp(i +1, j) + (j + 1)ßp(i, j +1),1 < i < k,1 < j < l ; (4.1)

(m - i)a + (n - j)ß + X + lß)p(i, j) = (m - i + 1)ap(i -1, j -1) + (i + 1)Xp(i +1, j) +

+ (n - j + 1)ßp(i, j -1) + lßp(i, j +1),1 < i < k,l < j < n ; (4.2)

(m - j)a + (n + i - j)ß + lß)p(i, j) = p(i -1, j - 1)(m - i + 1)a + + (n + i - j + 1)Xp(i +1, j) + lßp(i, j +1), 1<i<k, n<j<n+i; (4.3)

(m - i)a + lp.)p(i, n + i) = (m - i + 1)ap(i -1, n + i -1) + Xp(i +1, n + i)

1<i<k; (4.4)

(m - i)a + (n + i - j - k)ß + lp + kX)p(i, j) = (n + i - j +1 - k)ßp(i, j -1) + + Àkp(i +1, j) + (j + 1)ßp(i, j +1), k < i < m,1 < j < l ; (4.5)

(m - i)a + (n + i - j - k)ß + lp + kX)p(i, j) = (m - i + 1)ap(i -1, j -1) +

n + i - j + 1)ßP(i, j -1) + kXP(i +1, j) + lßp(i, j +1), k<i<m, l<j<n+i-k; (4.6)

(m - i)a + (m - i - j+ lp)P(i, j) = (m - i + 1)aP(i -1, j -1) + (n + i +1 - j)XP(i +1, j) +

+ lßP(i, j +1), k < i < m, n + i - k < j < n + i ; (4.7)

(m - i)a + lp)P(i, n + i) = (m - i + 1)ap(i -1, n + i -1) + Xp(i +1, n + i) k<i<m; (4.8)

(m + n - j - k)ß + Xi + jp)p(m, j) = ap(m -1, j -1) +

+ (m + n - j +1 - k)ßp(m, j -1) + (j + 1)ßp(m, j +1),1 < j < l ; (4.9)

(m + n - j - k)ß + Xk + lp)p(m, j) = ap(m -1, j -1) +

+ (m + n - j +1 - k)ßP(m, j -1) + lßP(m, j +1), l < j < m + n - k ; (4.10)

((m + n - j)X + 1p,)p(m, j)p(m, j) = ap(m -1, j -1) + 1^p(m, j +1),

m+n-k<j<m+n; (4.11)

l^p(m, m + n) = ap(m -1, m + n -1).

m n+i

The obtained system together with equilibrium condition: !! p(i, j) = 1 has, as a rule, unique

i=0 j=0

solution. It's only computational difficulty to find that solution.

In the same way it can be written similar equations for the other arbitrary alignments of m,n,k,1 parameters, but we'll not discuss this question here.

4. ECONOMIC ANALYSIS

The system elements as well as maintenance units give different profits depending on the their following states (positions).

iНе можете найти то, что вам нужно? Попробуйте сервис подбора литературы.

For system elements: 1. main; 2. serviceability standby being under replacement; 3. serviceability standby not being under replacement; 4. failed standby being under repair; 5. failed standby not being under repair.

For maintenance units: 6. working replacement; 7. non-working replacement; 8. working repair; 9.non-working repair.

The profit amount per some fixed time interval (time unit) from one system element or one maintenance unit is ci, i = 1,9 for above-mentioned states. Some of this ci may be non-positive.

Denote by Et, i = 1,9 the average number (mathematic expectation) of system elements or maintenance units at the arbitrary time moment in the steady mode of system functioning.

It is not difficult to obtain the expressions for Et, i = 1,9.

Namely,

m n+ 2

E1 =Z(m - 0! p^j);

i=0 j=0

k-1 f n m ^ m n+i-k

E2 =!r ! p(r, j) + ! p(^n+i- r) + k! ! p(i, j);

r=1 y j=0 i=r+1 J i=k j=0

m n+i

E3 = !!(n+i - j) p(i, j ) - E2 ;

i=0 j=0

/ -1 m m n+i

E4 = ! r! p(i, j)+/! ! p(i, j);

j=0 i=0 i=0 j=l

E 5 =!! jp(i, j ) - e4;

i=0 j=0

E6 = E2 ;

E7 = k - E6 = k - E2;

E8 = E4 ;

E9 — 1 E8 — 1 E4;

We introduce the function for economic analysis of the system. This function expresses the profit of examined systems per time unit, taking into account the above-mentioned values.

Initial characteristics of considered systems - m, n, k, l, a, p and 1 enter into the expression of profit function through p(i, j)- probabilistic characteristics of considered systems. Profit function

9

also depends on c2 ,... , c9 in the following way F = F(n,k,/) = ^ciEi .

i=l

Eventually, the problem of system optimization is stated as problem of mathematical programming (integer programming).

Namely, with those fixed m, a, p, 1, p, c2,..., c9 for the considered system to select such values of the parameters n, k, l (optimal numbers of standby elements, replacement units and renewal units) so that the profit function F would accept maximum value and to determine this value.

That means the solving of problem of analytical synthesis of multi-element recoverable standby system by economical criterion.

We believe, this result will be very useful for experts working in the field of design, control and management of complex systems.

5. CONCLUSIONS

Main goal of mathematical model, constructed by us, is structural optimization (structural management) of considered system by economic criteria. Since connections between system's elements is fixed, its structural optimization means selection of optimal quantity of standby elements, replacement units and repair units.

From this point of view, intermediate characteristic values p(i,j), introduced by us, are very fruitful: 1) using them it is not difficult to construct mathematical model; 2) system's effectiveness criterion F(n,k,l) is easily expressed by their means.

Finally, structural management problem is brought to integer programming problem, which's solution is only computational difficulty.

ACKNOWLEDGEMENT

"The designated project has been fulfilled by financial support of the Georgia National Science Foundation (Grant ##GNSF/STO07/3-173). Any idea in this publication is possessed by the author and may not represent the opinion of the Georgia National Science Foundation itself."

REFERENCES

1. ITU-T Recommendation E.862 (Rev. 1). 1992. Dependability Planning of Telecommunication Networks, Geneva.

2. Jastrebenetsky M.A., Ivanova G.M. 1989. Nadezhnost avtomatizirovannykh system upravlenija tekhnologicheskimi processami. M.: Energoatomizdat.

3. Kakubava R., Khurodze R. 2004. Technical Systems with Structural and Time Redundancy: A Probabilistic Analysis of Their Performance. Automation and Remote Control, vol. 65, no. 5, pp. 825-833 (translated from Avtomatika I Telemekhanika, 2004, no. 5, pp.154-165)

4. Kakubava R., Khurodze R. 2005. Some mathematical aspects of dependability planning of technical systems. Bull. Georgian Acad. Sci., vol. 171, no. 3, pp.250-254.

5. Kakubava R. 2009. New Markovian and semi-Markovian closed queuing systems with two types of service as mathematical models of reliability and maintenance. Extended Abstracts, VI International Conference MMR 2009 - Mathematical Methods in Reliability, M.: RSUOG, pp. 472-474

6. Korolyuk V.S., Limnios N. 2005. Stochastic Systems in Merging Phase Space. World Scientific, Imperial College Press.

7. Limnios N., Oprisan G. 2001. Semi-Markov Processes and Reliability. Birkhauser, Boston.

8. Raykin A. L. 1967. Elementy teorii nadezhnosti dlja proektirovanija tehnicheskih system. M.: Sovetskoye Radio.

9. Ushakov I. A. (Ed.). 1985. Nadezhnost tekhnicheskikh sistem. M.: Radio i Svyaz.

10. Ushakov I. 2006. Reliability: past, present, future. Reliability: Theory & Applications, vol. 1, no. 1, pp. 10-16 (electronic).

i Надоели баннеры? Вы всегда можете отключить рекламу.