Buffer Sizing for 802.11 Based Networks
Tianji Li, Douglas Leith, David Malone

TL;DR
This paper introduces two dynamic buffer sizing algorithms for 802.11 wireless networks that optimize throughput and delay, addressing the limitations of fixed buffer sizes in such environments.
Contribution
The paper proposes novel adaptive buffer sizing algorithms specifically designed for 802.11 networks, improving performance over fixed buffer strategies.
Findings
Algorithms achieve high throughput across various conditions.
Experimental results validate effectiveness in real WLANs.
Low delay maintained with dynamic buffer adjustment.
Abstract
We consider the sizing of network buffers in 802.11 based networks. Wireless networks face a number of fundamental issues that do not arise in wired networks. We demonstrate that the use of fixed size buffers in 802.11 networks inevitably leads to either undesirable channel under-utilization or unnecessary high delays. We present two novel dynamic buffer sizing algorithms that achieve high throughput while maintaining low delay across a wide range of network conditions. Experimental measurements demonstrate the utility of the proposed algorithms in a production WLAN and a lab testbed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
