Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2112.14655 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914815943901184 |
|---|---|
| author | Aldawsari, Bader A. Chlebus, Bogdan S. Kowalski, Dariusz R. |
| author_facet | Aldawsari, Bader A. Chlebus, Bogdan S. Kowalski, Dariusz R. |
| contents | We study deterministic distributed algorithms for broadcasting on multiple-access channels. Packet injection is modeled by leaky-bucket adversaries. There is a fixed set of stations attached to a channel. Additional features of the model of communication include an upper bound on the number of stations activated in a round, an individual injection rate, and randomness in generating and injecting packets. We demonstrate that some broadcast algorithms designed for ad-hoc channels have bounded latency for increased ranges of injection rates than in ad-hoc channels when executed on channels with a fixed number of stations against adversaries that can activate at most one station per round. Individual injection rates are shown to impact latency, as compared to the model of general leaky bucket adversaries. Outcomes of experiments are given that compare the performance of broadcast algorithms against randomized adversaries. The experiments include deterministic algorithms and randomized backoff algorithms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2112_14655 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Broadcasting on Adversarial Multiple Access Channels Aldawsari, Bader A. Chlebus, Bogdan S. Kowalski, Dariusz R. Distributed, Parallel, and Cluster Computing We study deterministic distributed algorithms for broadcasting on multiple-access channels. Packet injection is modeled by leaky-bucket adversaries. There is a fixed set of stations attached to a channel. Additional features of the model of communication include an upper bound on the number of stations activated in a round, an individual injection rate, and randomness in generating and injecting packets. We demonstrate that some broadcast algorithms designed for ad-hoc channels have bounded latency for increased ranges of injection rates than in ad-hoc channels when executed on channels with a fixed number of stations against adversaries that can activate at most one station per round. Individual injection rates are shown to impact latency, as compared to the model of general leaky bucket adversaries. Outcomes of experiments are given that compare the performance of broadcast algorithms against randomized adversaries. The experiments include deterministic algorithms and randomized backoff algorithms. |
| title | Broadcasting on Adversarial Multiple Access Channels |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2112.14655 |