Some Queuing Problems with Restrictions

DOI10.1137/1106026MaRDI QIDQ4772529zbMATH OpenOpenAlexFDO

Authors I. M. Kovalenko

Publication date 1962

Published in Theory of Probability & Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1106026

Mathematics Subject Classification ID

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

Cited in

(5)

• Multi-class M/PH/1 queues with deterministic impatience times
• A computational algorithm for the loss probability in the \(\mathrm{M}/\mathrm{G}/1+\mathrm{PH}\) queue
• Workload and busy period for \(\mathrm{M}/\mathrm{GI}/1\) with a general impatience mechanism
• On stability of queueing networks with job deadlines
• Comparison results for \(M/G/1\) queues with waiting and sojourn time deadlines

This page was built for publication: Some Queuing Problems with Restrictions

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