A survey on discriminatory processor sharing
From MaRDI portal
Publication:2494560
DOI10.1007/s11134-006-7586-8zbMath1114.90014OpenAlexW2065808783WikidataQ56753260 ScholiaQ56753260MaRDI QIDQ2494560
Urtzi Ayesta, Eitan Altman, Konstantin E. Avrachenkov
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-7586-8
Related Items (22)
Queueing with priorities and standard service: Stoppable and unstoppable servers ⋮ Markov-modulated \(\mathrm{M}/\mathrm{G}/1\)-type queue in heavy traffic and its application to time-sharing disciplines ⋮ Approximations for Chat Service Systems Using Many-Server Diffusion Limits ⋮ Approximate sojourn time distribution of a discriminatory processor sharing queue with impatient customers ⋮ Asymptotics of waiting time distributions in the accumulating priority queue ⋮ The fluid limit of the multiclass processor sharing queue ⋮ Monotonicity properties for multi-class queueing systems ⋮ Approximate queue length distribution of a discriminatory processor sharing queue with impatient customers ⋮ Biased Processor Sharing in Fork-Join Queues ⋮ Analysis of retrial queuing system with limited processor sharing discipline and changing effective bandwidth ⋮ Processor sharing: a survey of the mathematical theory ⋮ Counterexamples to conjectures on discriminatory processor sharing and generalized processor sharing systems ⋮ Waiting times in queues with relative priorities ⋮ Heavy-traffic limits for discriminatory processor sharing models with joint batch arrivals ⋮ Mean sojourn times for phase-type discriminatory processor sharing systems ⋮ Analysis of multiclass Markovian polling systems with feedback and composite scheduling algorithms ⋮ CONDITIONAL SOJOURN TIMES OF PROCESSOR-SHARING QUEUES ⋮ Analysis of a Markovian feedback queue with multi-class customers and its application to the weighted round-robin queue ⋮ Queueing models for the analysis of communication systems ⋮ Instability of sharing systems in the presence of retransmissions ⋮ A stochastic analysis of resource sharing with logarithmic weights ⋮ Whittle indexability in egalitarian processor sharing systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic analysis of a large closed queueing network with discriminatory processor sharing
- Processor-sharing queues: Some progress in analysis
- Mathematical problems in the theory of processor-sharing queueing systems
- Complete parameterized families of job scheduling strategies
- On the transient behavior of the processor sharing queue
- A decomposition theorem and related results for the discriminatory processor sharing queue
- Insensitive bandwidth sharing in data networks
- To queue or not to queue: equilibrium behavior in queueing systems.
- Sojourn time asymptotics in the \(M/G/1\) processor sharing queue
- A mathematical analysis of the cumulus pricing scheme
- Bandwidth sharing and admission control for elastic traffic
- On stochastic bounds for monotonic processor sharing networks
- Sojourn time asymptotics in processor-sharing queues
- Batch arrival processor-sharing with application to multi-level processor-sharing scheduling
- Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures
- A Characterization of Waiting Time Performance Realizable by Single-Server Queues
- Sharing a Processor Among Many Job Classes
- On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes
- Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control
- Direct Solutions of M/G/1 Processor-Sharing Models
- Generalized processor sharing queues with heterogeneous traffic classes
- Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities
- A conservation law for a wide class of queueing disciplines
- Time-shared Systems
- The processor‐sharing queueing model for time‐shared systems with bulk arrivals
- Queue-Length Distribution for the Discriminatory Processor-Sharing Queue
- Sample-path conservation laws, with applications to scheduling queues and fluid systems
This page was built for publication: A survey on discriminatory processor sharing
