Binary exponential backoff is stable for high arrival rates
UNSPECIFIED (2000) Binary exponential backoff is stable for high arrival rates. In: 17th Annual Symposium on Theoretical Aspects of Computer Science, LILLE, FRANCE, FEB 17-19, 2000. Published in: STACS 2000: 17TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECT OF COMPUTER SCIENCE, 1770 pp. 169-180.Full text not available from this repository.
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(-.9)).
|Item Type:||Conference Item (UNSPECIFIED)|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Series Name:||LECTURE NOTES IN COMPUTER SCIENCE|
|Journal or Publication Title:||STACS 2000: 17TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECT OF COMPUTER SCIENCE|
|Editor:||Reichel, H and Tison, S|
|Number of Pages:||12|
|Page Range:||pp. 169-180|
|Title of Event:||17th Annual Symposium on Theoretical Aspects of Computer Science|
|Location of Event:||LILLE, FRANCE|
|Date(s) of Event:||FEB 17-19, 2000|
Actions (login required)