Aggregation and Orthogonal Frequency Division Multiple Access (OFDMA) are two fundamental features allowing access points and stations to benefit from the high physical transmission rates of the recent WiFi standards. They aim to pool frames with a unique overhead (mainly the physical header and the acknowledgment) to mitigate its impact on the throughput. Natural implementations of these features lead to nonFIFO (First In, First Out) service disciplines that may generate unfairness between frames. In this paper, we evaluate three stateless service disciplines that require a low level of resources (computation and memory). We prove that when OFDMA does not introduce additional delay, one of these greedy algorithms minimizes the overhead. Whereas this service discipline maximizes the system capacity, it generates strong unfairness between the stations. Instead, the two other algorithms may offer a good trade-off between capacity and fairness. These algorithms are evaluated through a theoretical framework and simulations that replay actual Wi-Fi traces.

聚合和正交频分多址 (OFDMA) 是两个基本功能，允许接入点和站点受益于最新 WiFi 标准的高物理传输速率。他们的目标是通过独特的开销（主要是物理标头和确认）来池化帧，以减轻其对吞吐量的影响。这些功能的自然实现会导致非 FIFO（先进先出）服务规则，可能会在帧之间产生不公平。在本文中，我们评估了三种需要较低资源（计算和内存）的无状态服务规则。我们证明，当 OFDMA 不引入额外延迟时，这些贪婪算法之一可以最小化开销。虽然这种服务纪律最大限度地提高了系统容量，但它在站点之间产生了强烈的不公平性。相反，另外两种算法可能会在容量和公平性之间提供良好的权衡。这些算法通过理论框架和重放实际 Wi-Fi 轨迹的模拟进行评估。