The preempt-resume M/G/1 queue with feedback and clocked schedules

DOI10.1016/0166-5316(89)90026-6MaRDI QIDQ3834835zbMATH OpenOpenAlexFDO

Authors L. D. Servi, Julian Keilson

Publication date 1989

Published in Performance Evaluation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-5316(89)90026-6

zbMATH Keywords

queueing systemPoisson approximationtelecommunicationpriority classeshigh priority customers

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Priority Queues with Feedback
• Mean waiting times in a general feedback queue with priorities
• scientific article; zbMATH DE number 522747
• Evaluation of the total time in system in a preempt/resume priority queue via a modified Lindley process
• Joint queue-lengths and sojourn-time distributions in a general preemptive feedback queue

Cited in

(5)

• A solution to mean delay in the \(\sum M_c/G_{ck}/1\) cyclic priority queue with cycle \((k)\) and class \((c)\) dependent feedback and service times
• The distributional form of Little's law and the Fuhrmann-Cooper decomposition
• Priority Queues with Feedback
• A distributional form of Little's law
• Unified and refined analysis of the response time and waiting time in the \(\mathrm{M}/\mathrm{M}/m\) FCFS preemptive-resume priority queue

This page was built for publication: The preempt-resume M/G/1 queue with feedback and clocked schedules

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