Low latency allcast over broadcast erasure channels

Mark  Graham; A J Ganesh; Robert J Piechocki

doi:10.1109/TIT.2022.3219773

Low latency allcast over broadcast erasure channels

Mark Graham, A J Ganesh^*, Robert J Piechocki

^*Corresponding author for this work

Research output: Contribution to journal › Article (Academic Journal) › peer-review

13 Downloads (Pure)

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.

Original language	English
Article number	9939015
Pages (from-to)	1604 - 1617
Journal	Information Theory, IEEE Transactions on
Volume	69
Issue number	3
DOIs	https://doi.org/10.1109/TIT.2022.3219773
Publication status	Published - 4 Nov 2022

Access to Document

10.1109/TIT.2022.3219773

Full-text PDF (accepted manuscript)
This is the accepted author manuscript (AAM). The final published version (Version of Record) can be found on the publisher's website. The copyright of any third-party content, such as images, remains with the copyright holder.
Accepted author manuscript, 494 KBLicence: Unspecified

https://arxiv.org/abs/2107.10695

Handle.net

Persistent link

Cite this

@article{cd8337e87a14463a85b9c1ac5d688357,

title = "Low latency allcast over broadcast erasure channels",

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.",

author = "Mark Graham and Ganesh, {A J} and Piechocki, {Robert J}",

year = "2022",

month = nov,

day = "4",

doi = "10.1109/TIT.2022.3219773",

language = "English",

volume = "69",

pages = "1604 -- 1617",

journal = "Information Theory, IEEE Transactions on",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

number = "3",

}

TY - JOUR

T1 - Low latency allcast over broadcast erasure channels

AU - Graham, Mark

AU - Ganesh, A J

AU - Piechocki, Robert J

PY - 2022/11/4

Y1 - 2022/11/4

N2 - 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.

AB - 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.

U2 - 10.1109/TIT.2022.3219773

DO - 10.1109/TIT.2022.3219773

M3 - Article (Academic Journal)

VL - 69

SP - 1604

EP - 1617

JO - Information Theory, IEEE Transactions on

JF - Information Theory, IEEE Transactions on

IS - 3

M1 - 9939015

ER -

Low latency allcast over broadcast erasure channels

Abstract

Access to Document

Handle.net

Fingerprint

Cite this