Goldberg, Leslie Ann, Jerrum, Mark, Kannan, Sampath and Paterson, Michael S. (2000) A bound on the capacity of backoff and acknowledgement-based protocols. In: Montanari, U. and Rolim, J. D. P and Welzl, E, (eds.) Automata, Languages and Programming. Lecture Notes in Computer Science, Volume 1853 . Springer Berlin Heidelberg, pp. 705-716. ISBN 9783540677154

Full text not available from this repository, contact author.

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:	Book Item
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions:	Faculty of Science > Computer Science
Series Name:	Lecture Notes in Computer Science
Journal or Publication Title:	AUTOMATA LANGUAGES AND PROGRAMMIN
Publisher:	Springer Berlin Heidelberg
ISBN:	9783540677154
ISSN:	0302-9743
Book Title:	Automata, Languages and Programming
Editor:	Montanari, U. and Rolim, J. D. P and Welzl, E
Official Date:	18 February 2000
Dates:	Date Event 18 February 2000 Published
Volume:	Volume 1853
Number of Pages:	12
Page Range:	pp. 705-716
Status:	Peer Reviewed
Publication Status:	Published
Access rights to Published version:	Restricted or Subscription Access
Title of Event:	27th International Colloquium on Automata Languages and Programming (ICALP 2000)
Location of Event:	Geneva, Switzerland
Date(s) of Event:	09-15 Jul 2000

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