 exponential backoff is an algorithm that uses feedback to multiplicatively decrease the rate of some process, in order to gradually find an acceptable rate. ==binary exponential backoff / truncated exponential backoff== in a variety of computer networks, binary exponential backoff or truncated binary exponential backoff refers to an algorithm used to space out repeated retransmissions of the same block of data, often as part of network congestion avoidance. examples are the retransmission of 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 networks. 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 between 0 and 2c - 1 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 (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 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), then the maximum delay is 1023 slot times. because these delays cause other stations that are sending to collide as well, there is a possibility that, on a busy network, hundreds of people may be caught in a single collision set. because of this possibility, the process is aborted after 16 attempts at transmission. ==an example of an exponential back-off algorithm== this example is from the ethernet protocol,computer networks, peterson and davie where a sending host is able to know when a collision has occurred (that is, another host has tried to transmit), when it is sending a frame. if both hosts attempted to re-transmit as soon as a collision occurred, there would be yet another collision &mdash; and the pattern would continue forever. the hosts must choose a random value within an acceptable range to ensure that this situat
Ethernet Networking_algorithms