Wyniki wyszukiwania - BazTech

1

Introducing probabilistic models for redundant system reliability

Babagana M., Gimba B., Yusuf I.

Operations Research and Decisions

|

2016

|

Vol. 26, No. 1

5--18

EN

Probabilistic models have been developed to evaluate the relationship between reliability measures and the performance of a repairable network with built in redundancy. Networks with built in redun-dancy have been considered and explicit expressions have been derived for three characteristics related to such systems including steady-state availability, period of repair, and a profit function. Various graphs have been plotted to discover the impact of availability and mean time to system failure on net profit, as well as the impact of the failure and service rate on the steady-state availability, net profit and mean time to system failure. The system was analysed using first order linear differential equations.

2

A discrete-time queueing system with changes in the vacation times

Atencia I.

International Journal of Applied Mathematics and Computer Science

|

2016

|

Vol. 26, no. 2

379--390

EN

This paper considers a discrete-time queueing system in which an arriving customer can decide to follow a last come first served (LCFS) service discipline or to become a negative customer that eliminates the one at service, if any. After service completion, the server can opt for a vacation time or it can remain on duty. Changes in the vacation times as well as their associated distribution are thoroughly studied. An extensive analysis of the system is carried out and, using a probability generating function approach, steady-state performance measures such as the first moments of the busy period of the queue content and of customers delay are obtained. Finally, some numerical examples to show the influence of the parameters on several performance characteristics are given.

3

The system M2θ/G/1/m with threshold control of the arrival rate and service time

Zhernovyi Y., Kopytko B.

Journal of Applied Mathematics and Computational Mechanics

|

2014

|

Vol. 13, nr 2

149--163

EN

We consider a M2θ/G/1/m queueing system with arrival of customer batches, which uses a threshold control mechanism of the service time and arrival rate. The system receives two independent flows of customers, one of which is blocked in an overload mode (under the condition that the number of customers in the system exceeds a given threshold value h). Full blocking of the input flow is carried out from the moment when the queue length reaches the number m until the beginning of the service of the first customer, for which the number of customers in the system does not exceed h. From the beginning of the service of the first customer during the excess of number of customers in the system of h until the completion of full blocking the time of service of customer is distributed under the law of F(x) (an increased service rate is used). Rest of the time the system applies the normal service rate with the distribution function F(x) of service time. Laplace transforms for the distributions of the number of customers in the system during the busy period and for the distribution function of the busy period are found. The average duration of the busy period is obtained. Formulas for the stationary distribution of the number of customers in the system, for the probability of service and for the stationary characteristics of the system are established. The obtained results are verified with the help of a simulation model constructed with the assistance of GPSS World tools.

4

On characteristics of the Mθ/G/1/m and Mθ/G/1 queues with queue-size based packet dropping

Zhernovyi Y., Kopytko B., Zhernovyi K.

Journal of Applied Mathematics and Computational Mechanics

|

2014

|

Vol. 13, nr 4

163--175

EN

We study the Mθ/G/1/m and Mθ/G/1 queuing systems with the function of the random dropping of customers used to ensure the required characteristics of the system. Each arriving packet of customers can be rejected with a probability defined depending on the queue length at the service beginning of each customer. The Laplace transform for the distribution of the number of customers in the system on the busy period is found, the mean duration of the busy period is determined, and formulas for the stationary distribution of the number of customers in the system are derived via the approach based on the idea of Korolyuk’s potential method. The obtained results are verified with the help of a simulation model constructed with the assistance of GPSS World tools.

5

A finite-buffer queue with a single vacation policy: An analytical study with evolutionary positioning

Woźniak M., Kempa W. M., Gabryel M., Nowicki R. K.

International Journal of Applied Mathematics and Computer Science

|

2014

|

Vol. 24, no. 4

887--900

EN

In this paper, application of an evolutionary strategy to positioning a GI/M/1/N-type finite-buffer queueing system with exhaustive service and a single vacation policy is presented. The examined object is modeled by a conditional joint transform of the first busy period, the first idle time and the number of packets completely served during the first busy period. A mathematical model is defined recursively by means of input distributions. In the paper, an analytical study and numerical experiments are presented. A cost optimization problem is solved using an evolutionary strategy for a class of queueing systems described by exponential and Erlang distributions.

6

A discrete-time system with service control and repairs

Atencia I.

International Journal of Applied Mathematics and Computer Science

|

2014

|

Vol. 24, no. 3

471--484

EN

This paper discusses a discrete-time queueing system with starting failures in which an arriving customer follows three different strategies. Two of them correspond to the LCFS (Last Come First Served) discipline, in which displacements or expulsions of customers occur. The third strategy acts as a signal, that is, it becomes a negative customer. Also examined is the possibility of failures at each service commencement epoch. We carry out a thorough study of the model, deriving analytical results for the stationary distribution. We obtain the generating functions of the number of customers in the queue and in the system. The generating functions of the busy period as well as the sojourn times of a customer at the server, in the queue and in the system, are also provided. We present the main performance measures of the model. The versatility of this model allows us to mention several special cases of interest. Finally, we prove the convergence to the continuous-time counterpart and give some numerical results that show the behavior of some performance measures with respect to the most significant parameters of the system.