Computational algorithms for product form queueing networks

  • Authors:
  • K. Mani Chandy;Charles H. Sauer

  • Affiliations:
  • Univ. of Texas, Austin;IBM Thomas J. Watson Research Center, Yorktown Heights, NY

  • Venue:
  • Communications of the ACM
  • Year:
  • 1980

Quantified Score

Hi-index 48.31

Visualization

Abstract

In the last two decades there has been special interest in queueing networks with a product form solution. These have been widely used as models of computer systems and communication networks. Two new computational algorithms for product form networks are presented. A comprehensive treatment of these algorithms and the two important existing algorithms, convolution and mean value analysis, is given.