On steady-state queue size distributions of the discrete-time GI/G/1 queue

DOI10.2307/1428169zbMath0872.60069OpenAlexW4235220522MaRDI QIDQ4332215

Tao Yang, Mohan L. Chaudhry

Publication date: 1 October 1997

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1428169

zbMATH Keywords

communication networksdiscrete-time queuesmatrix analytic technique

Mathematics Subject Classification ID

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

Related Items (8)

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 ⋮ Workload Process, Waiting Times, and Sojourn Times in a Discrete TimeMMAP[K/SM[K]/1/FCFS Queue] ⋮ Markov chain representations of discrete distributions applied to queueing models ⋮ Comparison of discrete time inventory systems with positive service time and lead time ⋮ A Replenishment Inventory Model with a Stock-Dependent Demand and Age–Stock-Dependent Cost Functions in a Random Environment ⋮ ON THE TIME-DEPENDENT OCCUPANCY DISTRIBUTION OF THE G/G/1 QUEUING SYSTEM ⋮ Age process, workload process, sojourn times, and waiting times in a discrete time SM[K/PH[K]/1/FCFS queue] ⋮ Discrete time queues and matrix-analytic methods. (With comments and rejoinder)

This page was built for publication: On steady-state queue size distributions of the discrete-time GI/G/1 queue