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

DOI10.1081/STM-200057136MaRDI QIDQ5462811zbMATH OpenFDO

Authors Daniela Traczinski, Wolfram Luther, Gerhard Hasslinger

Publication date 27 July 2005

Published in Stochastic Models (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1081/STM-200057136

zbMATH Keywords

interval arithmeticsemi-Markov processqueuing systemspolynomial factorizationresult verificationdiscrete time single server systemstationary workload analysis

Mathematics Subject Classification ID

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

Recommendations

• Accurate computation of traffic workload distributions
• A polynomial factorization approach for the discrete time \(\text{GI}^X/ \text{G}/1/K\) queue
• The single server semi-Markov queue
• Numerical Software with Result Verification
• Performance evaluation of polling systems by means of the power-series algorithm

Cites work

• scientific article; zbMATH DE number 3880009 (Why is no real title available?)
• scientific article; zbMATH DE number 3522951 (Why is no real title available?)
• scientific article; zbMATH DE number 925118 (Why is no real title available?)
• A polynomial factorization approach to the discrete time GI/G/1/(N) queue size distribution
• Accurate computation of traffic workload distributions
• An analytical solution for the discrete time single server system with semi-Markovian arrivals
• Equilibrium distribution of block-structured Markov chains with repeating rows
• Finding equilibrium probabilities of QBD processes by spectral methods when eigenvalues vanish
• Fitting probabilistic automata via the em algorithm
• Numerical Solutions of the Waiting Time Distribution and Idle Time Distribution of the Arithmetic GI/G/1 Queue
• Quality-of-service analysis for statistical multiplexing with Gaussian distributed and autoregressive input
• Steady-state probabilities of the PH/PH/1 queue
• The PH/PH/1 queue at epochs of queue size change
• The semi-markovian queue: theory and applications
• The use of eigenvalues for finding equilibrium probabilities of certain Markovian two-dimensional queueing problems
• Waiting time, busy periods and output models of a server analyzed via Wiener–Hopf factorization

Cited in

(4)

• Verified Methods in Stochastic Traffic Modelling
• Accurate computation of traffic workload distributions
• Numerical Software with Result Verification
• Multiple eigenvalues in spectral analysis for solving QBD processes

Describes a project that uses

Uses Software

• MPSolve
• C-XSC 2.0

This page was built for publication: Polynomial Factorization for Servers with Semi-Markovian Workload: Performance and Numerical Aspects of a Verified Solution Technique

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5462811)