Computer networks
Measured performance of an Ethernet local network
Communications of the ACM
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
Some Theorems on the Instability of the Exponential Back-Off Protocol
Performance '84 Proceedings of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation
Analysis of backoff protocols for multiple access channels
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
SIGMETRICS '87 Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Stability of binary exponential backoff
Journal of the ACM (JACM)
On the complexity of radio communication
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Stochastic contention resolution with short delays
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
WOWMOM '98 Proceedings of the 1st ACM international workshop on Wireless mobile multimedia
The wakeup problem in synchronous broadcast systems (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
A distributed mechanism for power saving in IEEE 802.11 wireless LANs
Mobile Networks and Applications
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Runtime Optimization of IEEE 802.11 Wireless LANs Performance
IEEE Transactions on Parallel and Distributed Systems
Faster deterministic wakeup in multiple access channels
Discrete Applied Mathematics
Faster deterministic wakeup in multiple access channels
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Hi-index | 0.00 |
We consider the stochastic behavior of binary exponential backoff, a probabilistic algorithm for regulating transmissions on a multiple access channel. Ethernet, a local area network, is built upon this algorithm. The fundamental theoretical issue is stability: does the backlog of packets awaiting transmission remain bounded in time, provided the rates of new packet arrivals are small enough?We present a realistic model of n ≥ 2 stations communicating over the channel. Our main result is to establish that the algorithm is stable if the sum of the arrival rates is sufficiently small. We report detailed results on which rates lead to stability when n = 2 stations share the channel. In passing we derive several other results bearing on the efficiency of the conflict resolution process. Lastly, we report results from a simulation study, which, in particular, indicate alternative retransmission strategies can significantly improve performance.