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

zbMATH Open0723.60113MaRDI QIDQ756869FDOQ756869

Authors: Elena E. Dyakonova, Konstantin P. Belyaev 

Publication date: 1989

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

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

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)

Cited In (5)

• Title not available (Why is that?)
• Waiting time with critical load for priority systems with semi-Markov service
• Title not available (Why is that?)
• Heavy-traffic asymptotics of a priority polling system with threshold service policy
• Title not available (Why is that?)

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)