The Cycle Time Distribution of Exponential Cyclic Queues

  • Authors:
  • We-Min Chow

  • Affiliations:
  • IBM Thomas J Watson Research Center, Yorktown Heights, NY

  • Venue:
  • Journal of the ACM (JACM)
  • Year:
  • 1980

Quantified Score

Hi-index 0.02

Visualization

Abstract

The cycle time distribution of a cyclic queue with two exponential servers is derived. Results show that when the population size N is large enough, the cycle time distribution is not sensitive to the ratio of service rates and asymptotically approaches an Erlangian distribution. If service rates are identical, however, the cycle time has an exact Erlangian distribution for any N.