On the relation between customer and time averages in queues
From MaRDI portal
Publication:5640553
DOI10.2307/3212174zbMath0232.60085OpenAlexW2319456649MaRDI QIDQ5640553
Publication date: 1971
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3212174
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (35)
Polling: past, present, and perspective ⋮ Sample path analysis of contribution and reward in cooperative groups ⋮ Little laws for utility processes and waiting times in queues ⋮ Waiting time estimation in a manufacturing system using the number of machine idle periods ⋮ On the relationship between work load and waiting time in single server queues with batch inputs ⋮ Representing workloads in GI/G/1 queues through the preemptive-resume LIFO queue discipline ⋮ Estimation of the mean waiting time of a customer subject to balking: a simulation study ⋮ Sojourn times in a processor sharing queue with multiple vacations ⋮ A robust queueing network analyzer based on indices of dispersion ⋮ Equilibrium strategies for a tandem network under partial information ⋮ History of Queueing Theory in Canada Prior to 1980 ⋮ System delay versus system content for discrete-time queueing systems subject to server interruptions ⋮ Little's law when the average waiting time is infinite ⋮ Workload in queues having priorities assigned according to service time ⋮ On pathwise rate conservation for a class of semi-martingales ⋮ Rate conservation principle for discrete-time queues ⋮ Moment relationships for queues with Poisson input ⋮ How much power is needed for a billion-thread high-throughput server? ⋮ A new procedure to estimate waiting time in \(GI/G/2\) system by server observation ⋮ Approximate Formula of Delay-Time Variance in Renewal-Input General-Service-Time Single-Server Queueing System ⋮ A Cost-Equation Analysis of General-Input General-Service Processor Sharing System ⋮ Networks of queues in discrete time ⋮ The advantage of indices of dispersion in queueing approximations ⋮ Queues with nonstationary inputs ⋮ Delay and partial system contents for a discrete-time G-D-c queue ⋮ Workloads and waiting times in single-server systems with multiple customer classes ⋮ Diffusion Approximation for a Web-Server System with Proxy Servers ⋮ A Further Remark on Diffusion Approximations with RB and ER Boundary Conditions ⋮ Unnamed Item ⋮ Stationary queuing systems with dependencies ⋮ Refining diffusion approximations for queues ⋮ Semi-autonomous planning using linear programming in the Chilean General Treasury ⋮ A review of \(L=\lambda W\) and extensions ⋮ Second moment relationships for waiting times in queueing systems with Poisson input ⋮ Rate conservation laws: A survey
This page was built for publication: On the relation between customer and time averages in queues