Approximations for the steady-state probabilities in theM/G/cqueue
From MaRDI portal
Publication:3891537
DOI10.2307/1426474zbMath0446.60079OpenAlexW2085306657WikidataQ56912814 ScholiaQ56912814MaRDI QIDQ3891537
Awi Federgruen, M. H. van Hoorn, Henk C. Tijms
Publication date: 1981
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1426474
Related Items
Performance analysis of voice over internet protocol via non Markovian loss system with preemptive priority and server break down, Approximations for multi-server queues: System interpolations, An \(M/G/2\) queue where customers are served subject to a minimum violation of FCFS queue discipline, On the inapproximability of \(M/G/K\): Why two moments of job size distribution are not enough, Approximations for the delay probability in the \(M/G/s\) queue, Analysis of the stationary \(E_ k/C_ 2/s\) queueing system, Predicting the performance of queues -- a data analytic approach, On Markov-Krein characterization of the mean waiting time in \(M/G/K\) and other queueing systems, Approximations for the \(M/GI/N +GI\) type call center, BALKING AND RENEGING IN M/G/s SYSTEMS EXACT ANALYSIS AND APPROXIMATIONS, A NEW APPROACH FOR THE STUDY OF THE MX/G/1 QUEUE USING RENEWAL ARGUMENTS, Queueing models for a flexible machining station. I: The diffusion approximation, Simple Bounds and Monotnicity the Call Congestion of Finite Multiserver Delay Systems, Tables for M/G/c queuing systems with phase-type service, Equivalence relations in the approximations for the \(M/G/s/s+r\) queue., Approximate solution for multi-server queueing systems with Erlangian service times, Bounds for the mean queue length of the \(M/K_ 2/m\) queue
