Name
Abstract | ||
|---|---|---|
Based on Lindleyu0027s 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 topology. Time savings obtained with FDES could speed up the analyses of large-scale queueing network systems. Experimental results show that FDES modeling can be two orders of magnitude faster than their counterparts based on the event-scheduling for practical cases. |
Year | Venue | Field |
|---|---|---|
2015 | SimuTools | Computer science,Real-time computing,Multiplexer,Queueing theory,Layered queueing network,Order of magnitude,Recursion,Speedup,Discrete event simulation |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
3 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. L. Vázquez-Avila | 1 | 6 | 1.89 |
| Remberto Sandoval-Arechiga | 2 | 6 | 2.23 |
| Ramon Parra-Michel | 3 | 84 | 12.86 |