带K指数回退的缓冲Aloha--第一部分：稳定性和吞吐量分析
Buffered Aloha with K-Exponential Backoff -- Part I: Stability and Throughput Analysis
摘要：
这篇由两部分组成的论文系列研究了缓冲Aloha网络与K指数退避冲突解决算法的性能。第一部分着重于稳定性和吞吐量分析，第二部分介绍了延迟分析。在第一部分中，缓冲Aloha网络被建模为多队列单服务器系统。我们采用了一种广泛使用的方法在分组交换系统中的多队列系统分解成独立的先进先出（FIFO）队列，这是铰接在一起的头的线（HOL）数据包的成功概率。针对任意截止相位K的K指数退避算法的稳定性和吞吐量问题，提出了一种统一的解决方法。我们证明了一个网络与K-指数回退可以稳定，如果重传因子q是适当的选择。通过几何重传（K=1）和指数回退（K=无穷大）的示例来表征和说明q的稳定区域。随着节点数n的增加，几何重传的稳定区域迅速缩小，并随着n趋于无穷大而消失。相反，指数退避的稳定区域不随网络种群n而变化，这意味着即使具有无限数量的节点，在具有指数退避的网络中也可以实现稳定的吞吐量。所有的分析结果，在这一系列的文件中提出了验证模拟。
英文摘要：
This two-part paper series studies the performance of buffered Aloha networks with K-Exponential Backoff collision resolution algorithms. Part I focuses on stability and throughput analysis and Part II presents the delay analysis. In Part I, the buffered Aloha network is modeled as a multi-queue single-server system. We adopt a widely used approach in packet switching systems to decompose the multi-queue system into independent first-in-first-out (FIFO) queues, which are hinged together by the probability of success of head-of-line (HOL) packets. A unified method is devised to tackle the stability and throughput problems of K-Exponential Backoff with any cutoff phase K. We demonstrate that a network with K-Exponential Backoff can be stabilized if the retransmission factor q is properly selected. The stable region of q is characterized and illustrated via examples of Geometric Retransmission (K=1) and Exponential Backoff (K=infinity). With an increasing number of nodes n, we show that the stable region of Geometric Retransmission rapidly shrinks, and vanishes as n goes to infinity. In contrast, the stable region of Exponential Backoff does not vary with the network population n, implying that a stable throughput can be achieved in networks with Exponential Backoff even with an infinite number of nodes. All the analytical results presented in this paper series are verified by simulations.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
