Dynamic Packet Aggregation to Solve Performance Anomaly in 802.11 Wireless Networks
Tahiry Razafindralambo, Isabelle Guérin-Lassous, Luigi Iannone, Serge Fdida
Abstract
In the widely used 802.11 standard, the so called performance anomaly is a well known issue. Several works have tried to solve this problem by introducing mechanisms such as packet fragmentation, backoff adaptation, or packet aggregation during a fixed time interval. In this paper, we propose a novel approach solving the performance anomaly problem by packet aggregation using a dynamic time interval, which depends on the busy time of the wireless medium. Our solution differs from other proposition in the literature because of this dynamic time interval, which allows increasing fairness, reactivity, and in some cases efficiency. In this article, we emphasize the performance evaluation of our proposal.
Create a lesson
Related papers
FaulT-Bench: Towards Benchmarking Network Troubleshooting LLM Agents under Unreliable User Tickets
Kuan-Hao Tseng, Niruth Bogahawatta, Yasod Ginige et al.
Claude Code Complete User Handbook
David Soldani
Extending Low Latency Service Across the Internet
Harkirat Singh, Fatih Berkay Sarpkaya, Hakan Gulec et al.
SFC-Aware Online Aggregated Data-Link Orchestration for SDN/NFV-Enabled SAGINs
Ziyang Guo, Bing Du
PRO-RAN: Processor-Level Characterization of Open RAN Centralized and Distributed Units
Moojan Kamalzadeh, Larry Horner, Linqi Xiao et al.
SlimTCP: It's fast, but not because it's slim
Mihai Drosi Caju, Costin Raiciu