The conjugate gradient method for queueing networks

  • Moustafa M
  • 1

    Readers

    Mendeley users who have this article in their library.
  • 0

    Citations

    Citations of this article.

Abstract

There are several numerical techniques to compute the steady-state probabilities for the non-Jackson queueing networks. These methods do not always converge when the coefficient matrix is a nonsingular irreducible M-matrix. In this paper we use the conjugate gradient method to compute the steady-state probabilities for the non-Jackson queueing networks. The power of the conjugate gradient is exploited by a given example of such networks. © 1995.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Magdi S. Moustafa

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free