论文标题
WiFi的窗户退缩算法：批处理到达下的理论和性能
Windowed Backoff Algorithms for WiFi: Theory and Performance under Batched Arrivals
论文作者
论文摘要
二进制指数向后（BEB）是一种数十年历史的算法，用于协调访问共享渠道。在现代网络中，BEB在WiFi（IEEE 802.11）和其他无线通信标准中起着重要作用。 尽管有这样的记录，但众所周知的理论结果表明，在爆发的交通情况下，BEB产生了较差的制造物，并且可以进行上级算法。迄今为止，尚未检查这些发现影响无线网络中的性能的程度。 为了解决此问题，我们研究了针对BEB的最强案例之一：一批爆发的数据包，同时竞争访问无线通道的数据包。使用网络模拟器3，我们将其纳入IEEE 802.11G中，几种较新的算法虽然受BEB的启发，但它具有理论上优越的MakePAN保证。令人惊讶的是，我们发现这些较新的算法表现不佳。 进一步研究，我们认为罪魁祸首是关于碰撞成本的共同抽象。我们的实验结果得到了分析论证的补充：碰撞的数量（而不是仅仅是使PAN）是优化的重要指标。我们认为这些发现对无线网络中的退缩算法的设计有影响。
Binary exponential backoff (BEB) is a decades-old algorithm for coordinating access to a shared channel. In modern networks, BEB plays an important role in WiFi (IEEE 802.11) and other wireless communication standards. Despite this track record, well-known theoretical results indicate that under bursty traffic BEB yields poor makespan, and superior algorithms are possible. To date, the degree to which these findings impact performance in wireless networks has not been examined. To address this issue, we investigate one of the strongest cases against BEB: a single burst batch of packets that simultaneously contend for access to a wireless channel. Using Network Simulator 3, we incorporate into IEEE 802.11g several newer algorithms that, while inspired by BEB, possess makespan guarantees that are theoretically superior. Surprisingly, we discover that these newer algorithms underperform BEB. Investigating further, we identify as the culprit a common abstraction regarding the cost of collisions. Our experimental results are complemented by analytical arguments that the number of collisions - and not solely makespan - is an important metric to optimize. We argue that these findings have implications for the design of backoff algorithms in wireless networks.
