Heavy-Traffic Insensitive Bounds for Weighted Proportionally Fair Bandwidth Sharing Policies

DOI10.1287/MOOR.2021.1225MaRDI QIDQ5870352OpenAlexFDO

Authors

Publication date 9 January 2023

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1808.02120

zbMATH Keywords

phase-type distributionsstate-space collapsebandwidth sharingheavy-traffic analysisdrift methodweighted proportionally fair sharing

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Public goods (91B18)

Recommendations

• State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy
• Fluid model for a network operating under a fair bandwidth-sharing policy.
• Qualitative properties of \(\alpha\)-fair policies in bandwidth-sharing networks
• Network stability under max-min fair bandwidth sharing
• Structural properties of proportional fairness: stability and insensitivity

Cites work

• scientific article; zbMATH DE number 3426516 (Why is no real title available?)
• scientific article; zbMATH DE number 47820 (Why is no real title available?)
• A Stochastic Network Under Proportional Fair Resource Control—Diffusion Limit with Multiple Bottlenecks
• Applied Probability and Queues
• Asymptotically tight steady-state queue length bounds implied by drift conditions
• Bandwidth sharing and admission control for elastic traffic
• Diffusion approximation for a processor sharing queue in heavy traffic.
• Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse
• Diffusion limit of fair resource control -- stationarity and interchange of limits
• Fluid Model for a Data Network with α -Fair Bandwidth Sharing and General Document Size Distributions: Two Examples of Stability
• Heavy traffic queue length behavior in a switch under the MaxWeight algorithm
• Hitting-time and occupation-time bounds implied by drift analysis with applications
• Insensitive bandwidth sharing in data networks
• Insensitive, maximum stable allocations converge to proportional fairness
• Multidimensional reflected Brownian motions having exponential stationary distributions
• Network Stability Under Alpha Fair Bandwidth Allocation With General File Size Distribution
• Network stability under max-min fair bandwidth sharing
• Performance of multiclass Markovian queueing networks via piecewise linear Lyapunov functions
• Qualitative properties of \(\alpha\)-fair policies in bandwidth-sharing networks
• Queue-Length Distribution for the Discriminatory Processor-Sharing Queue
• Reflected Brownian motion with skew symmetric data in a polyhedral domain
• Stability of a Subcritical Fluid Model for Fair Bandwidth Sharing with General File Size Distributions
• State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy
• State space collapse with application to heavy traffic limits for multiclass queueing networks
• Structural properties of proportional fairness: stability and insensitivity

Cited in

(3)

• Quality-of-service guarantees architecture with weighted fair shaping
• Comparison of stability regions for a line distribution network with stochastic load demands
• A load balancing system in the many-server heavy-traffic asymptotics

This page was built for publication: Heavy-Traffic Insensitive Bounds for Weighted Proportionally Fair Bandwidth Sharing Policies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5870352)