Performance analysis of exponential backoff
| Autor: | Leonard E. Miller, Nah-Oak Song, Byung-Jae Kwak |
|---|---|
| Rok vydání: | 2005 |
| Předmět: |
Exponential backoff
Computer Networks and Communications Network packet Computer science Distributed computing Stability (learning theory) Throughput Computer Science Applications Exponential stability Wireless lan Algorithm design Limit (mathematics) Electrical and Electronic Engineering Throughput (business) Algorithm Software |
| Zdroj: | IEEE/ACM Transactions on Networking. 13:343-355 |
| ISSN: | 1063-6692 |
| DOI: | 10.1109/tnet.2005.845533 |
| Popis: | New analytical results are given for the performance of the exponential backoff (EB) algorithm. Most available studies on EB focus on the stability of the algorithm and little attention has been paid to the performance analysis of EB. In this paper, we analyze EB and obtain saturation throughput and medium access delay of a packet for a given number of nodes N. The analysis considers the general case of EB with backoff factor r; binary exponential backoff (BEB) algorithm is the special case with r = 2. We also derive the analytical performance of EB with maximum retry limit M(EB-M), a practical version of EB. The accuracy of the analysis is checked against simulation results. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|