Balanced job bound analysis of queueing networks

  • Authors:
  • J. Zahorjan;K. C. Sevcik;D. L. Eager;B. I. Galler

  • Affiliations:
  • Univ. of Washington;Univ. of Toronto;Univ. of Toronto;Univ. of Toronto

  • Venue:
  • SIGMETRICS '81 Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems
  • Year:
  • 1981

Quantified Score

Hi-index 0.00

Visualization

Abstract

Applications of queueing network models to computer system performance prediction typically involve the computation of their equilibrium solution. When numerous alternative systems are to be examined and the numbers of devices and customers are large, however, the expense of computing the exact solutions may not be warranted by the accuracy required. In such situations, it is desirable to be able to obtain bounds on the system solution with very little computation. Asymptotic bound analysis (ABA) is one technique for obtaining such bounds. In this paper, we introduce another bounding technique, called balanced job bounds (BJB), which is based on the analysis of systems in which all devices are equally utilized. These bounds are tighter than ABA bounds in many cases, but they are based on more restrictive assumptions (namely, those that lead to separable queueing network models).