
The Library
Binary exponential backoff is stable for high arrival rates
Tools
Al-Ammal, Hesham, Goldberg, Leslie Ann and MacKenzie, Phil (1999) Binary exponential backoff is stable for high arrival rates. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)
|
PDF (Department of Computer Science Research Report)
WRAP_cs-rr-359.pdf - Other - Requires a PDF viewer. Download (338Kb) | Preview |
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-.9).
Item Type: | Report | ||||
---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software | ||||
Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science | ||||
Library of Congress Subject Headings (LCSH): | Computer network protocols | ||||
Series Name: | Department of Computer Science research report | ||||
Publisher: | University of Warwick. Department of Computer Science | ||||
Official Date: | 28 July 1999 | ||||
Dates: |
|
||||
Number: | Number 359 | ||||
DOI: | CS-RR-359 | ||||
Institution: | University of Warwick | ||||
Theses Department: | Department of Computer Science | ||||
Status: | Not Peer Reviewed | ||||
Publication Status: | Unpublished | ||||
Funder: | Engineering and Physical Sciences Research Council (EPSRC), European Strategic Programme of Research and Development in Information Technology (ESPRIT) | ||||
Grant number: | GR/L6098 (EPSRC), 21726 (ESPRIT) | ||||
Related URLs: |
Request changes or add full text files to a record
Repository staff actions (login required)
![]() |
View Item |