Ratio between average sojourn times under processor sharing and fair sojourn protocol

DOI10.1017/S0269964810000124MaRDI QIDQ3087799zbMATH OpenFDO

Authors Yingdong Lu

Publication date 17 August 2011

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Recommendations

• The sojourn time in the GI/M/1 queue by processor sharing
• Sojourn times in the \(M/ PH/1\) processor sharing queue
• A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications
• PERFORMANCE ESTIMATION OFM/D_K/1 QUEUE UNDER FAIR SOJOURN PROTOCOL IN HEAVY TRAFFIC
• Sojourn time asymptotics in processor-sharing queues

Cited in

(1)

• PERFORMANCE ESTIMATION OFM/D_K/1 QUEUE UNDER FAIR SOJOURN PROTOCOL IN HEAVY TRAFFIC

This page was built for publication: Ratio between average sojourn times under processor sharing and fair sojourn protocol

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3087799)