Recurrence relations for multichannel queueing systems with second-order Erlangian service times
From MaRDI portal
Publication:722051
DOI10.1007/S10559-018-0028-XzbMath1391.90201OpenAlexW2795788204MaRDI QIDQ722051
Publication date: 20 July 2018
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-018-0028-x
recurrence relationsrandom dropping of customersfictitious phase methodErlangian service timesmultichannel queueing systemssteady-state characteristics
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Determination of steady-state characteristics of three-channel queuing systems with Erlangian service times
- On characteristics of the \(M^{\theta}/G/1/m\) and \(M^{\theta}/G/1\) queues with queue-size based packet dropping
- Determining stationary characteristics of two-channel queueing systems with Erlangian distribution of service time
- A NUMERICAL METHOD FOR THE STEADY-STATE PROBABILITIES OF A G1/G/C QUEUING SYSTEM IN A GENERAL CLASS
- Queue-Size Distribution in M/G/1-Type System with Bounded Capacity and Packet Dropping
This page was built for publication: Recurrence relations for multichannel queueing systems with second-order Erlangian service times