Decomposition approximations for time-dependent Markovian queueing networks

Authors:
Ward Whitt
Affiliations:
AT&T Labs, Room A117, Shannon Laboratory, 180 Park Avenue, Florham Park, NJ 07932-0971, USA
Venue:
Operations Research Letters
Year:
1999

Citing 4
Cited 1

Some effects of nonstationarity on multiserver Markovian queueing systems

Operations Research
Variability functions for parametric-decomposition approximations of queueing networks

Management Science
Strong approximations for Markovian service networks

Queueing Systems: Theory and Applications
Time-dependent queueing network approximations as simulation external control variates

Operations Research Letters

Nonstationary analysis of circuit-switched communication networks

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by the development of complex telephone call center networks, we present a general framework for decompositions to approximately solve Markovian queueing networks with time-dependent and state-dependent transition rates. The decompositions are based on assuming either full or partial product form for the time-dependent probability vectors at each time. These decompositions reduce the number of time-dependent ordinary differential equations that must be solved. We show how special structure in the transition rates can be exploited to speed up computation. There is extra theoretical support for the decomposition approximation when the steady-state distribution of the time-homogeneous version of the model has product form.