Monotonicity properties for multi-class queueing systems

DOI10.1007/s10626-009-0069-4zbMath1200.90056OpenAlexW2086473853MaRDI QIDQ609556

Urtzi Ayesta, Sem C. Borst, Ina Maria Verloop

Publication date: 1 December 2010

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11824/388

zbMATH Keywords

monotonicitymulti-class queueing systemsGPSbandwidth-sharing networksc\(\mu \)-ruleDPSmean number of userssample-path comparisonsweighted \(\alpha \)-fair policies

Mathematics Subject Classification ID

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

Related Items (11)

Analysis of a two-class single-server discrete-time FCFS queue: the effect of interclass correlation ⋮ Monotonicity of the mean queue size in DPS systems ⋮ Inequity averse optimization in operational research ⋮ On the optimization of two-class work-conserving parameterized scheduling policies ⋮ Impact of class clustering in a multiclass FCFS queue with order-dependent service times ⋮ A guide to formulating fairness in an optimization model ⋮ Effect of global FCFS and relative load distribution in two-class queues with dedicated servers ⋮ Necessary and sufficient conditions for strong comparability of multicomponent systems ⋮ Counterexamples to conjectures on discriminatory processor sharing and generalized processor sharing systems ⋮ Strict monotonicity and continuity of mean unfinished work in two queues sharing a server ⋮ Stochastic monotonicity approach for a non-Markovian priority retrial queue

Cites Work

• Unnamed Item
• Markov chains and stochastic stability
• Stability of parallel queueing systems with coupled service rates
• State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy
• Sample-path analysis of queueing systems
• Bandwidth sharing and admission control for elastic traffic
• On stochastic bounds for monotonic processor sharing networks
• Fluid model for a network operating under a fair bandwidth-sharing policy.
• On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
• Sample path methods in the control of queues
• Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue
• A survey on discriminatory processor sharing
• Fairness and stability of end-to-end congestion control
• Markovian couplings staying in arbitrary subsets of the state space
• Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures
• Stochastic Orderings for Markov Processes on Partially Ordered Spaces
• Sharing a Processor Among Many Job Classes
• Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Optimal scheduling in a machine with stochastic varying processing rate
• Generalized processor sharing queues with heterogeneous traffic classes
• The Queue M/G/1 with the Shortest Remaining Processing Time Discipline
• Time-shared Systems

This page was built for publication: Monotonicity properties for multi-class queueing systems