Single-server queueing system with alternating priorities and recurrent input flow

zbMATH Open0856.60099MaRDI QIDQ2563395FDOQ2563395

Authors: V. G. Ushakov 

Publication date: 11 December 1996

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Recommendations

• Queue length in an absolute priority system with hyperexponential input flow
• Analytical methods for analysis of queueing system \(GI| G_ r| 1|\infty\) with relative priority
• scientific article; zbMATH DE number 3848949
• scientific article; zbMATH DE number 2121171
• \(\text{MAP}_2/\text{G}_2/1/n\) queueing system with absolute priority and general queue

zbMATH Keywords

queue lengthservice timeone-channel queueing systemalternating priority disciplinerenewal input stream

Mathematics Subject Classification ID

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

Cited In (10)

• Single server stochastic recirculation systems
• Queue length in an absolute priority system with hyperexponential input flow
• A priority system with working vacations of a server
• Computational algorithm for an analysis of a single-line queueing system with arrived alternating Poisson flow
• Title not available (Why is that?)
• A two-queue system with alternating service
• Title not available (Why is that?)
• Alternating priority versus FCFS scheduling in a two-class queueing system
• Title not available (Why is that?)
• Single server queueing networks with varying sevice times and renewal input

This page was built for publication: Single-server queueing system with alternating priorities and recurrent input flow

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563395)