|
|||||||||||||||||||||||||||||||||||||
|
|||||||||||||||||||||||||||||||||||||
ABSTRACT
The Binary Exponential Backoff (BEB) mechanism plays a key role in determining stability and efficiency of popular MAC protocols, such as IEEE 802.3 and IEEE 802.11. Unfortunately, the maximum throughput allowed by this protocol under different system parameters and user's multiplicity is largely unknown. In this paper we evaluate the capacity of a two-station system under Bernoulli arrivals, which is proved in the literature to be lower bounded by 0:3 under balanced arrivals. We refer to the general exponential backoff law b-i and show that, when close to capacity, the system behaves in a simple manner, which allows us to assess capacity without resorting to the general Markov Chain approach. Our approach shows that the capacity of BEB under balanced load is equal to 0.6096. We also provide the stability region when arrivals are unbalanced in the two queues. Simulation results support our finding. REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
INDEX TERMS
Primary Classification:
Additional Classification:
General Terms:
Keywords:
|
|||||||||||||||||||||||||||||||||||||