A numerical method to determine the waiting time and the idle time distributions of a GI/G/1 queue when inter-arrival times and/or service times have geometric tails
From MaRDI portal
Publication:5884366
DOI10.1080/03155986.2018.1533775MaRDI QIDQ5884366
Javad Tavakoli, Winfried K. Grassmann
Publication date: 20 March 2023
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03155986.2018.1533775
90B22: Queues and service in operations research
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient Computations for the Discrete GI/G/1 System
- A polynomial factorization approach to the discrete time GI/G/1/(N) queue size distribution
- The Factorization of Queueing Equations and Their Interpretation
- Numerical Solutions of the Waiting Time Distribution and Idle Time Distribution of the Arithmetic GI/G/1 Queue
- Alternative Numerical Solutions of Stationary Queueing-Time Distributions in Discrete-Time Queues: GI/G/1
- On steady-state queue size distributions of the discrete-time GI/G/1 queue
- Analysis of Open Discrete Time Queueing Networks: A Refined Decomposition Approach
- Queueing Theory for Telecommunications