scholarly journals Laplace symbols and invariant distributions

2018 ◽  
Vol 137 ◽  
pp. 217-223
Author(s):  
Anita Behme ◽  
Alexander Schnurr
1999 ◽  
Vol 36 (04) ◽  
pp. 1194-1209 ◽  
Author(s):  
Raúl Fierro ◽  
Servet Martínez ◽  
Jaime San Martín

In this paper we study the conditional limiting behaviour for the virtual waiting time process for the queue M/D/1. We describe the family of conditional invariant distributions which are continuous and parametrized by the eigenvalues λ ∊ (0, λ c ], as it happens for diffusions. In this case, there is a periodic dependence of the limiting conditional distributions on the initial point and the minimal conditional invariant distribution is a mixture, according to an exponential law, of the limiting conditional distributions.


2015 ◽  
Vol 47 (01) ◽  
pp. 251-269 ◽  
Author(s):  
A. L. Stolyar

A large-scale service system with multiple customer classes and multiple server pools is considered, with the mean service time depending both on the customer class and server pool. The allowed activities (routeing choices) form a tree (in the graph with vertices being both customer classes and server pools). We study the behavior of the system under a leaf activity priority (LAP) policy, introduced by Stolyar and Yudovina (2012). An asymptotic regime is considered, where the arrival rate of customers and number of servers in each pool tend to ∞ in proportion to a scaling parameter r, while the overall system load remains strictly subcritical. We prove tightness of diffusion-scaled (centered at the equilibrium point and scaled down by r −1/2) invariant distributions. As a consequence, we obtain a limit interchange result: the limit of diffusion-scaled invariant distributions is equal to the invariant distribution of the limiting diffusion process.


2015 ◽  
Vol 47 (1) ◽  
pp. 251-269 ◽  
Author(s):  
A. L. Stolyar

A large-scale service system with multiple customer classes and multiple server pools is considered, with the mean service time depending both on the customer class and server pool. The allowed activities (routeing choices) form a tree (in the graph with vertices being both customer classes and server pools). We study the behavior of the system under a leaf activity priority (LAP) policy, introduced by Stolyar and Yudovina (2012). An asymptotic regime is considered, where the arrival rate of customers and number of servers in each pool tend to ∞ in proportion to a scaling parameter r, while the overall system load remains strictly subcritical. We prove tightness of diffusion-scaled (centered at the equilibrium point and scaled down by r−1/2) invariant distributions. As a consequence, we obtain a limit interchange result: the limit of diffusion-scaled invariant distributions is equal to the invariant distribution of the limiting diffusion process.


Sign in / Sign up

Export Citation Format

Share Document