pith. sign in

arxiv: 1510.01249 · v2 · pith:BMNNTN6Hnew · submitted 2015-10-05 · 🧮 math.PR

Heavy traffic approximation for the stationary distribution of a generalized Jackson network: the BAR approach

classification 🧮 math.PR
keywords approachapproximationheavysteady-statetrafficapproximationsdiffusiondistribution
0
0 comments X
read the original abstract

In the seminal paper of Gamarnik and Zeevi (2006), the authors justify the steady-state diffusion approximation of a generalized Jackson network (GJN) in heavy traffic. Their approach involves the so-called limit interchange argument, which has since become a popular tool employed by many others who study diffusion approximations. In this paper we illustrate a novel approach by using it to justify the steady-state approximation of a GJN in heavy traffic. Our approach involves working directly with the basic adjoint relationship (BAR), an integral equation that characterizes the stationary distribution of a Markov process. As we will show, the BAR approach is a more natural choice than the limit interchange approach for justifying steady-state approximations, and can potentially be applied to the study of other stochastic processing networks such as multiclass queueing networks.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.