Two competing discrete-time queues with priority

DOI10.1007/BF01157855zbMath0668.60085OpenAlexW2077401620MaRDI QIDQ1118267

Moshe Sidi

Publication date: 1988

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01157855

zbMATH Keywords

communication protocolssingle-server systemgenerating function techniquessteady-state queue lengthsunbounded buffers

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items

Discrete-time \(Geo^{X}/G/1\) queue with non-preemptive priority ⋮ Performance of discrete-time queueing systems ⋮ Impact of class clustering in a multiclass FCFS queue with order-dependent service times ⋮ A discrete-time priority queue with two-class customers and bulk services ⋮ Open queueing networks in discrete time -- some limit theorems ⋮ Discrete-time Geo\(^X\)/G/1 queue with preemptive resume priority ⋮ Delay analysis of discrete-time priority queue with structured inputs

Cites Work

• A Proof for the Queuing Formula: L = λW
• Two Discrete-Time Queues in Tandem
• Two coupled processors: The reduction to a Riemann-Hilbert problem
• Two Queues with Alternating Service
• Service in a Loop System
• Two Queues with Changeover Times
• Unnamed Item