UNSPECIFIED (2000) Contention resolution with constant expected delay. JOURNAL OF THE ACM, 47 (6). pp. 1048-1096. ISSN 0004-5411

Full text not available from this repository.

Abstract

We study contention resolution in a multiple-access channel such as the Ethernet channel. In the model that we consider, n users generate messages for the channel according to a probability distribution. Raghavan and Upfai have given a protocol in which the expected delay (time to get serviced) of every message is O(log n) when messages are generated according to a Bernoulli distribution with generation rate up to about 1/10. Our main results are the following protocols: (a) one in which the expected average message delay is O(1) when messages are generated according to a Bernoulli distribution with a generation rate smaller than lie, and (b) one in which the expected delay of any message is O(1) for an analogous model in which users are synchronized (i.e., they agree about the time), there are potentially an infinite number of users, and messages are generated according to a Poisson distribution with generation rate up to 1/e. (Each message constitutes a new user.) To achieve (a), we first show how to simulate (b) using n synchronized users, and then show how to build the synchronization into the protocol.

Item Type:	Journal Article
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Journal or Publication Title:	JOURNAL OF THE ACM
Publisher:	ASSOC COMPUTING MACHINERY
ISSN:	0004-5411
Date:	November 2000
Volume:	47
Number:	6
Number of Pages:	49
Page Range:	pp. 1048-1096
Publication Status:	Published
URI:	http://wrap.warwick.ac.uk/id/eprint/12503

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item