Content deleted Content added
fix math error |
wikilink inclusive to Interval (mathematics) |
||
Line 5:
Examples are the retransmission of [[data frame|frames]] in [[carrier sense multiple access with collision avoidance]] (CSMA/CA) and [[carrier sense multiple access with collision detection]] (CSMA/CD) networks, where this algorithm is part of the channel access method used to send data on these network. In [[Ethernet]] networks, the algorithm is commonly used to schedule retransmissions after collisions. The retransmission is delayed by an amount of [[time]] derived from the [[slot time]] and the number of attempts to retransmit.
After ''c'' collisions, a random number of slot times, ''n'', between 0 and <math>2^c-1</math> is chosen. For the first collision, each sender will wait 0 or 1 slot times. After the second collision, the senders will wait anywhere from 0 to 3 slot times ([[Interval (mathematics)|inclusive]]). After the third collision, the senders will wait anywhere from 0 to 7 slot times (inclusive), and so forth. As the number of retransmission attempts increases, the number of possibilities for delay [[exponential growth|increases exponentially]].
The 'truncated' simply means that after a certain number of increases, the exponentiation stops; i.e. the retransmission timeout reaches a ceiling, and thereafter does not increase any further. For example, if the ceiling is set at ''i''=10 (as it is in the [[IEEE 802.3]] CSMA/CD standard<ref name="IEEE_802_3">{{cite web|title=IEEE Standard 802.3-2008|url=http://standards.ieee.org/getieee802/download/802.3-2008_section1.pdf|publisher=IEEE|accessdate=22 September 2010}}</ref>), then the maximum delay is 1023 slot times.
| |||