Recurrence relations for two-channel queuing systems with Erlangian service time

DOI10.1007/S10559-018-0048-6zbMath1401.60171OpenAlexW2804257984MaRDI QIDQ1795516

Yanyan Li

Publication date: 16 October 2018

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-018-0048-6

zbMATH Keywords

recurrence relationsrandom dropping of customersfictitious phase methodErlangian service timessteady-state characteristicstwo-channel queueing systems

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25)

Related Items (1)

Reliability of a series system with redundancy and one repair facility

Uses Software

• GPSS World

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 two-channel queuing systems with Erlangian service time