Throughput in Processor-Sharing Queues
From MaRDI portal
Publication:5282038
DOI10.1109/TAC.2006.887906zbMATH Open1366.90076MaRDI QIDQ5282038FDOQ5282038
Authors: Na Chen, Scott Jordan 
Publication date: 27 July 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cited In (8)
- A note on the event horizon for a processor sharing queue
- Queueing system with processor sharing and limited memory under control of the AQM mechanism
- Predicting response times in processor-sharing queues
- Two queues with vastly different arrival rates and processor-sharing factors
- Title not available (Why is that?)
- On the influence of high priority customers on a generalized processor sharing queue
- Hierarchies of processors with endogenous capacity
- Processor-sharing queues: Some progress in analysis
This page was built for publication: Throughput in Processor-Sharing Queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5282038)
