On One Model of Multichannel Queuing System with Unreliable Repairable Servers and Input Memory ()

Ramaz R. Shamugia

Research Department of Radiophysics and Electronic Systems Modeling, Ilia Vekua Sukhumi Institute of Physics and Technology, Tbilisi, Georgia.

**DOI: **10.4236/ijcns.2014.78030
PDF
HTML
2,096
Downloads
3,226
Views
Citations

Research Department of Radiophysics and Electronic Systems Modeling, Ilia Vekua Sukhumi Institute of Physics and Technology, Tbilisi, Georgia.

The work deals with the development of analytical model of multichannel technical queuing system with unreliable servers and input memory where server failure flows and incoming request flows comply with Poissonian laws, while the flows of failed facilities repairs and flows of incoming requests comply with exponential laws of probability distribution. Random process of system change-over is a Markovian process with continuous time and discrete states. Relations binding basic parameters and output characteristics of the system indicated are obtained as probabilities of system staying in the given moment in one of the possible states. The proposed model is the most generalized compared to some models known in literature which could be considered as special cases of the considered model.

Keywords

Multichannel Queuing Systems, QS with Unreliable Facilities, QS with Repairable Facilities, Servers with Failures, QS with Queues

Share and Cite:

Shamugia, R. (2014) On One Model of Multichannel Queuing System with Unreliable Repairable Servers and Input Memory. *International Journal of Communications, Network and System Sciences*, **7**, 279-285. doi: 10.4236/ijcns.2014.78030.

1. Introduction

The assurance of high dependability is one of the main problems in development of effective systems of production automation and data processing, based on computer technique hardware and software.

At present the dependability of separate components making such systems does not satisfy continuously increasing demands.

Aggravation of dependability problems is also furthered with continuous growth of system complexity (dimensionality), conditioned with the considerable widening of current tasks and steady increase of the responsibilities for the entrusted functions.

Alongside with the growth of demands for dependability the growth for the demands to system capacity conditioned with the necessity of solution of more complicated problems is also observed. One of the means of achieving high capacity of solution of great problems is their parallelization between homogeneous service facilities making the system.

Simultaneous support of high factors of dependability and capacity may be achieved in multichannel systems consisting of facilities homogeneous in dependability and capacity where calls for service orders incoming in random order are supported.

Considering the availability or possibility of introduction into such systems of structural as well as time redundancies, the necessity of development of theoretical methods (models) of prediction of their technical states in time and of optimization of resources input for the maintenance of dependability and capacity level becomes evident.

The availability of such methods enables to estimate factors of the existing systems and to determine the demands presented to designed systems and their subsystems.

The specificity of the processes of above described systems functioning in real time systems enables to consider them as multichannel technical queuing systems with unreliable facilities, serving random flows of random length tasks.

The complexity of the structure of such systems, modular approach to their construction, wide parallelism of facilities operation, stochastic character of fail and repair flows of the device, and also of the moments of tasks arrival for execution and the lengths of their maintenance provide the possibility of using analytical methods of dependability theory (DT) and queuing theory (QT) for modeling of random processes happening in the considered systems.

Mathematical model developed here allows to estimate the effect of such parameters on the chosen factors of the efficiency of functioning of such parameters of the considered technical QS as are the request flow parameter and parameters of facility dependability and service discipline.

The urgency of the development of the model is determined with the necessity to create theoretical bases and practical recommendations for the solution of significantly important scientific-technical problem―problem of assurance of high efficiency of failure proof and high capacity control and data processing means created on the basis of such systems and information processing and also economy of material and labor resources necessary for their design and implementation.

In References [1] -[11] are developed and investigated analytical models of technical QS in various statements differing from each other in structural parameters of the considered systems such as the quantity of service facilities, memory availability, reliable parameters of devices and also parameters of random call flows and their service. Unlike of the mentioned references the proposed work develops the most generalized model which in the form of concrete particular cases will contain some results known in literature.

2. Purpose

Proceeding from the above said the purpose of our work is to develop research model and probability estimation of the factors of efficiency of real time fail-proof and high-capacity systems functioning having equipment and time resources for maintenance of dependability and efficiency level and functioning in conditions of the effect of random factors―refusals, repairs, and random flow of random length tasks and random time of their service.

The proposed model is developed with consideration of the following assumptions:

● Transitions of the system between different states is realized under shared effect of several random processes ―processes of incoming and service of demands, as well as processes of refusals and repairs of service facilities:

● Technical queuing system consists of n identical service facilities;

● Service facilities are subjected to hard failures which obey Poisson law of probability distribution with parameter α;

● Random process of failed facilities repair is described with exponential law of probability distribution with parameter µ;

● Poisson flow of requests incomes into the system for service the intensity of which equals λ;

● Incoming requests are served by exponential law with parameter β;

● Input memory is provided in the system for those requests which enter during time interval when all i operable devices are busy serving the earlier entered requests;

● Queue length is equal to k ‒ l where k is general quantity of requests being in the system in the considered time moment, and l is the quantity of requests served at the given time moment, where l is the quantity of serving facilities operable by that moment.

For description of the process of system functioning in time introduce special probability functions and describing the process of transition of the system into different states, in correspondence with the causes conditioning these transitions―refusals and restoration of serving devices or income and service of requests.

3. Introduction of Special Functions

The introduced functions are determined as follows:

is the probability of event when in time t the system will be in state with i operable and n ‒ i inoperable devices and, at the same time, general quantity of requests being in the system will equal k, from which the quantity being in service of requests will equal l, and the quantity being in queue will be (k ‒ l). The given probability describes the process of changing of system states in case of fixed values of upper indices, i.e. of factors of request incoming and serving―l and (k ‒ l).

is the probability of event when in time t the system will be in the state with i operable and n ‒ i inoperable devices and, at the same time, general quantity of requests being in the system will equal k, from which the quantity being in service of requests will equal l, and the quantity being in queue will be (k ‒ l). The given probability describes the process of changing of system states in case of fixed values of lower indices, i.e. dependability of system indices―failures and repairs of serving devices l and n ‒ l.

in the probability of event when in time t the system will be in the state with i operable and n ‒ i inoperable devices and, at the same time, general quantity of requests being in the system will equal k, from which the quantity being in service of requests will equal l, and the quantity being in queue will be (k ‒ l). The given probability describes the process of changing of system states at continuously changing upper and lower i, l, k, n ‒ i functioning process.

Rate fixing condition has the following form:

In order to determine intensities of system transitions at fixed values of upper indices l and k ‒ l, the following designations are introduced:

is the intensity of system transition being in moment t in

state into one of the possible states, , or caused with refusal of restoration of serving device;

is the intensity of system transition being in moment t in state, into neighbouring state caused with the restoration of service device;

is the intensity of system transition being in moment t in state into neighbouring state caused with the refusal of service device;

In order to determine intensities of system transitions at fixed values of lower indices l and n ‒ i, the following designations are introduced:

is the intensity of system transition being in moment t in state into one of the possible states or caused with income and service of regular request;

is the intensity of system transition being in moment t in state into neighbouring state caused with income of regular request;

is the intensity of system transition being in moment t in state into neighbouring state caused with serving of regular request;

Considering the possible changes of the system in infinitely small time interval (t, t + Δt), with the help of above introduced probabilities, on the basis of probability reasoning, the following system of difference equations can be written describing the process of system functioning in time in assumption of fixed values of upper indices l and k:

(1)

(2)

where

(3)

Summands entering in the right part of Equality (3) should be obtained by solution of the following system of difference equations which describes the process of functioning of the considered system in assumption of fixed values of lower indices i and n ‒ i:

(4)

(5)

Below we define sense of the notion of probabilities in Equations (1), (2) and (3):

is the probability of the event when the system being in time moment t in one of the possible states, , , or in moment will happen in state

{quantity of devices: operable―i, inoperable―(n ‒ i); quantity of requests: general quantity―k, l―in service, (k ‒ l) in queue for service}. In the given case it is supposed that transitions between system states are realized due to request income and their service at fixed values of lower indices i and (n ‒ i) (i.e. parameters of refusals and repairs of service devices);

is the probability of the event when the system being in time moment t in one of the possible states or in moment will happen in state {quantity of devices:

operable―i, inoperable―(n ‒ i); quantity of requests: general quantity―k, l―in service, (k ‒ l) in queue for service}. In the given case it is supposed that transitions between system states are realized due to refusals and repairs of service devices at fixed values of upper indices l and k (i.e. parameters of request income and their service);

is the probability of the event when the system with probability being in moment t in state {quantity of devices: operable―i, inoperable―(n ‒ i); quantity of requests: general quantity―k, l―in service, (k ? l) ―in queue for service} in time with probability will not go over to neither of possible states and will stay in the former state;

is the probability of the event when the system with probability being in moment t in state {quantity of devices: operable―(i ‒ 1), inoperable―[n ‒ (i ‒ 1)]; quantity of requests: general quantity―k, l―in service, (k ? l) in queue for service} in time with probability will not go over to state;

is the probability of the event when the system with probability being in moment t in state {quantity of devices: operable―i + 1, inoperable―[n ‒ (i + 1)]; quantity of requests: general quantity―k, l―in service, (k ? l) in queue for service) in time with probability will go over to state

is the probability of the event when the system with probability being in moment t in state {quantity of devices: operable―i, inoperable―(n ‒ i); quantity of requests: general quantity―k, l―in service, (k ‒ l) in queue for service) in time with probability will not go over to neither of possible states and will stay in the former state;

is the probability of the event when the system with probability being in moment t in state {quantity of devices: operable―i, inoperable―(n ‒ i); quantity of requests: general quantity―k, (l ‒ 1)―in service, in queue for service} in time with probability will go over to state;

is the probability of the event when the system with probability being in moment t in state {quantity of devices: operable―i, inoperable―(n ‒ i); quantity of requests: general quantity―k, l + 1―in service, in queue for service) in time with probability will go over to state.

From Equations (1), (2) and (3) by going to limit at we obtain the following recurrence differential equations:

(6)

(7)

where

(8)

(9)

(10)

Here:,.

Systems of Equations (6), (7), (9) and (10) represent the systems of inhomogeneous differential equations with fixed factors.

In assumption of given starting conditions:

, partial solutions of these equations can be retrieved by method of operational calculus using the following Laplace transformations:

Systems of Equations (6)-(10) in Laplace derivatives will get the following form:

(11)

(12)

where

(13)

(14)

(15)

After simple transformations, Equations (11)-(15) are transformed into inhomogeneous systems of algebraic equations which are solved quite simply with Cramer formulas relative to и:

(16)

(17)

where

(18)

(19)

(20)

With the help of Cramer formula the solution of Equation (20) can be written in the following form:

(21)

where

(22)

is a principal determinant of system (20), while are determinants received by substitution of the right part (1/s) of equation system (20) into column of matrix. Here are the numbers of matrix columns.

The solutions of the system of Equations (17) are written similarly:

(23)

where

(24)

is a principal determinant of system (17), while are determinants received by substitution of the right part of equation system (12) into column of matrix. Here, as above are the numbers of matrix columns.

With the help of found probabilities of states it is easy to determine different factors of dependability and efficiency of the examined system.

4. Conclusions

The results received in the given work represent some generalization of the results already known in literature. They enable to calculate probabilities of possible states of above described system with which other important factors of dependability and efficiency of functioning of such systems can be expressed.

The results of the work can be successfully used in analysis and synthesis of such complex technical systems as are data transfer systems, cellular communication systems, computer and communication networks, flexible manufacturing lines, automated control systems and also other complex technical systems used in civil as well as in military purposes. They can be used for estimation of preset or provision of required levels of dependability, productivity and effectiveness of functioning of complex technical systems on the stage of exploitation, as well as design.

Conflicts of Interest

The authors declare no conflicts of interest.

[1] | Gnedenko, B.V. and Kovalenko, I.N. (2012) Introduction to Queuing Theory. LKT, 400. |

[2] | Saati, T.L. (1965) Elements of Queuing Theory and Its Application. Sovetskoe Radio, 510. |

[3] | Cherkesov, G.N. (1974) Dependability of Technical Systems with Time Redundancy. Sovetskoe Radio, 296. |

[4] | Feller, W. (1971) An Introduction to Probability Theory and Its Applications. Vol. 2, John Willey and Sons, New York, 766. |

[5] | Mikadze, Z.I., Mikadze, I.S. and Khocholava, V.V. (2007) On One Multichannel Mixed Queuing System with Limited Waiting Time. Automatics and Telemechanics, 7, 44-51. |

[6] | Khocholava, V.V. and Mikadze, I.S. (2002) On One Model of Queuing System. Georgian Engineering News, 4, 47-52. |

[7] | Khurodze, R.A., Khocholava, V.V. and Mikadze, I.S. (2003) On One Queuing System with Unreliable Queuing System. Problems of Applied Mechanics, 3, 9-18. |

[8] | Mikadze, I.S. and Khocholava, V.V. (2004) On One Model of Information Transition by Unreliable Communication Channel. Automatics and Telemechanics, 8, 85-90. |

[9] | Mikadze, I.S., Khocholava, V.V. and Khurodze, R.A. (2004) Virtual Waiting Time in Single-Line QS with Unreliable Devices. Automatics and Telemechanics, 12, 119-128. |

[10] | Khurodze, R.A. and Kakubava, R.V. (2005) Some Mathematical Aspects of Dependability Planning of Technical Systems. Bulletin of the Georgian Academy of Sciences, 171, 449-452. |

[11] | Khurodze, R.A., Shamugia, R.R. and Kukava, R.R. (2006) Research of Dependability Characteristics of Technical Systems with Equipment and Time Duplications. Bulletin of the Georgian National Academy of Sciences, 174, 110-113. |

Journals Menu

Contact us

+1 323-425-8868 | |

customer@scirp.org | |

+86 18163351462(WhatsApp) | |

1655362766 | |

Paper Publishing WeChat |

Copyright © 2024 by authors and Scientific Research Publishing Inc.

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.