论文标题
自动化自动重复请求算法（有界容量，省略，重复和非FIFO）计算机网络
Self-Stabilizing Automatic Repeat Request Algorithms for (Bounded Capacity, Omitting, Duplicating and non-FIFO) Computer Networks
论文作者
论文摘要
网络层（或覆盖网络中的数据链接）上的端到端通信是每个通信网络中最重要的通信任务之一，包括传统通信网络以及移动临时网络，点对点网络和网络网络。可靠的端到端通信基于用于处理数据包故障的自动重复请求（ARQ）算法，例如数据包下降。我们研究ARQ算法，这些算法将数据包交换以在不遗漏或重复的情况下以第一届第一（FIFO）订单传递（高水平）消息。我们提出了一种自动化的ARQ算法，该算法可应用于容易丢失，重复和重新排序的有界能力网络。我们的分析考虑了Lamport在不存在公平调度程序的情况下证明稳定时的关系之前发生的。它表明，对于任何系统运行，最长的Lamport链的长度为8。
End-to-end communication over the network layer (or data link in overlay networks) is one of the most important communication tasks in every communication network, including legacy communication networks as well as mobile ad hoc networks, peer-to-peer networks, and mesh networks. Reliable end-to-end communications are based on Automatic Repeat reQuest (ARQ) algorithms for dealing with packet failures, such as packet drops. We study ARQ algorithms that exchange packets to deliver (high level) messages in first-in-first-out (FIFO) order without omissions or duplications. We present a self-stabilizing ARQ algorithm that can be applied to networks of bounded capacity that are prone to packet loss, duplication, and reordering. Our analysis considers Lamport's happened-before relation when demonstrating stabilization without assuming the presence of a fair scheduler. It shows that the length of the longest chain of Lamport's happened-before relation is 8 for any system run.
