Queueing Systems

, Volume 28, Issue 4, pp 377–401

Markov network processes with product form stationary distributions


  • X. Chao
    • Department of Industrial and Manufacturing EngineeringNew Jersey Institute of Technology
  • M. Miyazawa
    • Department of Information SciencesScience University of Tokyo
  • R.F. Serfozo
    • School of Industrial and System EngineeringGeorgia Institute of Technology
  • H. Takada
    • Department of Information SciencesScience University of Tokyo

DOI: 10.1023/A:1019115626557

Cite this article as:
Chao, X., Miyazawa, M., Serfozo, R. et al. Queueing Systems (1998) 28: 377. doi:10.1023/A:1019115626557


This study concerns the equilibrium behavior of a general class of Markov network processes that includes a variety of queueing networks and networks with interacting components or populations. The focus is on determining when these processes have product form stationary distributions. The approach is to relate the marginal distributions of the process to the stationary distributions of “node transition functions” that represent the nodes in isolation operating under certain fictitious environments. The main result gives necessary and sufficient conditions on the node transition functions for the network process to have a product form stationary distribution. This result yields a procedure for checking for a product form distribution and obtaining such a distribution when it exits. An important subclass of networks are those in which the node transition rates have Poisson arrival components. In this setting, we show that the network process has a product form distribution and is “biased locally balanced” if and only if the network is “quasi-reversible” and certain traffic equations are satisfied. Another subclass of networks are those with reversible routing. We weaken the known sufficient condition for such networks to be product form. We also discuss modeling issues related to queueing networks including time reversals and reversals of the roles of arrivals and departures. The study ends by describing how the results extend to networks with multi-class transitions.

Markov network processproduct formstationary distributionqueueing networknegative customermigration processquasi-reversibilitybiased local balancereversible routingmulti-class transitions
Download to read the full article text

Copyright information

© Kluwer Academic Publishers 1998