The Library
An improved stability bound for binary exponential backoff
Tools
UNSPECIFIED (2001) An improved stability bound for binary exponential backoff. THEORY OF COMPUTING SYSTEMS, 34 (3). pp. 229-244. ISSN 1432-4350.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Abstract
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.
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software Q Science > QA Mathematics |
||||
Journal or Publication Title: | THEORY OF COMPUTING SYSTEMS | ||||
Publisher: | SPRINGER-VERLAG | ||||
ISSN: | 1432-4350 | ||||
Official Date: | May 2001 | ||||
Dates: |
|
||||
Volume: | 34 | ||||
Number: | 3 | ||||
Number of Pages: | 16 | ||||
Page Range: | pp. 229-244 | ||||
Publication Status: | Published |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |