Approximate solution to multichain queueing networks with state dependent service rates

  • Agre J
  • Tripathi S
  • 2

    Readers

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

    Citations

    Citations of this article.

Abstract

An approximation scheme for solving non-product form queueing networks with multiple chains and state dependent service rates is described. Estimates of the steady state probability distribution are obtained using less computational requirements than the standard solution techniques. The approximation scheme is based on a property called chain conditional balance, which leads to a decomposition of the global balance equations into smaller sets of equations. A technique for combining conditional distributions is examined and used to combine the solutions of conditional balance equations into the final estimates. Expressions for the storage and computational requirements of the approximation algorithm are given and an example is provided. An error analysis is described in which the approximation is tested on a large number of randomly generated queueing networks. The experimental results indicate that the approximation yields good estimates of the steady state distribution, as well as several important performance measures of these networks. © 1985.

Author-supplied keywords

  • Approximation Algorithms
  • Computational Complexity
  • Conditional Distributions
  • Decomposition
  • Error Analysis
  • Non-product Form Networks
  • Performance Measures
  • Queueing Networks
  • State dependence
  • Steady-state Analysis

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

  • Jonathan R. Agre

  • Satish K. Tripathi

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free