Contention resolution with constant expected delay

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 Upfal 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 1/e, 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.

[1]  Thanasis Tsantilas,et al.  Efficient optical communication in parallel computers , 1992, SPAA '92.

[2]  Rajmohan Rajaraman,et al.  On contention resolution protocols and associated probabilistic phenomena , 1998, JACM.

[3]  Philippe Flajolet,et al.  Estimating the multiplicities of conflicts to speed their resolution in multiple access channels , 1987, JACM.

[4]  F. F. Kuo,et al.  The ALOHA system , 1974, CCRV.

[5]  Frank Thomson Leighton,et al.  A doubly logarithmic communication algorithm for the completely connected optical communication parallel computer , 1993, SPAA '93.

[6]  Frank Thomson Leighton,et al.  Analysis of Backoff Protocols for Multiple Access Channels , 1996, SIAM J. Comput..

[7]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[8]  Colin McDiarmid,et al.  Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .

[9]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[10]  Robert Metcalfe,et al.  Ethernet: distributed packet switching for local computer networks , 1988, CACM.

[11]  David J. Aldous.  Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels , 1987, IEEE Trans. Inf. Theory.

[12]  Peter March,et al.  Stability of binary exponential backoff , 1988, JACM.

[13]  Frank Kelly,et al.  Stochastic Models of Computer Communication Systems , 1985 .

[14]  Yossi Matias,et al.  An optical simulation of shared memory , 1994, SPAA '94.

[15]  Richard J. Anderson.  Optical Communication for Pointer Based Algorithms , 1988 .

[16]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[17]  Frank Thomson Leighton,et al.  Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers , 1997, SIAM J. Comput..

[18]  Robert Metcalfe,et al.  Ethernet: distributed packet switching for local computer networks , 1976, CACM.

[19]  Friedhelm Meyer auf der Heide,et al.  Simple, efficient shared memory simulations , 1993, SPAA '93.

[20]  Eli Upfal,et al.  Stochastic contention resolution with short delays , 1995, STOC '95.

[21]  Nicholas Pippenger,et al.  Bounds on the performance of protocols for a multiple-access broadcast channel , 1981, IEEE Trans. Inf. Theory.