Contention Resolution without Collision Detection

Contention Resolution without Collision Detection

Association for Computing Machinery (ACM) via YouTube Direct link

SIMULATING TWO CHANNELS

12 of 20

12 of 20

SIMULATING TWO CHANNELS

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Contention Resolution without Collision Detection

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Contention Resolution without Collision Detection
  2. 2 THE SETUP: A SHARED CHANNEL
  3. 3 FEEDBACK GIVEN TO THE PLAYERS
  4. 4 A CLASSIC PROBLEM: CONTENTION RESOLUTION
  5. 5 CONTENTION RESOLUTION FROM THE PERSPECTIVE OF EACH PLAYER
  6. 6 STATE OF THE ART: ASSUME COLLISION DETECTION
  7. 7 STATE OF THE ART: USE COLLISION DETECTION
  8. 8 EXP BACKOFF PROBLEM 2: CONTENTION
  9. 9 THE REST OF TALK: OUR ALGORITHM
  10. 10 BACKOFF IS GOOD AT: GETTING A SINGLE SUCCESS The Setup: On players arrive into system over time.
  11. 11 BACKOFF IS GOOD AT: SIMPLIFIED CONTENTION RESOLUTION Batch Players
  12. 12 SIMULATING TWO CHANNELS
  13. 13 THE ROLES OF THE CHANNELS
  14. 14 BASIC ALGORITHM STRUCTURE
  15. 15 BATCH PLAYERS ON THE ACTIVE CHANNEL
  16. 16 FRESH ARRIVALS: IDENTIFYING THE CHANNELS
  17. 17 WAITING ON THE SILENT CHANNEL
  18. 18 CHANGING THE CHANNEL ROLES
  19. 19 IMPORTANT PROBLEM: STRAGGLERS Problem: Strangles on the active channel take no long
  20. 20 PUTTING THE PIECES TOGETHER Theorem: There is an algorithm for contention resolution that

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.