A Simple Approximation to the Average Queue Size in the Time-Dependent M/M/1 Queue
From MaRDI portal
Publication:4099028
DOI10.1145/321941.321955zbMath0333.60090OpenAlexW2034957707MaRDI QIDQ4099028
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
Related Items (10)
A transient analysis to the \(M(\tau)/M (\tau)/k\) queue with time-dependent parameters ⋮ Nonstationary queues with interrupted Poisson arrivals and unreliable/repairable servers ⋮ Numerical optimization of a queueing system by dynamic programming ⋮ Continuous approximation of \(M_t/M_t/ 1\) distributions with application to production ⋮ On finite capacity queues with time dependent arrival rates ⋮ A New Analytical Model and Protocol for Mobile Ad-Hoc Networks Based on Time Varying Behavior of Nodes ⋮ Robust transient analysis of multi-server queueing systems and feed-forward networks ⋮ Approximation techniques in the solution of queueing problems ⋮ An application of modern control theory to a time-dependent queuing system for optimal operation ⋮ Optimal control of store-and-forward networks
This page was built for publication: A Simple Approximation to the Average Queue Size in the Time-Dependent M/M/1 Queue
