Limit theorems for priority queues with patch processing in heavy traffic. I
From MaRDI portal
Publication:756869
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)