Interpolation Approximations of Sojourn Time Distributions

Philip J. Fleming and Burton Simon
Additional contact information
Philip J. Fleming: AT&T Bell Laboratories, Naperville, Illinois
Burton Simon: University of Colorado at Denver, Denver, Colorado

Operations Research, 1991, vol. 39, issue 2, 251-260

Abstract: We present a method for approximating sojourn time distributions in open queueing systems based on light and heavy traffic limits. The method is consistent with and generalizes the interpolation approximations for moments previously presented by M. I. Reiman and B. Simon. The method is applicable to the class of systems for which both light and heavy traffic limits can be computed, which currently includes Markovian networks of priority queues with a unique bottleneck node. We illustrate the method of generating closed-form analytic approximations for the sojourn time distribution of the M/M/1 queue with Bernoulli feedback, the M/M/1 processor sharing queue, a priority queue with feedback and the M/E k /1 queue. Empirical evidence suggests that the method works well on a large and identifiable class of priority queueing models.

Keywords: queues; approximations: interpolation approximations; queues; limit theorems: light traffic and heavy traffic (search for similar items in EconPapers)
Date: 1991
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.39.2.251 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:39:y:1991:i:2:p:251-260

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().