Generalized Jackson Networks

In this chapter we consider a queueing network that generalizes the Jackson network studied in Chapter 2, by allowing renewal arrival processes that need not be Poisson and i.i.d. service times that need not follow exponential distributions. (However, we do not allow the service times of the network to be state-dependent; in this regard, the network is more restrictive than the Jackson network. Nevertheless, this network has been conventionally referred to as the generalized Jackson network.) Unlike the Jackson network, the stationary distribution of a generalized Jackson network usually does not have an explicit analytical form. Therefore, approximations and limit theorems that support such approximations are usually sought for the generalized Jackson networks.

[1]  J. Dai.  Steady-state analysis of reflected Brownian motions: characterization, numerical methods and queueing applications , 1991 .

[2]  Hong Chen,et al.  Stochastic discrete flow networks : diffusion approximations and bottlenecks , 1991 .

[3]  J. Harrison,et al.  Steady-State Analysis of RBM in a Rectangle: Numerical Methods and A Queueing Application , 1991 .

[4]  Lajos Horváth,et al.  Strong Approximations of Open Queueing Networks , 1992, Math. Oper. Res..

[5]  A. Berman.  CHAPTER 2 – NONNEGATIVE MATRICES , 1979 .

[6]  Hong Chen,et al.  Hierarchical Modeling of Stochastic Networks, Part II: Strong Approximations , 1994 .

[7]  Hong Chen,et al.  Diffusion approximations for open queueing networks with service interruptions , 1993, Queueing Syst. Theory Appl..

[8]  Martin I. Reiman,et al.  Open Queueing Networks in Heavy Traffic , 1984, Math. Oper. Res..

[9]  A. Bernard,et al.  Regulations dÉterminates et stochastiques dans le premier “orthant” de RN , 1991 .

[10]  Ruth J. Williams,et al.  Brownian Models of Open Queueing Networks with Homogeneous Customer Populations , 1987 .

[11]  A. Mandelbaum,et al.  Regenerative closed queueing networks , 1992 .

[12]  J. Harrison,et al.  Reflected Brownian Motion on an Orthant , 1981 .

[13]  Hong Chen,et al.  Discrete Flow Networks: Bottleneck Analysis and Fluid Approximations , 1991, Math. Oper. Res..

[14]  Hanqin Zhang.  Strong Approximations of Irreducible Closed Queueing Networks , 1997, Advances in Applied Probability.

[15]  J. Harrison,et al.  Reflected Brownian Motion in an Orthant: Numerical Methods for Steady-State Analysis , 1992 .