An improved stability bound for binary exponential backoff

被引：21

作者：

Al-Ammal, H

Goldberg, LA

MacKenzie, P

机构：

[1] Univ Bahrain, Dept Comp Sci, Isa Town, Bahrain

[2] Univ Warwick, Dept Comp Sci, Coventry CV4 7AL, W Midlands, England

[3] Bell Labs, Lucent Technol, Informat Sci Ctr, Murray Hill, NJ 07974 USA

来源：

THEORY OF COMPUTING SYSTEMS | 2001年 / 34卷 / 03期

基金：

英国工程与自然科学研究理事会;

关键词：

D O I：

10.1007/s00224-001-0005-y

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Goodman, Greenberg, Madras and March gave a lower bound of n(-Omega (log n)) for the maximum arrival rate for which the n-user binary exponential backoff protocol is stable. Thus, they showed that the protocol is stable as long as the arrival rate is at most n(-Omega (log n)). We improve the lower bound, showing that the protocol is stable for arrival rates up to O(n(-(0.75+delta))), for any delta > 0.

引用

页码：229 / 244

页数：16

共 13 条

[1] ULTIMATE INSTABILITY OF EXPONENTIAL BACK-OFF PROTOCOL FOR ACKNOWLEDGMENT-BASED TRANSMISSION CONTROL OF RANDOM-ACCESS COMMUNICATION CHANNELS [J].