Efficient algorithms for tandem queueing system simulation

TL;DR

This paper introduces efficient serial and parallel algorithms for simulating tandem queueing systems with infinite buffers, emphasizing low computational time and memory usage.

Contribution

It presents novel algorithms that improve simulation efficiency for tandem queueing systems, focusing on simplicity and resource optimization.

Findings

Algorithms have low time complexity.

Memory requirements are minimized.

Performance is validated through examination.

Abstract

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.