Throughput in Processor-Sharing Queues

DOI10.1109/TAC.2006.887906MaRDI QIDQ5282038zbMATH OpenFDO

Authors Na Chen, Scott Jordan

Publication date 27 July 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TAC.2006.887906

Mathematics Subject Classification ID

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

Cited in

(8)

• A note on the event horizon for a processor sharing queue
• Processor-sharing queues: Some progress in analysis
• Hierarchies of processors with endogenous capacity
• On the influence of high priority customers on a generalized processor sharing queue
• Queueing system with processor sharing and limited memory under control of the AQM mechanism
• Predicting response times in processor-sharing queues
• scientific article; zbMATH DE number 7070808 (Why is no real title available?)
• Two queues with vastly different arrival rates and processor-sharing factors

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)