Low Latency Allcast Over Broadcast Erasure Channels
From MaRDI portal
Publication:6153501
DOI10.1109/TIT.2022.3219773arXiv2107.10695OpenAlexW3185785629MaRDI QIDQ6153501FDOQ6153501
Ayalvadi J. Ganesh, Robert J. Piechocki, Author name not available (Why is that?)
Publication date: 19 March 2024
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2107.10695
This page was built for publication: Low Latency Allcast Over Broadcast Erasure Channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6153501)
