Departures from a Queue with Many Busy Servers

@article{Whitt1984DeparturesFA,
  title={Departures from a Queue with Many Busy Servers},
  author={Ward Whitt},
  journal={Math. Oper. Res.},
  year={1984},
  volume={9},
  pages={534-544}
}
  • W. Whitt
  • Published 1 November 1984
  • Mathematics
  • Math. Oper. Res.
To analyze networks of queues, it is important to be able to analyze departure processes from single queues. For the M/M/s and M/G/∞ models, the stationary departure process is simple (Poisson), but in general the stationary departure process is quite complicated. As a basis for approximations, this paper shows that the stationary departure process is approximately Poisson when there are many busy slow servers in a large class of stationary G/GI/s congestion models having s servers, infinite… 
A Poisson limit for the departure process from a queue with many busy servers
STABILIZING PERFORMANCE IN NETWORKS OF QUEUES WITH TIME-VARYING ARRIVAL RATES
  • Yunan Liu, W. Whitt
  • Mathematics
    Probability in the Engineering and Informational Sciences
  • 2014
TLDR
This paper investigates extensions to feed-forward queueing networks of an algorithm to set staffing levels (the number of servers) to stabilize performance % at Quality of Service (QoS) targets in an Mt/GI/st+GI multi-server queue with a time-varying arrival rate to investigate when a departure process can be regarded as approximately an NHPP.
A heavy-traffic analysis of a closed queueing system with a GI/∞ service center
TLDR
A version of the classical heavy-traffic limit theorem for the G/GI/∞ queue is given which reconciles the limits obtained earlier by Iglehart and Borovkov.
The asymptotic variance of departures in critically loaded queues
We consider the asymptotic variance of the departure counting process D(t) of the GI/G/1 queue; D(t) denotes the number of departures up to time t. We focus on the case where the system load ϱ equals
STABILIZING PERFORMANCE IN NETWORKS OF QUEUES WITH TIME-VARYING ARRIVAL RATES
This paper investigates extensions to feed-forward queueing networks of an algorithm to set staffing levels (the number of servers) to stabilize performance in an Mt/GI/st + GI multiserver queue with
A Diffusion Approximation for the G/GI/n/m Queue
TLDR
A diffusion approximation for the queue-length stochastic process in the G/GI/n/m queueing model (having a general arrival process, independent and identically distributed service times with a general distribution,n servers, andm extra waiting spaces) is developed, focusing especially upon the steady-state delay probability.
Stabilizing performance in a single-server queue with time-varying arrival rate
  • W. Whitt
  • Mathematics
    Queueing Syst. Theory Appl.
  • 2015
TLDR
It is shown that the time-varying expected virtual waiting time with the rate-matching service-rate control becomes inversely proportional to the arrival rate in a heavy-traffic limit, and that no control that stabilizes the queue length asymptotically in heavy traffic can also stabilize thevirtual waiting time.
Allocation of Service Time in a Multiserver System
TLDR
Analytical and numerical comparisons show that this multiserver first-come, first-served (FCFS) queueing model provides better system performance than the standard parallel multiservers model in the sense of reducing the mean delay per customer in heavy traffic systems.
A New View of the Heavy-Traffic Limit Theorem for Infinite-Server Queues
This paper presents a new approach for obtaining heavy-traffic limits for infinite-server queues and open networks of infinite-server queues. The key observation is that infinite-server queues having
The Queueing Network Analyzer
  • W. Whitt
  • Computer Science
    The Bell System Technical Journal
  • 1983
TLDR
This paper describes the Queueing Network Analyzer (QNA), a software package developed at Bell Laboratories to calculate approximate congestion measures for a network of queues and uses two parameters to characterize the arrival processes and service times.
...
...

References

SHOWING 1-10 OF 32 REFERENCES
Heavy-Traffic Limits for Queues with Many Exponential Servers
TLDR
Two different kinds of heavy-traffic limit theorems have been proved for s -server queues and the resulting approximation is better than the earlier ones for many-server systems operating at typically encountered loads.
The Queueing Network Analyzer
  • W. Whitt
  • Computer Science
    The Bell System Technical Journal
  • 1983
TLDR
This paper describes the Queueing Network Analyzer (QNA), a software package developed at Bell Laboratories to calculate approximate congestion measures for a network of queues and uses two parameters to characterize the arrival processes and service times.
On the heavy-traffic limit theorem for GI/G/∞ queues
A revealing alternate proof is provided for the Iglehart (1965), (1973)–Borovkov (1967) heavy-traffic limit theorem for GI/G/s queues. This kind of heavy traffic is obtained by considering a sequence
Minimizing Delays in the GI/G/1 Queue
TLDR
For hyperexponential interarrival-time distributions mixtures of two exponential distributions, the service-time distribution minimizing the average delay maximizes the proportion of customers delayed.
Letter to the Editor---The Output of an M/G/∞ Queuing System is Poisson
Burke [Burke, P. J. 1956. The output of a queuing system. Opns. Res.4 699--704.] has shown that, in steady state, a queuing system with a Poisson input and independent negative exponential service
Multiple channel queues in heavy traffic. II: sequences, networks, and batches
This paper is a sequel to [7], in which heavy traffic limit theorems were proved for various stochastic processes arising in a single queueing facility with r arrival channels and s service channels.
Queueing Networks: A Survey of Their Random Processes
TLDR
This paper reviews three topics in queueing network theory: queue length processes, sojourn times, and flow processes, and compares continuous-time processes with embedded processes.
Some distributional approximations in Markovian queueing networks
We consider single-class Markovian queueing networks with state-dependent service rates (the immigration processes of Whittle (1968)). The distance of customer flows from Poisson processes is
Distributional approximations for networks of quasireversible queues
This paper is concerned with establishing Poisson approximations to flows in general queueing networks. Bounds are provided to assess the departure of a given flow from Poisson and these lead to
...
...