TY - GEN
T1 - Contention resolution on a restrained channel
AU - Hradovich, Elijah
AU - Klonowski, Marek
AU - Kowalski, Dariusz R.
N1 - Publisher Copyright:
© 2020 IEEE.
PY - 2020/12
Y1 - 2020/12
N2 - We examine deterministic contention resolution on a multiple-access channel when packets are injected continuously by an adversary to the buffers of n available stations in the system, arbitrarily at rate at most ? packets per round. The aim is to successfully transmit packets and maintain system stability, that is, bounded queues, even in infinite executions. The largest injection rate for which a given contention resolution algorithm guaranties stability is called (algorithm's) throughput. In contrast to the previous work, we consider a channel in which there is a strict limit k on the total number of stations allowed to transmit or listen to the channel at a given time, that can never be exceeded; we call such channel a k-restrained channel. We construct adaptive and full sensing protocols with optimal throughput 1 and almost optimal throughput 1-1/n, respectively, in a constant-restrained channel. By contrast, we show that restricted protocols based on schedules known in advance obtain throughput at most k n, 1{3 n. We also support our theoretical analysis by simulation results of our algorithms in systems of moderate, realistic sizes and scenarios, and compare them with popular backoff protocols.
AB - We examine deterministic contention resolution on a multiple-access channel when packets are injected continuously by an adversary to the buffers of n available stations in the system, arbitrarily at rate at most ? packets per round. The aim is to successfully transmit packets and maintain system stability, that is, bounded queues, even in infinite executions. The largest injection rate for which a given contention resolution algorithm guaranties stability is called (algorithm's) throughput. In contrast to the previous work, we consider a channel in which there is a strict limit k on the total number of stations allowed to transmit or listen to the channel at a given time, that can never be exceeded; we call such channel a k-restrained channel. We construct adaptive and full sensing protocols with optimal throughput 1 and almost optimal throughput 1-1/n, respectively, in a constant-restrained channel. By contrast, we show that restricted protocols based on schedules known in advance obtain throughput at most k n, 1{3 n. We also support our theoretical analysis by simulation results of our algorithms in systems of moderate, realistic sizes and scenarios, and compare them with popular backoff protocols.
KW - Adversarial queueing
KW - Contention resolution
KW - Multiple-access channel
KW - Restrained channel
KW - Stability
KW - Throughput
UR - http://www.scopus.com/inward/record.url?scp=85102346066&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85102346066&partnerID=8YFLogxK
U2 - 10.1109/ICPADS51040.2020.00022
DO - 10.1109/ICPADS51040.2020.00022
M3 - Conference contribution
AN - SCOPUS:85102346066
T3 - Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS
SP - 89
EP - 98
BT - Proceedings - 2020 IEEE 26th International Conference on Parallel and Distributed Systems, ICPADS 2020
PB - IEEE Computer Society
T2 - 26th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2020
Y2 - 2 December 2020 through 4 December 2020
ER -