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

batch processingheavy-traffic limit theorempriority queueing

Mathematics Subject Classification ID

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

Review text

An M/G/1 queue with r types of customers is considered. Customers of type i-1 have priority over those of type i, and when the server becomes idle, he immediately serves the whole batch of customers having the lowest priority number. A heavy-traffic limit theorem is proved for the virtual waiting time \(w_ i\) of a batch that contains an i-request arriving at time t.

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)

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