Analysis of the statistical time-access fairness index of one-bit feedback fair scheduler

DOI10.3934/NACO.2011.1.675zbMATH Open1239.93111OpenAlexW2323664983MaRDI QIDQ429002FDOQ429002

Fumio Ishizaki

Publication date: 25 June 2012

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/naco.2011.1.675

Recommendations

• Hard Fairness Versus Proportional Fairness in Wireless Communications: The Single-Cell Case
• How fair is fair queuing
• The proportional fairness scheduling algorithm on multi-classes
• A relative proportional fair scheduling scheme based on multi-user diversity
• A framework for opportunistic scheduling in wireless networks.

zbMATH Keywords

multiuser diversityone-bit feedback fair schedulershort term fairness

Mathematics Subject Classification ID

Information theory (general) (94A15) Applications of stochastic analysis (to PDEs, etc.) (60H30) Stochastic systems in control theory (general) (93E03) Stochastic learning and adaptive control (93E35) Stochastic scheduling theory in operations research (90B36)

Uses Software

• MCQueue

This page was built for publication: Analysis of the statistical time-access fairness index of one-bit feedback fair scheduler

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