An information-theoretic characterization of weighted \(\alpha \)-proportional fairness in network resource allocation

DOI10.1016/J.INS.2011.05.001zbMath1242.90036OpenAlexW1988775774MaRDI QIDQ433054

Jim Kurose, Masato Uchida

Publication date: 13 July 2012

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2011.05.001

zbMATH Keywords

information divergence measurestrade-off between user and network satisfactionweighted \(\alpha \)-proportional fairness

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Measures of information, entropy (94A17)

Related Items (2)

An information-theoretic characterization of weighted \(\alpha \)-proportional fairness in network resource allocation ⋮ Decentralized algorithm for centralized variational inequalities in network resource allocation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An information-theoretic characterization of weighted \(\alpha \)-proportional fairness in network resource allocation
• Per-stream loss behavior of \(\Sigma \)MAP/M/1/K queuing system with a random early detection mechanism
• Network stability under max-min fair bandwidth sharing
• The mathematics of internet congestion control
• Possible generalization of Boltzmann-Gibbs statistics.
• Resource pooling in congested networks: Proportional fairness and product form
• Structural properties of proportional fairness: stability and insensitivity
• A queueing analysis of max-min fairness, proportional fairness and balanced fairness
• Rate control for communication networks: shadow prices, proportional fairness and stability
• Opportunistic beamforming using dumb antennas

This page was built for publication: An information-theoretic characterization of weighted \(\alpha \)-proportional fairness in network resource allocation