Goldberg, Leslie Ann, Jerrum, Mark, Kannan, Sampath and Paterson, Michael S. (2000) A bound on the capacity of backoff and acknowledgement-based protocols. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Preview

PDF (Department of Computer Science Research Report) WRAP_cs-rr-365.pdf - Other - Requires a PDF viewer. Download (431Kb) | Preview

Request Changes to record.

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 acknowledgement-based protocol.

Item Type:	Report
Subjects:	T Technology > TK Electrical engineering. Electronics Nuclear engineering
Divisions:	Faculty of Science > Computer Science
Library of Congress Subject Headings (LCSH):	Data transmission systems, Contention resolution protocols (Computer network protocols)
Series Name:	Department of Computer Science research report
Publisher:	University of Warwick. Department of Computer Science
Official Date:	7 January 2000
Dates:	Date Event 7 January 2000 Completion
Number:	Number 365
Number of Pages:	21
DOI:	CS-RR-365
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), National Science Foundation (U.S.) (NSF), European Strategic Programme of Research and Development in Information Technology (ESPRIT)
Grant number:	GR/L60982 (EPSRC), CCR9820885 (NSF), ALCOM-FT (ESPRIT), RAND-APX (ESPRIT)
Related URLs:	Publisher

Request changes or add full text files to a record

Repository staff actions (login required)

View Item

Downloads