Recursive Computation of Steady-State Probabilities of Nonproduct Form Queueing Networks Associated with Computer Network Models

Document Type

Article

Publication Date

1-1-1990

Abstract

This paper deals with the exact computation of the equilibrium state probabilities of a class of nonproduct form queueing networks which is of interest for communication systems. It is shown that specific structure in the state transition lattice leads to a sequential method of solution. The method is sequential either in terms of individual states or in terms of subsets of states. In the former case, algebraic recursions for the probabilities of state can be developed. In both cases, substantia) computational savings are possible. © 1990 IEEE

Identifier

0025238255 (Scopus)

Publication Title

IEEE Transactions on Communications

External Full Text Location

https://doi.org/10.1109/26.46537

ISSN

00906778

First Page

115

Last Page

117

Issue

1

Volume

38

Grant

NCR-8703689

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS