On stochastic bounds for monotonic processor sharing networks

From MaRDI portal
Publication:1876057

DOI10.1023/B:QUES.0000032802.41986.C6zbMath1073.68018MaRDI QIDQ1876057

Thomas Bonald, Alexandre Proutiere

Publication date: 16 August 2004

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




Related Items (21)

Asymptotic independence of servers' activity in queueing systems with limited resource poolingBandwidth-sharing networks under a diffusion scalingInteracting queues with server selection and coordinated scheduling-application to cellular data networksImpact of fairness and heterogeneity on delays in large-scale centralized content delivery systemsBandwidth sharing networks with priority scalingMonotonicity properties for multi-class queueing systemsSojourn time asymptotics in a parking lot networkPoly-symmetry in processor-sharing systemsAnalysis of bandwidth allocation on end-to-end QoS networks under budget controlUtility Optimization in Congested Queueing NetworksInsensitive, maximum stable allocations converge to proportional fairnessSojourn time asymptotics in processor-sharing queuesA survey on discriminatory processor sharingResource pooling in congested networks: Proportional fairness and product formFlow-level performance and capacity of wireless networks with user mobilityStability of Processor Sharing Networks with Simultaneous Resource RequirementsOn the spatially homogeneous landau equation for hard potentials part i : existence, uniqueness and smoothnessA two phase service \(M/G/1\) queue with a finite number of immediate Bernoulli feedbacksOpen problems in queueing theory inspired by datacenter computingFlow level convergence and insensitivity for multi-class queueing networksProportional fairness and its relationship with multi-class queueing networks







This page was built for publication: On stochastic bounds for monotonic processor sharing networks