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

DOI10.1081/STM-200057136zbMath1075.65068MaRDI QIDQ5462811

Daniela Traczinski, Wolfram J. Luther, Gerhard Hasslinger

Publication date: 27 July 2005

Published in: Stochastic Models (Search for Journal in Brave)

zbMATH Keywords

polynomial factorizationinterval arithmeticresult verificationsemi-Markov processqueuing systemsdiscrete time single server systemstationary workload analysis

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Polynomials in real and complex fields: factorization (12D05) Markov renewal processes, semi-Markov processes (60K15) Numerical computation of solutions to single equations (65H05) Algorithms with automatic result verification (65G20)

Related Items

Verified Methods in Stochastic Traffic Modelling ⋮ Multiple eigenvalues in spectral analysis for solving QBD processes

Uses Software

• C-XSC 2.0
• MPSolve

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Steady-state probabilities of the PH/PH/1 queue
• An analytical solution for the discrete time single server system with semi-Markovian arrivals
• The PH/PH/1 queue at epochs of queue size change
• Finding equilibrium probabilities of QBD processes by spectral methods when eigenvalues vanish
• Quality-of-service analysis for statistical multiplexing with Gaussian distributed and autoregressive input
• Accurate computation of traffic workload distributions
• The Use of Eigenvalues for Finding Equilibrium Probabilities of Certain Markovian Two-Dimensional Queueing Problems
• A polynomial factorization approach to the discrete time GI/G/1/(N) queue size distribution
• Equilibrium distribution of block-structured Markov chains with repeating rows
• The semi-markovian queue: theory and applications
• Numerical Solutions of the Waiting Time Distribution and Idle Time Distribution of the Arithmetic GI/G/1 Queue
• Waiting time, busy periods and output models of a server analyzed via Wiener–Hopf factorization
• Fitting probabilistic automata via the em algorithm