作者: Byung-Jae Kwak , Nah-Oak Song , L.E. Miller
DOI: 10.1109/WCNC.2003.1200652
关键词: Computer science 、 Constant (mathematics) 、 Exponential backoff 、 Distributed algorithm 、 Throughput (business) 、 Stability (probability) 、 Throughput 、 Network packet 、 Distributed computing 、 Offered load 、 Applied mathematics 、 Distributed coordination function
摘要: New analytic results are given for the stability and performance of exponential backoff (EB) algorithm. Previous studies on (binary) EB have produced contradictory instead a consensus: some proved instability, others showed under certain conditions. In these studies, simplified and/or modified models algorithm were often used to make analysis more tractable. this paper, care is taken use model that reflects actual behavior algorithms. We show stable throughput definition stability; network converges non-zero constant as offered load N goes infinity. also obtain analytical expressions saturation medium access delay packet number nodes, N. The considers general case with factor r, where BEB special r = 2. accuracy checked against simulation results.