Waiting times for \(M/M\) systems under state-dependent processor sharing
From MaRDI portal
Publication:1025610
DOI10.1007/s11134-008-9086-5zbMath1162.90392OpenAlexW1991086724MaRDI QIDQ1025610
Andreas Brandt, Manfred Brandt
Publication date: 19 June 2009
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-008-9086-5
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 (6)
Evaluation and prediction of an optimal control in a processor sharing queueing system with heterogeneous servers ⋮ On busy period and sojourn time distributions in the M/G/1-EPS queue with catastrophes ⋮ Additive functionals with application to sojourn times in infinite-server and processor sharing systems ⋮ Computing the performance measures in queueing models via the method of order statistics ⋮ Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing ⋮ On sojourn times in \(M/GI\) systems under state-dependent processor sharing
Cites Work
- Head of the line processor sharing for many symmetric queues with finite capacity
- Processor-sharing queues: Some progress in analysis
- A single server queue with gated processor-sharing discipline
- 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
- On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers
- Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows
- Response times in gated M/G/1 queues: The processor-sharing case
- Bandwidth sharing and admission control for elastic traffic
- A note on the stability of the many-queue head-of-the-line processor-sharing system with permanent customers
- A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications
- Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue
- Sojourn times in the \(M/ PH/1\) processor sharing queue
- Batch arrival processor-sharing with application to multi-level processor-sharing scheduling
- On the stability of the multi-queue multi-server processor sharing with limited service
- Response-Time Distribution for a Processor-Sharing System
- Waiting time distributions for M/M/N processor sharing queues
- Generalized processor sharing queues with heterogeneous traffic classes
- Insensitivity in processor-sharing networks
- Tail asymptotics for processor-sharing queues
- Time-shared Systems
- Waiting Time Distributions for Processor-Sharing Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Waiting times for \(M/M\) systems under state-dependent processor sharing
