Efficient algorithms for tandem queueing system simulation
arXiv:1210.637811 citationsh-index: 17
Originality Synthesis-oriented
AI Analysis
Provides efficient simulation methods for researchers and practitioners modeling queueing networks.
The paper presents serial and parallel algorithms for simulating tandem queueing systems with infinite buffers, achieving low time and memory requirements.
Serial and parallel algorithms for simulation of tandem queueing systems with infinite buffers are presented, and their performance is examined. It is shown that the algorithms which are based on a simple computational procedure involve low time and memory requirements.