Analysis of the queuing systems with processor sharing service discipline and random serving rate coefficients

DOI10.1007/978-3-030-72247-0_17OpenAlexW3139881612MaRDI QIDQ1980525

Maksym Korshikov, Eduard S. Sopin

Publication date: 8 September 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-72247-0_17

zbMATH Keywords

blocking probabilityqueuing systemSojourn timelimited processor sharingserving rate coefficients

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• On the total amount of resources occupied by serviced customers
• Processor sharing: a survey of the mathematical theory
• Steady state approximations of limited processor sharing queues in heavy traffic
• Poisson Arrivals See Time Averages
• Sojourn Time Analysis for Processor Sharing Loss System with Unreliable Server
• Applied Probability and Queues
• ANALYSIS OF MULTI-RESOURCE LOSS SYSTEM WITH STATE-DEPENDENT ARRIVAL AND SERVICE RATES

This page was built for publication: Analysis of the queuing systems with processor sharing service discipline and random serving rate coefficients