Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-10T14:19:38.936Z Has data issue: false hasContentIssue false
  • English
  • Français

Approximations for delays using asymptotic estimates

Published online by Cambridge University Press:  01 July 2016

David Y. Burman  and
Donald R. Smith
David Y. Burman
Affiliation:
Bell Laboratories, Holmdel
Donald R. Smith
Affiliation:
Bell Laboratories, Holmdel
Get access Rights & Permissions [Opens in a new window]

Extract

Consider a general single-server queue where the customers arrive according to a Poisson process whose rate is modulated according to an independent Markov process. The authors have previously reported on limits for the average delay in light and heavy traffic. In this paper we review these results, extend them to multiserver queues, and describe some approximations obtained from them for general delays.

Type
Applied Probability in Biology and Engineering. An ORSA/TIMS Special Interest Meeting
Information
Advances in Applied Probability , Volume 16 , Issue 1 , March 1984 , pp. 6
Copyright
Copyright © Applied Probability Trust 1984 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)