Heuristics for Finite-Buffer Queues
From MaRDI portal
Publication:3416051
DOI10.1017/S0269964800002540zbMath1134.90343MaRDI QIDQ3416051
Publication date: 19 January 2007
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (10)
The loss probability in an overloaded queue using the dual queue ⋮ Properties and performance modelling of finite buffer \(M/G/1/K\) networks ⋮ Multi-server, Finite Waiting Room,M/G/c/KOptimization Models ⋮ Transient and stationary losses in a finite-buffer queue with batch arrivals ⋮ M/G/c/K PERFORMANCE MODELS IN MANUFACTURING AND SERVICE SYSTEMS ⋮ Asymptotic analysis for loss probability of queues with finite \(GI / M /1\) type structure ⋮ On the loss process in a batch arrival queue ⋮ Optimal design and performance modelling of \(M/G/1/K\) queueing systems ⋮ A simple heuristic for buffer design in finite-capacity queues ⋮ Asymptotics in theMAP/G/1 Queue with Critical Load
Cites Work
This page was built for publication: Heuristics for Finite-Buffer Queues
