Queueing network simulation analysis: queueing-network stability: simulation-based checking

Authors:
Jamie R. Wieland;Raghu Pasupathy;Bruce W. Schmeiser
Affiliations:
Purdue University, West Lafayette, IN;Purdue University, West Lafayette, IN;Purdue University, West Lafayette, IN
Venue:
Proceedings of the 35th conference on Winter simulation: driving innovation
Year:
2003

Citing 1
Cited 3

Simulation optimization using simultaneous replications and event time dilation

Proceedings of the 29th conference on Winter simulation

Simulation output analysis: a tutorial based on one research thread

WSC '04 Proceedings of the 36th conference on Winter simulation
Dynamic scheduling for switched processing systems with substantial service-mode switching times

Queueing Systems: Theory and Applications
Evaluating healthcare systems with insufficient capacity to meet demand

Proceedings of the Winter Simulation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Queueing networks are either stable or unstable, with stable networks having finite performance measures and unstable networks having asymptotically many customers as time goes to infinity. Stochastic simulation methods for estimating steady-state performance measures often assume that the network is stable. Here, we discuss the problem of checking whether a given network is stable when the stability-checking algorithm is allowed only to view arrivals and departures from the network.