Brief announcement: Deterministic contention resolution on a shared channel

Gianluca De Marco, Dariusz R. Kowalski, Grzegorz Stachowiak

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

A shared channel, also called multiple-access channel, is one of the fundamental communication models. Autonomous entities communicate over a shared medium, and one of the main challenges is how to efficiently resolve collisions occurring when more than one entity attempts to access the channel at the same time. In this work we explore the impact of asynchrony, knowledge (or linear estimate) of the number of contenders, and acknowledgments, on both latency and channel utilization for the Contention resolution problem with non-adaptive deterministic algorithms.

Original languageEnglish (US)
Title of host publication32nd International Symposium on Distributed Computing, DISC 2018
EditorsUlrich Schmid, Josef Widder
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770927
DOIs
StatePublished - Oct 1 2018
Externally publishedYes
Event32nd International Symposium on Distributed Computing, DISC 2018 - New Orleans, United States
Duration: Oct 15 2018Oct 19 2018

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume121
ISSN (Print)1868-8969

Conference

Conference32nd International Symposium on Distributed Computing, DISC 2018
Country/TerritoryUnited States
CityNew Orleans
Period10/15/1810/19/18

Keywords

  • Distributed algorithm
  • Multiple-access channel
  • Shared channel

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Brief announcement: Deterministic contention resolution on a shared channel'. Together they form a unique fingerprint.

Cite this