Главная
Study mode:
on
1
Contention Resolution without Collision Detection
2
THE SETUP: A SHARED CHANNEL
3
FEEDBACK GIVEN TO THE PLAYERS
4
A CLASSIC PROBLEM: CONTENTION RESOLUTION
5
CONTENTION RESOLUTION FROM THE PERSPECTIVE OF EACH PLAYER
6
STATE OF THE ART: ASSUME COLLISION DETECTION
7
STATE OF THE ART: USE COLLISION DETECTION
8
EXP BACKOFF PROBLEM 2: CONTENTION
9
THE REST OF TALK: OUR ALGORITHM
10
BACKOFF IS GOOD AT: GETTING A SINGLE SUCCESS The Setup: On players arrive into system over time.
11
BACKOFF IS GOOD AT: SIMPLIFIED CONTENTION RESOLUTION Batch Players
12
SIMULATING TWO CHANNELS
13
THE ROLES OF THE CHANNELS
14
BASIC ALGORITHM STRUCTURE
15
BATCH PLAYERS ON THE ACTIVE CHANNEL
16
FRESH ARRIVALS: IDENTIFYING THE CHANNELS
17
WAITING ON THE SILENT CHANNEL
18
CHANGING THE CHANNEL ROLES
19
IMPORTANT PROBLEM: STRAGGLERS Problem: Strangles on the active channel take no long
20
PUTTING THE PIECES TOGETHER Theorem: There is an algorithm for contention resolution that
Description:
Explore contention resolution without collision detection in this ACM conference talk. Delve into the setup of a shared channel, feedback mechanisms for players, and the classic problem of contention resolution. Examine the state-of-the-art approaches assuming collision detection and using collision detection. Investigate exponential backoff for contention and discover a new algorithm that addresses the problem. Learn about simulating two channels, their roles, and the basic algorithm structure. Understand how to handle batch players, fresh arrivals, and the challenge of stragglers. Gain insights into an innovative algorithm for contention resolution that overcomes traditional limitations.

Contention Resolution without Collision Detection

Association for Computing Machinery (ACM)
Add to list
0:00 / 0:00