An Asymptotic Analysis of a Queueing System with Markov-Modulated Arrivals

1986 ◽  
Vol 34 (1) ◽  
pp. 105-119 ◽  
Author(s):  
David Y. Burman ◽  
Donald R. Smith
1995 ◽  
Vol 75 (4) ◽  
pp. 1852-1856
Author(s):  
L. I. Lukashuk ◽  
Yu. A. Semenchenko ◽  
Ya. Strik

1996 ◽  
Vol 10 (3) ◽  
pp. 429-441 ◽  
Author(s):  
Woo-Yong Choi ◽  
Chi-Hyuck Jun

We propose a new approach to the analysis of a discrete-time queueing system whose input is generated by a Markov-modulated process and whose service rate is constant. Renewal cycles are identified and the system state on each renewal cycle is modeled as a one-dimensional Markov chain.


1984 ◽  
Vol 21 (4) ◽  
pp. 870-886 ◽  
Author(s):  
J. P. C. Blanc

A technique is developed for the analysis of the asymptotic behaviour in the long run of queueing systems with two waiting lines. The generating function of the time-dependent joint queue-length distribution is obtained with the aid of the theory of boundary value problems of the Riemann–Hilbert type and by introducing a conformal mapping of the unit disk onto a given domain. In the asymptotic analysis an extensive use is made of theorems on the boundary behaviour of such conformal mappings.


1984 ◽  
Vol 21 (04) ◽  
pp. 870-886
Author(s):  
J. P. C. Blanc

A technique is developed for the analysis of the asymptotic behaviour in the long run of queueing systems with two waiting lines. The generating function of the time-dependent joint queue-length distribution is obtained with the aid of the theory of boundary value problems of the Riemann–Hilbert type and by introducing a conformal mapping of the unit disk onto a given domain. In the asymptotic analysis an extensive use is made of theorems on the boundary behaviour of such conformal mappings.


Author(s):  
Elena Yu. Danilyuk ◽  
Svetlana P. Moiseeva ◽  
Janos Sztrik

The retrial queueing system of M=M=1 type with Poisson flow of arrivals, impatient cus- tomers, collisions and unreliable service device is considered in the paper. The novelty of our contribution is the inclusion of breakdowns and repairs of the service into our previous study to make the problem more realistic and hence more complicated. Retrial time of customers in the orbit, service time, impa- tience time of customers in the orbit, server lifetime (depending on whether it is idle or busy) and server recovery time are supposed to be exponentially distributed. An asymptotic analysis method is used to find the stationary distribution of the number of customers in the orbit. The heavy load of the system and long time patience of customers in the orbit are proposed as asymptotic conditions. Theorem about the Gaussian form of the asymptotic probability distribution of the number of customers in the orbit is formulated and proved. Numerical examples are given to show the accuracy and the area of feasibility of the proposed method


Sign in / Sign up

Export Citation Format

Share Document