Averaging and Diffusion Approximation in Overloaded Switching Queueing Systems and Networks

1989 ◽  
Vol 46 (6) ◽  
pp. 2232-2239
Author(s):  
E. A. Begovatov ◽  
N. P. Evlampiev

1987 ◽  
Vol 19 (4) ◽  
pp. 974-994 ◽  
Author(s):  
V. Giorno ◽  
A. G. Nobile ◽  
L. M. Ricciardi

Time-non-homogeneous diffusion approximations to single server–single queue–FCFS discipline systems are considered. Under various assumptions on the nature of the time-dependent functions appearing in the infinitesimal moments the transient and the regime behaviour of the approximating diffusions are analysed in some detail. Special attention is then given to the study of a diffusion approximation characterized by a linear drift and by a periodically time-varying infinitesimal variance. Unlike the behaviour of transition functions and moments, the p.d.f. of the busy period is seen to be unaffected by the presence of such periodicity.


2013 ◽  
Vol 50 (03) ◽  
pp. 632-653
Author(s):  
Brian H. Fralix ◽  
Johan S. H. van Leeuwaarden ◽  
Onno J. Boxma

We derive factorization identities for a class of preemptive-resume queueing systems, with batch arrivals and catastrophes that, whenever they occur, eliminate multiple customers present in the system. These processes are quite general, as they can be used to approximate Lévy processes, diffusion processes, and certain types of growth‒collapse processes; thus, all of the processes mentioned above also satisfy similar factorization identities. In the Lévy case, our identities simplify to both the well-known Wiener‒Hopf factorization, and another interesting factorization of reflected Lévy processes starting at an arbitrary initial state. We also show how the ideas can be used to derive transforms for some well-known state-dependent/inhomogeneous birth‒death processes and diffusion processes.


Sign in / Sign up

Export Citation Format

Share Document