Limit theorems for priority queues with patch processing in heavy traffic. I

MaRDI QIDQ756869zbMATH OpenFDO

Authors Elena E. Dyakonova, Konstantin P. Belyaev

Publication date 1989

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

zbMATH Keywords

heavy-traffic limit theorembatch processingpriority queueing

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4030673
• scientific article; zbMATH DE number 4007415
• On a heavy traffic limit theorem for the M/G/1 processor-sharing queue
• Waiting time with critical load for priority systems with semi-Markov service
• A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types

Cited in

(5)

• Heavy-traffic asymptotics of a priority polling system with threshold service policy
• Waiting time with critical load for priority systems with semi-Markov service
• scientific article; zbMATH DE number 919363 (Why is no real title available?)
• scientific article; zbMATH DE number 4030673 (Why is no real title available?)
• scientific article; zbMATH DE number 4007415 (Why is no real title available?)

This page was built for publication: Limit theorems for priority queues with patch processing in heavy traffic. I

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