On steady-state queue size distributions of the discrete-time GI/G/1 queue
From MaRDI portal
Publication:4332215
DOI10.2307/1428169zbMATH Open0872.60069OpenAlexW4235220522MaRDI QIDQ4332215FDOQ4332215
Authors: Tao Yang, M. 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
Recommendations
- On the steady-state queue size distribution of the discrete-time \(\text{Geo}/G/1\) queue with repeated customers
- Steady-state queue size distribution of discrete-time \(PH/Geo/1\) retrial queues.
- ON THE DISCRETE-TIME G/GI/∞ QUEUE
- ON THE STEADY-STATE DISTRIBUTION OF NUMBER IN THE QUEUE Geom/G/1
- Steady-state GI/G/\(n\) queue in the Halfin-Whitt regime
- Approximations and bounds for the variance of steady-state waiting times in a GI/G/1 queue
- scientific article; zbMATH DE number 738909
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cited In (21)
- ON THE STEADY-STATE DISTRIBUTION OF NUMBER IN THE QUEUE Geom/G/1
- A replenishment inventory model with a stock-dependent demand and age-stock-dependent cost functions in a random environment
- Workload Process, Waiting Times, and Sojourn Times in a Discrete TimeMMAP[K]/SM[K]/1/FCFS Queue
- A short note on the \(GI/Geo/1\) queueing system
- Discrete time queues and matrix-analytic methods. (With comments and rejoinder)
- Analysis of the discrete-time GI/G/1/K using the remaining time approach
- 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
- ON THE TIME-DEPENDENT OCCUPANCY DISTRIBUTION OF THE G/G/1 QUEUING SYSTEM
- Title not available (Why is that?)
- On the relations among the distributions at different epochs for discrete-time GI/Geom/1 queues
- Comparison of discrete time inventory systems with positive service time and lead time
- Computational procedures for a class of GI/D/\(k\) systems in discrete time
- Age process, workload process, sojourn times, and waiting times in a discrete time SM[K]/PH[K]/1/FCFS queue
- Combined elapsed time and matrix-analytic method for the discrete time \(GI/G/1\) and \(GI^X/G/1\) systems
- Analytically explicit results for the GI/C-MSP/1/\(\infty \) queueing system using roots
- The steady-state appearance of the M/G/1 queue under the discipline of shortest remaining processing time
- Markov chain representations of discrete distributions applied to queueing models
- Approximations and bounds for the variance of steady-state waiting times in a GI/G/1 queue
- DISTRIBUTION PROPERTIES OF DISCRETE CHARACTERISTICS IN M/G/1 AND GI/M/1 QUEUES
- Efficient computations for the discrete \(GI/G/1\) system
- Matrix?geometric analysis of the discrete time Gi/G/1 system
This page was built for publication: On steady-state queue size distributions of the discrete-time GI/G/1 queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4332215)
