Low latency allcast over broadcast erasure channels

TL;DR

This paper analyzes the efficiency of two broadcasting schemes, random relaying and random linear network coding, for allcast over unreliable broadcast channels as the number of nodes grows large.

Contribution

It provides an asymptotic analysis of the performance of these schemes and compares their effectiveness in large networks.

Findings

Random linear network coding outperforms random relaying in large networks.

Both schemes' performance improves as the number of nodes increases.

Simulation results validate the asymptotic analysis across various network sizes.

Abstract

Consider n nodes communicating over an unreliable broadcast channel. Each node has a single packet that needs to be communicated to all other nodes. Time is slotted, and a time slot is long enough for each node to broadcast one packet. Each broadcast reaches a random subset of nodes. The objective is to minimise the time until all nodes have received all packets. We study two schemes, (i) random relaying, and (ii) random linear network coding, and analyse their performance in an asymptotic regime in which n tends to infinity. Simulation results for a wide range of n are also presented.