TY - GEN
T1 - WQM: An Aggregation-aware Queue Management Scheme for IEEE 802.11n based Networks
AU - Showail, Ahmad
AU - Jamshaid, Kamran
AU - Shihada, Basem
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2014/8/12
Y1 - 2014/8/12
N2 - Choosing the right buffer size in Wi-Fi networks is challenging due to the dynamic nature of the wireless environment. Over buffering or 'bufferbloat' may produce unacceptable end-to-end delays, while static small buffers may limit the performance gains that can be achieved with various 802.11n enhancements, such as frame aggregation. We propose WQM, a queue management scheme customized for wireless networks. WQM adapts the buffer size based on measured link characteristics and network load. Furthermore, it accounts for aggregate length when deciding about the optimal buffer size. We implement WQM on Linux and evaluate it on a wireless testbed. WQM reduces the end-to-end delay by up to 8x compared to Linux default buffer size, and 2x compared to CoDel, the state-of-the-art bufferbloat solution, while achieving comparable network goodput. Further, WQM improves fairness as it limits the ability of a single flow to saturate the buffer.
AB - Choosing the right buffer size in Wi-Fi networks is challenging due to the dynamic nature of the wireless environment. Over buffering or 'bufferbloat' may produce unacceptable end-to-end delays, while static small buffers may limit the performance gains that can be achieved with various 802.11n enhancements, such as frame aggregation. We propose WQM, a queue management scheme customized for wireless networks. WQM adapts the buffer size based on measured link characteristics and network load. Furthermore, it accounts for aggregate length when deciding about the optimal buffer size. We implement WQM on Linux and evaluate it on a wireless testbed. WQM reduces the end-to-end delay by up to 8x compared to Linux default buffer size, and 2x compared to CoDel, the state-of-the-art bufferbloat solution, while achieving comparable network goodput. Further, WQM improves fairness as it limits the ability of a single flow to saturate the buffer.
UR - http://hdl.handle.net/10754/362482
UR - http://dl.acm.org/citation.cfm?doid=2630088.2630097
UR - http://www.scopus.com/inward/record.url?scp=84907313302&partnerID=8YFLogxK
U2 - 10.1145/2630088.2630097
DO - 10.1145/2630088.2630097
M3 - Conference contribution
SN - 9781450329910
SP - 15
EP - 20
BT - Proceedings of the 2014 ACM SIGCOMM workshop on Capacity sharing workshop - CSWS '14
PB - Association for Computing Machinery (ACM)
ER -