计算机网络中的自稳定自动重传请求算法
Self-Stabilizing Automatic Repeat Request Algorithms for (Bounded Capacity, Omitting, Duplicating and non-FIFO) Computer Networks
摘要：
网络层（或覆盖网络中的数据链路）上的端到端通信是每个通信网络（包括传统通信网络以及移动自组织网络、对等网络和网状网络）中最重要的通信任务之一。可靠的端到端通信基于自动重传请求（ARQ）算法，用于处理数据包失败，例如数据包丢失。我们研究ARQ算法，交换数据包提供（高层次）的消息在先进先出（FIFO）的顺序，没有遗漏或重复。我们提出了一种自稳定的ARQ算法，可应用于网络的有限容量，容易发生丢包，重复，和重新排序。我们的分析认为Lamport的发生之前的关系时，演示稳定，而不假设存在一个公平的调度程序。证明了对于任何系统运行，Lamport的happened-before关系的最长链的长度为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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
