Name
Abstract | ||
|---|---|---|
In the contention-resolution problem, multiple players contend for access to a shared resource. Contention resolution is used in wireless networks, where messages must be transmitted on a shared communication channel. When two or more messages are transmitted at the same time, a collision occurs, and none of the transmissions succeed. Much of the theoretical work on contention resolution has focused on efficiently resolving collisions in order to obtain throughput guarantees.
However, in modern-day networks, not all traffic is treated equally. Instead, messages are often handled according to a notion of priority. While throughput remains an important metric, it fails to capture this increasingly-common scenario of traffic prioritization.
Motivated by this concern, we design a contention-resolution algorithm where messages have delivery deadlines. Unit-length messages dynamically arrive over time, each with a corresponding delivery deadline that demarcates a window of time wherein the message must be transmitted successfully. We consider inputs that have a feasible schedule, even if message sizes increase by a constant factor. In this setting, we provide an algorithm which guarantees that each message succeeds by its deadline with high probability in its window size.
|
Year | DOI | Venue |
|---|---|---|
2020 | 10.1145/3350755.3400239 | SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures
Virtual Event
USA
July, 2020 |
DocType | ISBN | Citations |
Conference | 978-1-4503-6935-0 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kunal Agrawal | 1 | 687 | 50.08 |
| Michael A. Bender | 2 | 2144 | 138.24 |
| Jeremy T. Fineman | 3 | 587 | 36.10 |
| Seth Gilbert | 4 | 1413 | 94.72 |
| Maxwell Young | 5 | 210 | 17.86 |