The discrete-time single-server queue
The limiting distribution of the waiting time of a single-server system in discrete time is considered. The service times and the arrival times are arbitrarily distributed and independent. The service time of a customer arriving at an empty system can have a modified distribution. An exact relation between the generating functions of the steady-state waiting-time distribution and the idle-time distribution is given in the general case. Using this relation more explicit results are stated when the generating functions of either the interarrival-time distribution or the service-time distribution is rational. Since the queue-length process can be periodic, a Cesàro limit defines the limiting waiting-time distribution. Some results on the asymptotic behavior of the witing-time distribution are contained, especially a condition for a geometrically fast decreasing tail. The standard technique of complex-valued functions is used to elaborate the analysis of the generating functions. Numerical results for various interarrival-time and service-time distributions illustrate the derived formulas.
- A discrete-time single-server queue with set-up time
- A note on stochastic decomposition in a GI/G/1 queue with vacations or set-up times
- Asymptotic Analysis for Buffer Behavior in Communication Systems
- scientific article; zbMATH DE number 3126031 (Why is no real title available?)
- scientific article; zbMATH DE number 3755546 (Why is no real title available?)
- scientific article; zbMATH DE number 3246263 (Why is no real title available?)
- scientific article; zbMATH DE number 3267809 (Why is no real title available?)
- scientific article; zbMATH DE number 3319139 (Why is no real title available?)
- scientific article; zbMATH DE number 3084689 (Why is no real title available?)
- Limit Theorems for Generalized Single Server Queues: The Exceptional System
- On regenerative processes in queueing theory
- ON THE CONVERGENCE OF EIGENFUNCTION EXPANSIONS
- Theory and numerical solution of a discrete queueing problem
- A polling model with an autonomous server
- Stationary queues with one autonomous server
- The single server queue with inhomogeneous arrival rate and discrete service time distribution
- A single-server queue with random accumulation level
- Finiteness of waiting-time moments in general stationary single-server queues
- New approach for finding basic performance measures of single server queue
- A unified approach to the proportional relation for discrete-time single-server queues
- Waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic service times: \(D-MAP/D/k\) system
- An exact root-free method for the expected queue length for a class of discrete-time queueing systems
- Performance of discrete-time queueing systems
- Delay in a tandem queueing model with mobile queues: an analytical approximation
- scientific article; zbMATH DE number 5601217 (Why is no real title available?)
- An analytical interpretation of the discrete approximation for the GI/GI/1 queue1
- scientific article; zbMATH DE number 3923832 (Why is no real title available?)
- scientific article; zbMATH DE number 3967621 (Why is no real title available?)
- scientific article; zbMATH DE number 4100354 (Why is no real title available?)
- On a random area variable arising in discrete-time queues and compact directed percolation
- scientific article; zbMATH DE number 2149284 (Why is no real title available?)
- Waiting time, busy periods and output models of a server analyzed via Wiener–Hopf factorization
- Relationship between queue length and waiting time in a stationary discrete-time queue
- scientific article; zbMATH DE number 932424 (Why is no real title available?)
- Analysis of various parameters of limited source queuing model having single server by using binomial and uniform distribution
- Roots, symmetry, and contour integrals in queuing-type systems
- Discrete-time queuing theory
- A DISCRETE QUEUE, FOURIER SAMPLING ON SZEGÖ CURVES AND SPITZER FORMULAS
- 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
- Discrete-Time Queueing System with Expulsions
- Discrete-time single-server system with requests of several types
- A single server model for packetwise transmission of messages
This page was built for publication: The discrete-time single-server queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809487)
