Combination of Queueing Systems of Different Types with Common Buffer: A Theoretical Treatment

DOI10.1007/978-3-319-68069-9_13zbMath1397.90142OpenAlexW2759540677MaRDI QIDQ4685074

Marcin Ziółkowski, Oleg M. Tikhonenko

Publication date: 5 October 2018

Published in: Information Technologies and Mathematical Modelling. Queueing Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-68069-9_13

zbMATH Keywords

queueing systemprocessor-sharing systembuffer space capacitydemand volumetotal demands capacity

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Queuing system with processor sharing and limited resources
• Processor sharing: a survey of the mathematical theory
• Destricted capacity queueing systems: Determination of their characteristics
• Generalized Erlang problem for service systems with finite total capacity
• Queueing Theory
• Analysis of queueing systems for random-length arrivals with limited cumulative volume

This page was built for publication: Combination of Queueing Systems of Different Types with Common Buffer: A Theoretical Treatment