Remembering to be fair: non-Markovian fairness in sequential decision making
Abstract
References
Index Terms
- Remembering to be fair: non-Markovian fairness in sequential decision making
Recommendations
T2-fair: a two-tiered time and throughput fair scheduler for multi-rate WLANs
MSWiM '06: Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systemsLow throughput due to unfairness is a key problem in multi-rate wireless local area networks. To promote fairness and hence throughput, T2-Fair groups flows according to their average data rate, provides each group fair time allocations and ensures ...
Can CSMA/CA networks be made fair?
MobiCom '08: Proceedings of the 14th ACM international conference on Mobile computing and networkingWe demonstrate that CSMA/CA networks, including IEEE 802.11 networks, exhibit severe fairness problem in many scenarios, where some hosts obtain most of the channel's bandwidth while others starve. Most existing solutions require nodes to overhear ...
Proportional fair throughput allocation in multirate IEEE 802.11e wireless LANs
Under heterogeneous radio conditions, Wireless LAN stations may use different modulation schemes, leading to a heterogeneity of bit rates. In such a situation, 802.11 DCF allocates the same throughput to all stations independently of their transmitting ...
Comments
Information & Contributors
Information
Published In
Publisher
JMLR.org
Publication History
Qualifiers
- Research-article
- Research
- Refereed limited
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0