After failures, a transmitter increases its random retry window by a multiplicative factor, so its access behavior depends on its collision history. This reduces immediate repeated contention, but its stability and delay properties depend on the exact rule and traffic model.
After collisions a packet chooses an independent counter uniformly from and retries when it expires. The window doubles after a further collision. This is an example of exponential backoff with a nonconstant retry rule, contrasting with constant-probability slotted ALOHA.
Articles by others on the same topic
Exponential backoff is a strategy used in network protocols and other systems to manage retries after a failure, particularly in situations where a resource is temporarily unavailable. The basic idea is to wait progressively longer intervals between successive attempts to perform an operation (such as sending a network request) after each failure, up to a predefined maximum time or retry limit.