Self-Stabilizing Automatic Repeat Request Algorithms for (Bounded Capacity, Omitting, Duplicating and non-FIFO) Computer Networks

TL;DR

This paper introduces a self-stabilizing ARQ algorithm designed for bounded capacity networks, capable of handling packet loss, duplication, and reordering, ensuring reliable FIFO message delivery without assuming fair scheduling.

Contribution

The paper presents a novel self-stabilizing ARQ algorithm for networks with bounded capacity, addressing packet loss, duplication, and reordering without fairness assumptions.

Findings

Stabilization occurs within a chain length of 8 in Lamport's happened-before relation.

The algorithm guarantees reliable FIFO message delivery in networks with packet issues.

Analysis does not rely on fair scheduler assumptions.

Abstract

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.