New approach for finding basic performance measures of single server queue

DOI10.1155/2014/851738zbMath1426.60113OpenAlexW2115875400WikidataQ59061435 ScholiaQ59061435MaRDI QIDQ1667387

Siew Khew Koh, Ah Hin Pooi, Yi Fei Tan

Publication date: 28 August 2018

Published in: Journal of Probability and Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/851738

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Cites Work

• Unnamed Item
• Unnamed Item
• Numerical approximations for the steady-state waiting times in a \(GI/G/1\) queue
• Combined elapsed time and matrix-analytic method for the discrete time \(GI/G/1\) and \(GI^X/G/1\) systems
• Matrix?geometric analysis of the discrete time Gi/G/1 system
• A polynomial factorization approach to the discrete time GI/G/1/(N) queue size distribution
• An Algorithm to Compute the Equilibrium Distribution of a One-Dimensional Bounded Random Walk
• Numerical Solutions of the Waiting Time Distribution and Idle Time Distribution of the Arithmetic GI/G/1 Queue
• Computing the Waiting Time Distribution for the G/G/1 Queue by Signal Processing Methods
• An Elementary Solution of the Queuing System G/G/1
• Theory and numerical solution of a discrete queueing problem
• Waiting time, busy periods and output models of a server analyzed via Wiener–Hopf factorization

This page was built for publication: New approach for finding basic performance measures of single server queue