Wyniki wyszukiwania - BazTech

1

Recurrence relations for two-channel closed queueing systems with Erlangian service times

Kopytko B., Zhernovyi K.

Journal of Applied Mathematics and Computational Mechanics

|

2018

|

Vol. 17, nr 1

37--48

EN

This paper proposes a method for determining the steady-state characteristics of two-channel closed queueing systems with an exponential distribution of the time generation of service requests and the Erlang distributions of the service times. Recurrence relations for computing the steady-state distribution of the number of customers in the system are deduced. The obtained algorithms are tested on examples using simulation models in the GPSS World environment.

2

Steady-state characteristics of three-channel queueing systems with Erlangian service times

Kopytko B., Zhernovyi K.

Journal of Applied Mathematics and Computational Mechanics

|

2016

|

Vol. 15, nr 3

75--87

EN

We propose a method of study the M/E2/3/∞ queueing systems: standard system and systems with the threshold and hysteretic strategies of the random dropping of customers in order to control the input flow. Recurrence relations to compute the stationary distribution of the number of customers and the steady-state characteristics are obtained. The developed algorithms are tested on examples using simulation models constructed with the assistance of the GPSS World tools.

3

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.

4

The busy period for the Mθ /G/1/m system with service time dependent of the queue length

Zhernovyi Y., Kopytko B., Zhernovyi K.

Journal of Applied Mathematics and Computational Mechanics

|

2013

|

Vol. 12, nr 4

127--133

EN

We consider the Mθ/G/1/m system wherein the service time depends on the queuelength and it is determined at the beginning of customer service. Using an approach basedon the potential method proposed by V. Korolyuk, the Laplace transforms for the distribution f the number of customers in the system on the busy period and for the distribution function of the busy period are found.

5

Stationary characteristics of M θ /M/1 queue with switching of service modes

Kopytko B., Zhernovyi K.

Prace Naukowe Instytutu Matematyki i Informatyki Politechniki Częstochowskiej

|

2011

|

Vol. 10, nr 2

117-128

EN

For an M θ /M/1 queue with a threshold switching of service modes at the start of the service of the next customer an algorithm for determining the stationary distribution of the number of customers and stationary characteristics (average queue length, average waiting time, variance of queue length) is proposed. In the case the minimum number of incoming customers in the group is comparable to threshold value h, the stationary characteristics are found in an explicit form. The results are verified by simulation models constructed with the assistance of GPSS World.