TY - GEN
T1 - Brief announcement
T2 - 32nd International Symposium on Distributed Computing, DISC 2018
AU - De Marco, Gianluca
AU - Kowalski, Dariusz R.
AU - Stachowiak, Grzegorz
PY - 2018/10/1
Y1 - 2018/10/1
N2 - 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.
AB - 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.
KW - Distributed algorithm
KW - Multiple-access channel
KW - Shared channel
UR - http://www.scopus.com/inward/record.url?scp=85059614080&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85059614080&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.DISC.2018.44
DO - 10.4230/LIPIcs.DISC.2018.44
M3 - Conference contribution
AN - SCOPUS:85059614080
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 32nd International Symposium on Distributed Computing, DISC 2018
A2 - Schmid, Ulrich
A2 - Widder, Josef
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Y2 - 15 October 2018 through 19 October 2018
ER -