scientific article; zbMATH DE number 3972594

MaRDI QIDQ3738889zbMATH OpenFDO

Authors S. F. Yashkov

Publication date 1986

zbMATH Keywords

asymptotic estimatesM/G/1 processor- sharing systemvariance of the sojourn time

Mathematics Subject Classification ID

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

Recommendations

• The sojourn time in the GI/M/1 queue by processor sharing
• Asymptotic approximations for the gi/m/1 queue with processor-sharing service
• Sojourn time asymptotics in the M/G/1 processor sharing queue
• Sojourn time asymptotics in processor sharing queues with varying service rate
• Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue

Cited in

(8)

• Processor-sharing queues: Some progress in analysis
• Mathematical problems in the theory of processor-sharing queueing systems
• Sojourn time asymptotics in processor sharing queues with varying service rate
• The sojourn time in the GI/M/1 queue by processor sharing
• Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing
• Asymptotic approximations for the gi/m/1 queue with processor-sharing service
• Mathematical theory of queueing networks
• Processor sharing: a survey of the mathematical theory

This page was built for publication:

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