Al-Ammal, Hesham, Goldberg, Leslie Ann and MacKenzie, Phil (2000) Binary exponential backoff is stable for high arrival rates. In: Reichel, H. and Tison, S., (eds.) STACS 2000. Lecture Notes in Computer Science, Volume 1770 . Springer Berlin Heidelberg, pp. 169-180. ISBN 9783540671411

Full text not available from this repository, contact author.

Request Changes to record.

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:	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
Publisher:	Springer Berlin Heidelberg
ISBN:	9783540671411
ISSN:	0302-9743
Book Title:	STACS 2000
Editor:	Reichel, H. and Tison, S.
Official Date:	2000
Dates:	Date Event 2000 Published
Volume:	Volume 1770
Number of Pages:	12
Page Range:	pp. 169-180
Status:	Peer Reviewed
Publication Status:	Published
Access rights to Published version:	Restricted or Subscription Access
Conference Paper Type:	Paper
Title of Event:	17th Annual Symposium on Theoretical Aspects of Computer Science
Type of Event:	Other
Location of Event:	Lille, France
Date(s) of Event:	17-19 Feb 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