Simplified analysis of queueing systems with random requirements

DOI10.1007/978-3-319-76035-3_27MaRDI QIDQ1793951zbMATH OpenOpenAlexFDO

Authors Konstantin E. Samouylov, Yuliya V. Gaidamaka, Eduard S. Sopin

Publication date 12 October 2018

Full work available at URL https://doi.org/10.1007/978-3-319-76035-3_27

zbMATH Keywords

insensitivitylimited resourcesprobabilistic characteristicsqueuing system

Mathematics Subject Classification ID

Exact distribution theory in statistics (62E15) Applications of statistics in engineering and industry; control charts (62P30)

Recommendations

• An M/G/c queue in which the number of servers required is random
• Multiclass \(GI/GI/ \infty\) queueing systems with random resource requirements
• Analysis of queueing system with resources and signals
• Analysis of queueing systems for random-length arrivals with limited cumulative volume
• Analysis of networks of the resource queuing systems

Cited in

(2)

• Queueing systems with random volume customers and a sectorized unlimited memory buffer
• Estimating the overlapping probability for complex demands in queuing systems

This page was built for publication: Simplified analysis of queueing systems with random requirements

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