The Library
A bound on the capacity of backoff and acknowledgment-based protocols
Tools
Tools
Tools
UNSPECIFIED. (2004) A bound on the capacity of backoff and acknowledgment-based protocols. SIAM JOURNAL ON COMPUTING, 33 (2). pp. 313-331. ISSN 0097-5397
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1137/S0097539700381851
Abstract
We study contention-resolution protocols for multiple-access channels. We show that every backoff protocol is transient if the arrival rate, lambda, is at least 0.42 and that the capacity of every backoff protocol is at most 0.42. Thus, we show that backoff protocols have (provably) smaller capacity than full-sensing protocols. Finally, we show that the corresponding results, with the larger arrival bound of 0.531, also hold for every acknowledgment-based protocol.
| Item Type: | Journal Article |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software Q Science > QA Mathematics |
| Journal or Publication Title: | SIAM JOURNAL ON COMPUTING |
| Publisher: | SIAM PUBLICATIONS |
| ISSN: | 0097-5397 |
| Date: | 2004 |
| Volume: | 33 |
| Number: | 2 |
| Number of Pages: | 19 |
| Page Range: | pp. 313-331 |
| Identification Number: | 10.1137/S0097539700381851 |
| Publication Status: | Published |
| URI: | http://wrap.warwick.ac.uk/id/eprint/8602 |
Data sourced from Thomson Reuters' Web of Knowledge
Actions (login required)
 |
View Item |
