A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Binary Exponential Backoff Is Stable for High Arrival Rates
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Thinning protocols for routing h-relations over shared media
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
We study contention resolution in multiple-access channels such as the Ethernet. Under a stochastic model of continuous packet generation from a set of n processors, we construct a protocol which guarantees constant expected delay for generation rates up to a fixed constant less than 1. Previous protocols which are stable for constant arrival rates do not guarantee constant expected delay. The two protocols that achieved results closest to this are one by Raghavan and Upfal, which only guarantees logarithmic (in n) expected delay, and one by Paterson and Srinivasan, which only guarantees constant expected delay with high probability. (In the latter protocol, there is a non-zero probability that the initial clock synchronization might fail and cause the expected delay to grow unboundedly.) Although those protocols do not guarantee constant expected delay, we have used ideas from them in the construction of our protocol, which does guarantee constant expected delay. We achieve our results using a technique called Robust Synchronization which is applied periodically in our protocol. The introduction of this technique and the analysis of this technique are the main contributions of the paper.