Computational algorithm for an analysis of a single-line queueing system with arrived alternating Poisson flow

Alexander Andronov, Iakov Dalinger, Nadezda Spiridovska
The M/G/1 queue is considered for a case when an alternating Poisson flow takes place on the input. The analysis is based on an embedded Markov chain, built on the instants of service ending. Various algorithms are elaborated for the calculation of the distribution of the system’ states and various numerical indices.