Network stability under max-min fair bandwidth sharing
From MaRDI portal
Publication:988767
DOI10.1214/09-AAP649zbMath1208.60087arXiv1010.3142MaRDI QIDQ988767
Publication date: 18 August 2010
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.3142
stabilityLyapunov functionsbandwith sharingnon-exponential interarrival timesnon-exponential service timesweighted max-min fair policy
Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Internet topics (68M11)
Related Items (6)
A stability conjecture on bandwidth sharing networks ⋮ An information-theoretic characterization of weighted \(\alpha \)-proportional fairness in network resource allocation ⋮ Stability of join the shortest queue networks ⋮ 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 ⋮ Heavy-Traffic Insensitive Bounds for Weighted Proportionally Fair Bandwidth Sharing Policies
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy
- Fluid limits for networks with bandwidth sharing and general document size distributions
- Bandwidth sharing and admission control for elastic traffic
- Structural properties of proportional fairness: stability and insensitivity
- General Irreducible Markov Chains and Non-Negative Operators
- Stability of queueing networks
This page was built for publication: Network stability under max-min fair bandwidth sharing