A Fast Discrete Event Simulation Model for Queueing Network Systems
J. L. Vazquez-Avila, Remberto Sandoval-Aréchiga, R. Parra-Michel
Abstract
Open-access reader
J. L. Vazquez-Avila, Remberto Sandoval-Aréchiga, R. Parra-Michel
Abstract
Open-access reader
Based on Lindley's recursive equations for G/G/1 systems, this paper proposes a Fast Discrete Event Simulation (FDES) model for queueing networks. Equations for multiplexer and de-multiplexer elements are presented, which allows to simulate not only tandem but queueing networks with an arbitrary top
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Based on Lindley's recursive equations for G/G/1 systems, this paper proposes a Fast Discrete Event Simulation (FDES) model for queueing networks. Equations for multiplexer and de-multiplexer elements are presented, which allows to simulate not only tandem but queueing networks with an arbitrary top
Key concepts: Layered queueing network, Queueing theory, Multiplexer, Discrete event simulation, Computer science, G-network, Event (particle physics), Computer network