Polynomial Factorization for Servers with Semi-Markovian Workload: Performance and Numerical Aspects of a Verified Solution Technique

Abstract

We investigate polynomial factorization as a classical analysis method for servers with semi-Markov arrival and service processes. The modeling approach is directly applicable to queueing systems and servers in production lines and telecommunication networks, where the flexibility in adaptation to autocorrelated processes is essential. Although the method offers a compact form of the solution with favourable computation time complexity enabling to consider large state spaces and system equations of high degree, numerical stability is not guaranteed for this approach. Therefore we apply interval arithmetic in order to get verified results for the workload distributions, or otherwise to indicate that the precision of the computation has to be improved. The paper gives an overview of numerical and performance aspects of factorization in comparison to alternative methods.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 11 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.