Heavy-Traffic Insensitive Bounds for Weighted Proportionally Fair Bandwidth Sharing Policies
DOI10.1287/moor.2021.1225OpenAlexW4226392070MaRDI QIDQ5870352
No author found.
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
phase-type distributionsstate-space collapsebandwidth sharingheavy-traffic analysisdrift methodweighted proportionally fair sharing
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Public goods (91B18) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Asymptotically tight steady-state queue length bounds implied by drift conditions
- Insensitive, maximum stable allocations converge to proportional fairness
- State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy
- Network stability under max-min fair bandwidth sharing
- Reflected Brownian motion with skew symmetric data in a polyhedral domain
- Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse
- State space collapse with application to heavy traffic limits for multiclass queueing networks
- Insensitive bandwidth sharing in data networks
- Multidimensional reflected Brownian motions having exponential stationary distributions
- Bandwidth sharing and admission control for elastic traffic
- Performance of multiclass Markovian queueing networks via piecewise linear Lyapunov functions
- Diffusion approximation for a processor sharing queue in heavy traffic.
- Qualitative properties of \(\alpha\)-fair policies in bandwidth-sharing networks
- Structural properties of proportional fairness: stability and insensitivity
- Diffusion Limit of Fair Resource Control—Stationarity and Interchange of Limits
- Queue Length Behavior in a Switch under the MaxWeight Algorithm
- Fluid Model for a Data Network with α -Fair Bandwidth Sharing and General Document Size Distributions: Two Examples of Stability
- Hitting-time and occupation-time bounds implied by drift analysis with applications
- A Stochastic Network Under Proportional Fair Resource Control—Diffusion Limit with Multiple Bottlenecks
- Applied Probability and Queues
- Stability of a Subcritical Fluid Model for Fair Bandwidth Sharing with General File Size Distributions
- Network Stability Under Alpha Fair Bandwidth Allocation With General File Size Distribution
- Queue-Length Distribution for the Discriminatory Processor-Sharing Queue
This page was built for publication: Heavy-Traffic Insensitive Bounds for Weighted Proportionally Fair Bandwidth Sharing Policies
