Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue

DOI10.1007/s11134-006-7583-yzbMath1123.60070OpenAlexW2124636195MaRDI QIDQ2494557

Hans van den Berg, Richard J. Boucherie, Sing-Kong Cheung

Publication date: 28 June 2006

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-006-7583-y

zbMATH Keywords

momentsEulerian numbersconditional sojourn timepermanent customers\(M/G/1\) PSinsensitive boundsinstantaneous sojourn timemoment ordering

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (5)

Additive functionals with application to sojourn times in infinite-server and processor sharing systems ⋮ Monotonicity properties for multi-class queueing systems ⋮ Processor sharing: a survey of the mathematical theory ⋮ Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing ⋮ Waiting times for \(M/M\) systems under state-dependent processor sharing

Uses Software

• Eulerian Number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eulerian numbers and polynomials of higher order
• Processor-sharing queues: Some progress in analysis
• The \(M/G/1\) queue with processor sharing and its relation to a feedback queue
• Mathematical problems in the theory of processor-sharing queueing systems
• Characterizations of the \({\mathcal L}\)-class of life distributions
• The M/G/1 processor-sharing model: Transient behavior
• Sojourn time asymptotics in the \(M/G/1\) processor sharing queue
• On the coefficient of variation of the \({\mathcal L}\)- and \(\bar {\mathcal L}\)-classes
• A useful ageing property based on the Laplace transform
• On a heavy traffic limit theorem for the M/G/1 processor-sharing queue
• A note on the ℒ-class of life distributions
• A new approach to the M/G/1 processor-sharing queue
• Conditional response times in the M/G/1 processor-sharing system
• The sojourn-time distribution in the M/G/1 queue by processor sharing
• On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes
• Analysis of A time‐shared processor
• Time-shared Systems

This page was built for publication: Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue