Michael A. Bender, Jeremy T. Fineman, Seth Gilbert et al. · Journal of the ACM · 2018
Randomized exponential backoff is a widely deployed technique for coordinating access to a shared resource. A good backoff protocol should, arguably, satisfy three natural properties: (1) it should provide constant throughput, wasting as little time as possible; (2) it should require few failed access attempts, minimizing the amount of wasted effort; and (3) it should be robust, continuing to work efficiently even if some of the access attempts fail for spurious reasons. Unfortunately, exponential backoff has some well-known limitations in two of these areas: it can suffer subconstant throughput under bursty traffic, and it is not robust to adversarial disruption. The goal of this article is to “fix” exponential backoff by making it scalable, particularly focusing on the case where processes arrive in an online, worst-case fashion. We present a relatively simple backoff protocol, R e -B ackoff , that has, at its heart, a version of exponential backoff. It guarantees expected constant throughput with dynamic process arrivals and requires only an expected polylogarithmic number of access attempts per process. R e -B ackoff is also robust to periods where the shared resource is unavailable for a period of time. If it is unavailable for D time slots, R e -B ackoff provides the following guarantees. For n packets, the expected number of access attempts for successfully sending a packet is O (log 2 ( n + D )). For the case of an infinite number of packets, we provide a similar result in terms of the maximum number of processes that are ever in the system concurrently.
Cited by 20Open access
SpringerReference · 2011
Cited by 1
SpringerReference · 2011
Cited by 0
Jie Hui, Student Member, Michael Devetsikiotis et al. · 2014
Abstract—Rapid deployment of IEEE 802.11 wireless local area networks (WLANs) and their increasing quality of service (QoS) requirements motivate extensive performance evaluations of the upcoming 802.11e QoS-aware enhanced distributed coordination function (EDCA). Most of the analytical studies up-to-date have been based on one of the three major performance models in legacy distributed coordination function analysis, requiring a large degree of complexity in solving multidimensional Markov chains. Here, we expose the common guiding principle behind these three seemingly different models. Subsequently, by ab-stracting, unifying, and extending this common principle, we propose a new unified performance model and analysis method to study the saturation throughput and delay performance of EDCA, under the assumption of a finite number of stations and ideal channel conditions in a single-hop WLAN. This unified model combines the strengths of all three models, and thus, is easy to understand and apply; on the other hand, it helps increase the understanding of the existing performance analysis. Despite its appealing simplicity, our unified model and analysis are validated very well by simulation results. Ultimately, by means of the pro-posed model, we are able to precisely evaluate the differentiation effects of EDCA parameters on WLAN performance in very broad settings, a feature which is essential for network design. Index Terms—Enhanced distributed coordination function (EDCA), IEEE 802.11, performance analysis, quality of service (QoS), wireless local area network (WLAN).
Cited by 0
Jonathan Goodman, Albert Greenberg, Neal Madras et al. · Journal of the ACM · 1988
Binary exponential backoff is a randomized protocol for regulating transmissions on a multiple-access broadcast channel. Ethernet, a local-area network, is built upon this protocol. The fundamental theoretical issue is stability: Does the backlog of packets awaiting transmission remain bounded in time, provided the rates of new packet arrivals are small enough? It is assumed n ≥ 2 stations share the channel, each having an infinite buffer where packets accumulate while the station attempts to transmit the first from the buffer. Here, it is established that binary exponential backoff is stable if the sum of the arrival rates is sufficiently small. Detailed results are obtained on which rates lead to stability when n = 2 stations share the channel. In passing, several other results are derived bearing on the efficiency of the conflict resolution process. Simulation results are reported that, in particular, indicate alternative retransmission protocols can significantly improve performance.
Cited by 173Open access
Albert G. Greenberg, See Profile, See Profile et al. · 1988
All in-text\treferences\tunderlined\tin\tblue\tare\tlinked\tto\tpublications\ton\tResearchGate, letting you\taccess\tand\tread\tthem\timmediately.
Cited by 0
Byung-Jae Kwak, Nah-Oak Song, Leonard E. Miller · IEEE/ACM Transactions on Networking · 2005
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.
Cited by 374
Jing Yuan · 2012
According to the problem of timeliness for IEEE 802.11's binary exponential backoff algorithm,which used maxmum transmitting times,a new delay-constrained binary exponential backoff algorithm was proposed,which used timeout threshold instead of maxmum transmitting times as the reference for packet dropping.It can increase system unitary effective throughput,and doesn't reduce system unitary throughput dramatically,which is fit for wireless Ad hoc networks demanding restrict delay.A Markov model was introduced to analyze system performance.The simulations validate the accuracy of model and the advantagement of DC_BEB over BEB.
Cited by 0
Nah-Oak Song, B.-J. Kwak, Leonard E. Miller · Journal of Research of the National Institute of Standards and Technology · 2003
Random access schemes for packet networks featuring distributed control require algorithms and protocols for resolving packet collisions that occur as the uncoordinated terminals contend for the channel. A widely used collision resolution protocol is the exponential backoff (EB). New analytical results for the stability of the (binary) EB are given. Previous studies on the stability of the (binary) EB have produced contradictory results instead of a consensus: some proved instability, others showed stability under certain conditions. In these studies, simplified and/or modified models of the backoff algorithm were used. In this paper, care is taken to use a model that reflects the actual behavior of backoff algorithms. We show that EB is stable under a throughput definition of stability; the throughput of the network converges to a non-zero constant as the offered load N goes to infinity. We also obtain the analytical expressions for the saturation throughput for a given number of nodes, N. The analysis considers the general case of EB with backoff factor r, where BEB is the special case with r = 2. We show that r = 1/(1 - e(-1)) is the optimum backoff factor that maximizes the throughput. The accuracy of the analysis is checked against simulation results.
Cited by 47Open access
S Mehta, Kwak KS · SHILAP Revista de lepidopterología · 2010
Cited by 0Open access
Innocent Uzougbo Onwuegbuzie (9243166), Shukor Abd Razak (3383591), Ismail Fauzi Isnin (9243169) et al. · Figshare · 2020
<p>CSTP-MAC algorithm backoff time-slots vs IEEE 802.15.4 binary backoff exponential algorithm backoff time-slots.</p>
Cited by 0Open access
Lei Zhang, Weiqing Cheng, Yinglin Hou · 2018
In large-scale distributed systems, gossip protocols are often used to disseminate information. In this paper, an improved Gossip algorithm that integrates binary exponential backoff used in computer network into the classic Gossip algorithm is proposed to reduce the network load in the process of information dissemination. The improved Gossip algorithm applies an exponential backoff messaging strategy to spread information among nodes, i.e. the more often a node receives a certain information, the less likely it is to spread information in the following rounds. The Markov chain is used to analyze this model. We analyze the performance of this proposed algorithm both analytically and by simulations and show how it reduces network load compared to the classic Gossip algorithm. Our method reduces the network load by 28% compared to the classic algorithm on 10,000 nodes.
Cited by 1
Bum-gon Choi, Sueng Jae Bae, Tae-jin Lee et al. · 2009
Abstract. IEEE 802.11 is the most famous protocol for implementation of wireless local area network (WLAN). To access the medium, IEEE 802.11 uses carrier sense multiple access with collision avoidance (CSMA/CA) mechanism, called distributed coordination function (DCF). Although DCF uses binary exponential backoff (BEB) algorithm to avoid frame collisions, wireless resources are wasted due to a lot of collisions under the condition that there are many contending stations. To solve this problem, a binary negative-exponential backoff (BNEB) algorithm has been proposed and its saturation throughput was evaluated under erroneous channel condition. As extention of our previous work, this paper evaluates performance of BNEB algorithm via mathematical analysis and simulations under saturation and erroneous channel condition in terms of the MAC delay and throughput. Also, we compare the performance of DCF with BEB to that with BNEB under normal traffic and erroneous channel condition by intensive simulations. From the results, BNEB yields better performance than BEB in general.
Cited by 0
J Hooman · Proceedings of the Estonian Academy of Sciences Engineering · 1998
We present a formal framework for the specification and verification of distributed real-time systems.To obtain mechanical support, this framework has been defined in the language of the proof checker Prototype Verification System.Intermediate stages of the design are represented by mixed terms where specifications and programming constructs can be combined.Compositional proof rules allow the verification of design steps.Here we focus on the rules for parallel composition and hiding.Their use during protocol verification is illustrated by a part of the Hypertext Transfer Protocol, the binary exponential backoff protocol.
Cited by 2Open access
QU Chunxiao, REN Jiuchun, ZHU Qian · SHILAP Revista de lepidopterología · 2019
Analysis on the channel access of the LoRaWAN protocol indicates that the success rate of data transmission is low under heavy network load.However,a high success rate of data transmission is required to save energy and extend the life of terminal devices by reducing retransmission times.To address the problem,this paper proposes an improved protocol combining the LoRaWAN protocol and the binary exponential backoff algorithm.Data transmission of the original protocol and the improved protocol are described by using simple state machines,and modeled mathematically by using probability analysis.Matlab-based simulation results show that the constructed mathematical model matches actual states of the system,and the improved protocol can efficiently increase the success rate of network transmission.Though the average network delay is also increased,it can be offset by adding bandwidth.
Cited by 0Open access
MacKenzie, P., Goldberg, L.A., Al-Ammal, H. et al. · OpenGrey (Institut de l'Information Scientifique et Technique) · 1999
Cited by 0
Hesham Al-Ammal, Leslie Ann Goldberg, MacKenzie, Phil · Warwick Research Archive Portal (University of Warwick) · 1999
Goodman, Greenberg, Madras and March gave a lower bound of n 1 8 n) for the maximum arriaval rate for which the n-user binary exponential backo protocol is stable. Thus, they showed that the protocol is stable as long as the arrival rate is at most n 120 n) . We improve the lower bound, showing that the protocol is stable for arrival rates up to O(n :9 ). Classication of topic: Algorithms and data structures (distributed algorithms) 1
Cited by 0
Xinghua Sun, Lin Dai · 2011
In this paper, a unified analytical model is established to analyze the performance of backoff schemes in IEEE 802.11 DCF networks under saturation condition. It is shown that BEB suffers from deteriorated queueing performance due to a large second moment of access delay, and a key to reduce the second moment lies in the growth rate of the backoff window size. Quadratic Backoff (QB) is further proposed, with which the backoff window size is quadratically increased upon collisions. Both the theoretical and simulation results show that QB can achieve a comparable throughput with that of BEB, but with much better queueing performance.
Cited by 8
Mingyun Ban, Saher Manaseer, Asmahan Abu Al-hassan et al. · 2010
Broadcasting is an essential operation in Mobile ad hoc Networks (MANETs) environments. It is used in the initial phase of route discovery process in many reactive protocols. Although broadcasting is simple, it causes the well known broadcast storm problem, which is a result of packet redundancy, contention and collision. A probabilistic scheme has been proposed to overcome this problem. This work aims to study the effect of network density and network mobility on probabilistic schemes using different thresholds (fixed, 2p, 3p and 4p) with the Pessimistic Linear Exponential Backoff (PLEB) algorithm and compare the results with the standard MAC. A number of simulation experiments have been conducted to examine the performance of the proposed PLEP under different operating conditions. The simulation results show that in dense networks the normalized routing load, delay and routing packets are high and the PLEB outperforms the standard MAC in terms of delay.
Cited by 6
Luca Barletta, F. Borgonovo · Virtual Community of Pathological Anatomy (University of Castilla La Mancha) · 2020
In this paper we provide an approximate analysis that synthesizes results on the throughput and the delay of S-Aloha under a variety of backoff laws with an unlimited number of backoff stages. Past results, common to those about IEEE 802.11 protocols, show that, with the exponential backoff, the access-delay distribution is heavy tailed, and that, in order to alleviate the delay, throughput and number of users must be sacrificed. This paper uses an approximated and simple model recently introduced to produce results that are usually derived in a more complex framework. Here the model is extended to general backoff laws, including polynomial laws of type (a+i <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ν</sup> ) <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-1</sup> . We find that, when considering all performance factors, i.e., throughput, variance, access flexibility, and maximum number of users allowed, the polynomial law is to be preferred, with a degree ν that increases with the number of users that can be accommodated.
Cited by 1Open access