Queueing network simulation analysis: developing efficient simulation methodology for complex queueing networks

Authors:
Ying-Chao Hung;George Michailidis;Derek R. Bingham
Affiliations:
National Central University, Chung-Li, Taiwan;The University of Michigan, Ann Arbor, MI;The University of Michigan, Ann Arbor, MI
Venue:
Proceedings of the 35th conference on Winter simulation: driving innovation
Year:
2003

Citing 3
Cited 2

Empirical model-building and response surface

Empirical model-building and response surface
OPTIMAL CONTROL OF PARALLEL QUEUES WITH BATCH SERVICE

Probability in the Engineering and Informational Sciences
ON PARALLEL QUEUING WITH RANDOM SERVER CONNECTIVITY AND ROUTING CONSTRAINTS

Probability in the Engineering and Informational Sciences

Estimating expected completion times with probabilistic job routing

Proceedings of the 38th conference on Winter simulation
A queuing network model for the management of berth crane operations

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Simulation can provide insight to the behavior of a complex queueing system by identifying the response surface of several performance measures such as delays and backlogs. However, simulations of large systems are expensive both in terms of CPU time and use of available resources (e.g. processors). Thus, it is of paramount importance to carefully select the inputs of simulation in order to adequately capture the underlying response surface of interest and at the same time minimize the required number of simulation runs. In this study, we present a methodological framework for designing efficient simulations for complex networks. Our approach works in sequential and combines the methods of CART (Classification And Regression Trees) and the design of experiments. A generalized switch model is used to illustrate the proposed methodology and some useful applications are described.