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

DOI10.1080/03155986.2018.1533775OpenAlexW2914679402MaRDI QIDQ5884366FDOQ5884366

Authors: Winfried K. Grassmann, Javad Tavakoli 

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

Recommendations

• 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
• The discrete-time single-server queue
• Analytically simple and computationally efficient solution to $\mathrm{GI}^{\mathrm{X}}/\mathrm{Geom}/1$ queues involving heavy-tailed distributions
• Exact and approximate numerical solutions of steady-state distributions arising in the queue \(GI/G/1\)

zbMATH Keywords

queueing theoryempirical distributions\(GI/G/1\)computational probability

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Cites Work

• Queueing theory for telecommunications. Discrete time modelling of a single node system.
• Title not available (Why is that?)
• Numerical Solutions of the Waiting Time Distribution and Idle Time Distribution of the Arithmetic GI/G/1 Queue
• A polynomial factorization approach to the discrete time GI/G/1/(N) queue size distribution
• The Factorization of Queueing Equations and Their Interpretation
• Title not available (Why is that?)
• Efficient computations for the discrete \(GI/G/1\) system
• Analysis of Open Discrete Time Queueing Networks: A Refined Decomposition Approach
• 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

Cited In (10)

• Analysis of \(\text{GI}/\text{M}/s/c\) queues using uniformisation
• Alternative Numerical Solutions of Stationary Queueing-Time Distributions in Discrete-Time Queues: GI/G/1
• An analytical method for the calculation of the waiting time distribution of a discrete time G/G/1-queueing system with batch arrivals
• On the concavity of the waiting-time distribution in some GI/G/1 queues
• Analytically simple and computationally efficient solution to $\mathrm{GI}^{\mathrm{X}}/\mathrm{Geom}/1$ queues involving heavy-tailed distributions
• Interval random variables and their application in queueing systems with long-tailed service times
• Title not available (Why is that?)
• Numerical Solutions of the Waiting Time Distribution and Idle Time Distribution of the Arithmetic GI/G/1 Queue
• Computation of the tail probability for the waiting time in a discrete GI/G/1 queueing system
• Efficient computations for the discrete \(GI/G/1\) system

This page was built for publication: 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

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