A Simple Approximation to the Average Queue Size in the Time-Dependent M/M/1 Queue

DOI10.1145/321941.321955zbMATH Open0333.60090OpenAlexW2034957707MaRDI QIDQ4099028FDOQ4099028

Authors: Kenneth Lloyd Rider 

Publication date: 1976

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321941.321955

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25)

Cited In (10)

• Nonstationary queues with interrupted Poisson arrivals and unreliable/repairable servers
• Numerical optimization of a queueing system by dynamic programming
• Robust transient analysis of multi-server queueing systems and feed-forward networks
• A transient analysis to the \(M(\tau)/M (\tau)/k\) queue with time-dependent parameters
• Approximation techniques in the solution of queueing problems
• A New Analytical Model and Protocol for Mobile Ad-Hoc Networks Based on Time Varying Behavior of Nodes
• Optimal control of store-and-forward networks
• An application of modern control theory to a time-dependent queuing system for optimal operation
• Continuous approximation of \(M_t/M_t/ 1\) distributions with application to production
• On finite capacity queues with time dependent arrival rates

This page was built for publication: A Simple Approximation to the Average Queue Size in the Time-Dependent M/M/1 Queue

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4099028)