On sojourn times in \(M/GI\) systems under state-dependent processor sharing

DOI10.1007/S11134-009-9157-2zbMath1185.90042OpenAlexW2052112743MaRDI QIDQ2268468

Manfred Brandt, Andreas Brandt

Publication date: 8 March 2010

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

Full work available at URL: https://doi.org/10.1007/s11134-009-9157-2

Mathematics Subject Classification ID

Stationary stochastic processes (60G10) 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 (2)

Additive functionals with application to sojourn times in infinite-server and processor sharing systems ⋮ Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing

Cites Work

• Unnamed Item
• Processor sharing: a survey of the mathematical theory
• Waiting times for \(M/M\) systems under state-dependent processor sharing
• 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
• Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows
• Insensitivity and reversed Markov processes
• The sojourn-time distribution in the M/G/1 queue by processor sharing
• Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing
• Waiting time distributions for M/M/N processor sharing queues
• Insensitivity in processor-sharing networks
• Tail asymptotics for processor-sharing queues
• A Note on Insensitivity in Stochastic Networks
• Time-shared Systems
• Waiting Time Distributions for Processor-Sharing Systems

This page was built for publication: On sojourn times in \(M/GI\) systems under state-dependent processor sharing