IEEE Transactions on Information Theory
Stability of binary exponential backoff
Journal of the ACM (JACM)
Analysis of Backoff Protocols for Mulitiple AccessChannels
SIAM Journal on Computing
Analysis of practical backoff protocols for contention resolution with multiple servers
Journal of Computer and System Sciences
Contention resolution with constant expected delay
Journal of the ACM (JACM)
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
Performance analysis of exponential backoff
IEEE/ACM Transactions on Networking (TON)
THE ALOHA SYSTEM: another alternative for computer communications
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
IEEE Transactions on Information Theory
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
Ranging code collision probability in OFDMA based BWA network
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 3
| Hi-index | 0.00 |
In this paper, we analyze backoff protocols, such as Ethernet. We examine a general backoff function (GBF) rather than just the binary exponential backoff (BEB) used by Ethernet. Under some mild assumptions we find stability and optimality conditions for a wide class of backoff protocols with GBF. In particular, it is proved that the maximal throughput rate over the class of backoff protocols with N stations is (1 - 1/N)1/N-1 and the optimal average service time for any station is ES = N/(1 - 1/N)1/N-1 or about Ne for large N. The reasons of the instability of the BEB protocol (for a big enough input rate) is explained.