Approximate analysis of networks of PH|PH| 1| K queues with customer losses: Test results

DOI10.1023/A:1018926806371zbMATH Open0896.90096MaRDI QIDQ1385367FDOQ1385367

Authors: B. R. Haverkort 

Publication date: 1 July 1998

Published in: Annals of Operations Research (Search for Journal in Brave)

Recommendations

• Approximate analysis for queueing networks with finite capacity and customer loss
• Approximate analysis of non-stationary loss queues and networks of loss queues with general service time distributions
• Approximate analysis of discrete-time tandem queueing networks with bursty and correlated input traffic and customer loss
• Nonstationary analysis of the loss queue and of queueing networks of loss queues
• A method of approximate analysis of an open exponential queuing network with losses due to finite shared buffers in multi-queue nodes
• Approximate analysis of load dependent general queueing networks

zbMATH Keywords

fixed-point iterationphase-type distributionsqueueing networksapproximate analysiscustomer lossesfinite-buffers

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Cited In (3)

• PH fitting of the arrival interval distribution of the passenger flow on urban rail transit stations
• A recursive algorithm for generating the transition matrices of multistation multiserver exponential reliable queueing networks
• Asymmetric kernel method in the study of strong stability of the PH/M/1 queuing system

This page was built for publication: Approximate analysis of networks of PH\(|\)PH\(| 1| K\) queues with customer losses: Test results

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