Weak instability in stochastic and fluid queueing networks

  • Authors:
  • David Gamarnik;John Hasenbein

  • Affiliations:
  • IBM Watson Research Center, Yorktown Heights, NY;University of Texas, Austin, TX

  • Venue:
  • ACM SIGMETRICS Performance Evaluation Review - Special issue on the fifth workshop on MAthematical performance Modeling and Analysis (MAMA 2003)
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

The fluid model has proven to be one of the most effective tools for the analysis of stochastic queueing networks, specifically for the analysis of stability. It is known that stability of a fluid model implies positive (Harris) recurrence (stability) of a corresponding stochastic queueing network, and weak stability implies rate stability of a corresponding stochastic network. These results have been established both for cases of specific scheduling policies and for the class of all work conserving policies.However, only partial converse results have been established and in certain cases converse statements do not hold. In this paper we close one of the existing gaps. For the case of networks with two stations we prove that if the fluid model is not weakly stable under the class of all work conserving policies, then any corresponding queueing network is not rate stable under the class of all work conserving policies. We establish the result by building a particular work conserving scheduling policy which makes any corresponding stochastic process transient. An important corollary of our result is that the condition of the form ρ*