Joint Stationary Distribution Of Queues In Homogenous M|M|3 Queue With Resequencing

Author(s):  
Ilaria Caraccio ◽  
Alexander V. Pechinkin ◽  
Rostislav V. Razumchik
1994 ◽  
Vol 31 (03) ◽  
pp. 841-846
Author(s):  
Gennadi Falin

Choi and Park [2] derived an expression for the joint stationary distribution of the number of customers of k types who arrive in batches at an infinite-server system of M/M/∞ type. We propose another method of solving this problem and extend the result to the case of general service times (not necessarily independent). We also get a transient solution. Our main result states that the k- dimensional vector of the number of customers of k types in the system is a certain linear function of a (2 k – 1)-dimensional vector whose coordinates are independent Poisson random variables.


2002 ◽  
Vol 39 (2) ◽  
pp. 359-369 ◽  
Author(s):  
N. Barbot ◽  
B. Sericola

We consider an infinite-capacity buffer receiving fluid at a rate depending on the state of an M/M/1 queue. We obtain a new analytic expression for the joint stationary distribution of the buffer level and the state of the M/M/1 queue. This expression is obtained by the use of generating functions which are explicitly inverted. The case of a finite capacity fluid queue is also considered.


2014 ◽  
Vol 513-517 ◽  
pp. 3377-3380
Author(s):  
Fu Wei Wang ◽  
Bing Wei Mao

The fluid model driven by an M/M/1 queue with set-up and close-down period is studied. The Laplace transform of the joint stationary distribution of the fluid model is of matrix geometric structure. With matrix geometric solution method, the Laplace-Stieltjes transformation of the stationary distribution of the buffer content is obtained, as well as the mean buffer content. Finally, with some numerical examples, the effect of the parameters on mean buffer content is presented.


2016 ◽  
Vol 2016 ◽  
pp. 1-23 ◽  
Author(s):  
Kazuki Kajiwara ◽  
Tuan Phung-Duc

This paper considers a retrial queueing model where a group of guard channels is reserved for priority and retrial customers. Priority and normal customers arrive at the system according to two distinct Poisson processes. Priority customers are accepted if there is an idle channel upon arrival while normal customers are accepted if and only if the number of idle channels is larger than the number of guard channels. Blocked customers (priority or normal) join a virtual orbit and repeat their attempts in a later time. Customers from the orbit (retrial customers) are accepted if there is an idle channel available upon arrival. We formulate the queueing system using a level dependent quasi-birth-and-death (QBD) process. We obtain a Taylor series expansion for the nonzero elements of the rate matrices of the level dependent QBD process. Using the expansion results, we obtain an asymptotic upper bound for the joint stationary distribution of the number of busy channels and that of customers in the orbit. Furthermore, we develop an efficient numerical algorithm to calculate the joint stationary distribution.


2002 ◽  
Vol 39 (02) ◽  
pp. 359-369 ◽  
Author(s):  
N. Barbot ◽  
B. Sericola

We consider an infinite-capacity buffer receiving fluid at a rate depending on the state of an M/M/1 queue. We obtain a new analytic expression for the joint stationary distribution of the buffer level and the state of the M/M/1 queue. This expression is obtained by the use of generating functions which are explicitly inverted. The case of a finite capacity fluid queue is also considered.


2013 ◽  
Vol 3 (1) ◽  
pp. 1-17 ◽  
Author(s):  
Wen Li ◽  
Lin Jiang ◽  
Wai-Ki Ching ◽  
Lu-Bin Cui

AbstractMultivariate Markov chain models have previously been proposed in for studying dependent multiple categorical data sequences. For a given multivariate Markov chain model, an important problem is to study its joint stationary distribution. In this paper, we use two techniques to present some perturbation bounds for the joint stationary distribution vector of a multivariate Markov chain with s categorical sequences. Numerical examples demonstrate the stability of the model and the effectiveness of our perturbation bounds.


1994 ◽  
Vol 31 (3) ◽  
pp. 841-846 ◽  
Author(s):  
Gennadi Falin

Choi and Park [2] derived an expression for the joint stationary distribution of the number of customers of k types who arrive in batches at an infinite-server system of M/M/∞ type. We propose another method of solving this problem and extend the result to the case of general service times (not necessarily independent). We also get a transient solution. Our main result states that the k- dimensional vector of the number of customers of k types in the system is a certain linear function of a (2k – 1)-dimensional vector whose coordinates are independent Poisson random variables.


Author(s):  
Hongshuai Dai ◽  
Donald A. Dawson ◽  
Yiqiang Q. Zhao

In this paper, we consider a three-dimensional Brownian-driven tandem queue with intermediate inputs, which corresponds to a three-dimensional semimartingale reflecting Brownian motion whose reflection matrix is triangular. For this three-node tandem queue, no closed form formula is known, not only for its stationary distribution but also for the corresponding transform. We are interested in exact tail asymptotics for stationary distributions. By generalizing the kernel method, and using extreme value theory and copula, we obtain exact tail asymptotics for the marginal stationary distribution of the buffer content in the third buffer and for the joint stationary distribution.


Sign in / Sign up

Export Citation Format

Share Document