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

MaRDI QIDQ2563395zbMATH OpenFDO

Authors V. G. Ushakov

Publication date 11 December 1996

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

zbMATH Keywords

queue lengthservice timeone-channel queueing systemalternating priority disciplinerenewal input stream

Mathematics Subject Classification ID

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

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

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
• scientific article; zbMATH DE number 2121171 (Why is no real title available?)
• A two-queue system with alternating service
• scientific article; zbMATH DE number 4143753 (Why is no real title available?)
• Alternating priority versus FCFS scheduling in a two-class queueing system
• scientific article; zbMATH DE number 3848949 (Why is no real title available?)
• 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)