A bound on the capacity of backoff and acknowledgement-based protocols
UNSPECIFIED (2000) A bound on the capacity of backoff and acknowledgement-based protocols. In: 27th International Colloquium on Automata Languages and Programming (ICALP 2000), GENEVA, SWITZERLAND, JUL 09-15, 2000. Published in: AUTOMATA LANGUAGES AND PROGRAMMING, 1853 pp. 705-716.Full text not available from this repository.
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 acknowledgement-based protocol.
|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:||AUTOMATA LANGUAGES AND PROGRAMMING|
|Editor:||Montanari, U and Rolim, JDP and Welzl, E|
|Number of Pages:||12|
|Page Range:||pp. 705-716|
|Title of Event:||27th International Colloquium on Automata Languages and Programming (ICALP 2000)|
|Location of Event:||GENEVA, SWITZERLAND|
|Date(s) of Event:||JUL 09-15, 2000|
Actions (login required)