Truncated binary exponential backoff: Difference between revisions

Content deleted Content added
rem possibly confusing notation
fix spacing
Line 11:
Given a [[uniform distribution (discrete)|uniform distribution]] of backoff times, the [[expected value|expected]] backoff time is the mean of the possibilities. That is, after ''n'' collisions, the number of backoff slots is in <math>[0, 1, ..., N]</math> where <math>N = 2^c-1</math> and the expected backoff time (in slots) is <math>\frac{1}{N+1}\sum_{i=0}^{N} i</math>.
 
For example, the expected backoff time for the 3rd (''c = 3'') collision, one could first calculate the maximum backoff time, ''N'':
:<math>N = 2^c - 1</math>
:<math>N = 2^3 - 1 = 8 - 1</math>