Scaling exponential backoff: constant throughput, polylogarithmic channel-access attempts, and robustness (Q4625672)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7029236
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scaling exponential backoff: constant throughput, polylogarithmic channel-access attempts, and robustness |
scientific article; zbMATH DE number 7029236 |
Statements
Scaling Exponential Backoff (English)
0 references
25 February 2019
0 references
exponential backoff
0 references
adversarial scheduling
0 references
contention resolution
0 references
distributed computing
0 references
jamming attacks
0 references
robustness
0 references
throughput
0 references
wireless networks
0 references
0.9859268069267272
0 references
0.8596408367156982
0 references
0.8401725888252258
0 references
0.7837390303611755
0 references
