Packet latency of deterministic broadcasting in adversarial multiple access channels

Anantharamu, Lakshmi, Chlebus, Bogdan S, Kowalski, Dariusz R ORCID: 0000-0002-1316-7788 and Rokicki, Mariusz A (2019) Packet latency of deterministic broadcasting in adversarial multiple access channels. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 99. pp. 27-52.

Text
1701.00186.pdf - Submitted version
Download (379kB) | Preview

Official URL: http://dx.doi.org/10.1016/j.jcss.2018.07.001

Abstract

We study broadcasting in multiple access channels with dynamic packet arrivals and jamming. Communication environments are represented by adversarial models that specify constraints on packet arrivals and jamming. We consider deterministic distributed broadcast algorithms and give upper bounds on the worst-case packet latency and the number of queued packets in relation to the parameters defining adversaries. Packet arrivals are determined by a rate of injections and a number of packets that can be generated in one round. Jamming is constrained by a rate with which an adversary can jam rounds and by a number of consecutive rounds that can be jammed.

Item Type:	Article
Uncontrolled Keywords:	Multiple access channel, Adversarial queuing, Jamming, Distributed algorithm, Deterministic algorithm, Packet latency, Queues size
Depositing User:	Symplectic Admin
Date Deposited:	27 Feb 2020 15:18
Last Modified:	18 Jan 2023 23:59
DOI:	10.1016/j.jcss.2018.07.001
Related URLs:	Author Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3076920