Original scientific paper

https://doi.org/10.24138/jcomss.v4i1.233

Performance analysis of general backoff protocols

Andrey Lukyanenko ; Helsinki Institute for Information Technology, Helsinki, P.O. Box 9800, FIN-02015 TKK, Finland
Andrei Gurtov orcid.org/0000-0002-9829-9287 ; Helsinki Institute for Information Technology, Helsinki, P.O. Box 9800, FIN-02015 TKK, Finland

Abstract

In this paper, we analyze backoff protocols, such as the one used in 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 is a fixed function of the number of stations (N) and the optimal average service time is about Ne for large N. The reasons of the instability of the BEB protocol (for a big enough input rate) are explained. Additionally, the paper introduces novel procedure for analyzing bounded backoff protocols, which is useful for creating new protocols or improving existing, as no protocol can use unbounded counters.

Keywords

Ethernet; backoff protocol; contention resolution; stability; optimality; queuing theory

Hrčak ID:

180485

URI

https://hrcak.srce.hr/180485

Publication date:

25.3.2008.

Visits: 1.052 *