An analytical solution for the discrete time single server system with semi-Markovian arrivals
From MaRDI portal
Publication:1339091
DOI10.1007/BF01158775zbMath0820.90047OpenAlexW2005209186MaRDI QIDQ1339091
Erik S. Rieger, Gerhard Hasslinger
Publication date: 26 September 1995
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01158775
analytical solutionpolynomial factorizationdiscrete timeidle timesingle server system with semi- Markovian arrival processesstationary distribution of the number of customers
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The single server semi-Markov queue
- Exact and approximate numerical solutions to steady-state single-server queues: \(M/G/1\) -- a unified approach
- Exact and approximate numerical solutions of steady-state distributions arising in the queue \(GI/G/1\)
- A polynomial factorization approach to the discrete time GI/G/1/(N) queue size distribution
- The semi-markovian queue: theory and applications
- A single-server queue with server vacations and a class of non-renewal arrival processes
- Numerical Solutions of the Waiting Time Distribution and Idle Time Distribution of the Arithmetic GI/G/1 Queue
- A storage process by semi-Markov input
- Discrete-Time Single Server Queues with Correlated Inputs
- Approximate Analysis of General Queuing Networks by Decomposition
- Alternative Numerical Solutions of Stationary Queueing-Time Distributions in Discrete-Time Queues: GI/G/1
- Markov-modulated single-server queueing systems
- Theory and numerical solution of a discrete queueing problem
- Queues with semi-Markovian arrivals
- On a fundamental identity in the theory of semi-Markov processes
