The waiting-time distribution and its moments of the PH/PH/1 queue

  • Authors:
  • Appie Van De Liefvoort

  • Affiliations:
  • Computer Science Telecommunications Program, University of Missouri-Kansas City, 5100 Rockhill Road, Kansas City, MO 64110-2499, USA

  • Venue:
  • Operations Research Letters
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

Performance characteristics for the stable PH/PH/1 queue are usually given in terms of the geometric generator matrix R. The waiting-time distribution, however, can be computed with a formalism that does not make use of this matrix. Instead, a coupling matrix, available at no computational cost, forms the basis for simple expressions from which the waiting-time (and idle-time) distributions and their moments can be efficiently computed.