Survey of closed queueing networks with blocking
ACM Computing Surveys (CSUR)
Line reversibility of tandem queues with general blocking
Management Science
A fast simulation approach for tandem queueing systems
WSC' 90 Proceedings of the 22nd conference on Winter simulation
Delay moments for FIFO GI/GI/s queues
Queueing Systems: Theory and Applications
Parallel simulation by multi-instruction, longest-path algorithms
Queueing Systems: Theory and Applications
Mathematical programming models of closed tandem queueing networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Simulation modeling for analysis
ACM Transactions on Modeling and Computer Simulation (TOMACS)
| Hi-index | 0.00 |
Lindley's recursion is an explicit recursive equation that describes the recursive relationship between consecutive waiting times in a single-stage single-server queue. In this paper, we develop explicit recursive representations for multiserver tandem queues with blocking. We demonstrate the application of these recursive representations with simulations of large-scale tandem queueing networks. We compare the computational efficiency of these representations with two other popular discrete-event simulation approaches, namely, event scheduling and process interaction. Experimental results show that these representations are seven (or more) times faster than their counterparts based on the event-scheduling and process-interaction approaches.