Approximate Throughput Analysis of Cyclic Queueing Networks with Finite Buffers

  • Authors:
  • Raif O. Onvural;H. G. Perros

  • Affiliations:
  • North Carolina State Univ., Raleigh;North Carolina State Univ., Raleigh

  • Venue:
  • IEEE Transactions on Software Engineering
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

Abstract

An approximation method for obtaining the throughput of cyclic queueing networks with blocking as a function of the number of customers in it is presented. The approximation method was developed for two different blocking mechanisms. It was also extended to the case of the central server model with blocking. Validation tests show that the algorithm is fairly accurate.