### Abstract

We consider the stochastic behavior of binary exponential backoff, a probabilistic algorithm for regulating transmissions on a multiple access channel. Ethernet, a local area network, is built upon this algorithm. The fundamental theoretical issue is stability: does the backlog of packets awaiting transmission remain bounded in time, provided the rates of new packet arrivals are small enough? We present a realistic model of n greater than equivalent to 2 stations communicating over the channel. Our main result is to establish that the algorithm is stable if the sum of the arrival rates is sufficiently small. We report results from a simulation study, which indicate alternative retransmission strategies can significantly improve performance.

Original language | English (US) |
---|---|

Title of host publication | Conference Proceedings of the Annual ACM Symposium on Theory of Computing |

Publisher | ACM (Order n 508850) |

Pages | 379-387 |

Number of pages | 9 |

ISBN (Print) | 0897911512 |

State | Published - 1985 |

### Fingerprint

### ASJC Scopus subject areas

- Software

### Cite this

*Conference Proceedings of the Annual ACM Symposium on Theory of Computing*(pp. 379-387). ACM (Order n 508850).

**ON THE STABILITY OF THE ETHERNET.** / Goodman, Jonathan; Greenberg, Albert G.; Madras, Neal; March, Peter.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Conference Proceedings of the Annual ACM Symposium on Theory of Computing.*ACM (Order n 508850), pp. 379-387.

}

TY - GEN

T1 - ON THE STABILITY OF THE ETHERNET.

AU - Goodman, Jonathan

AU - Greenberg, Albert G.

AU - Madras, Neal

AU - March, Peter

PY - 1985

Y1 - 1985

N2 - We consider the stochastic behavior of binary exponential backoff, a probabilistic algorithm for regulating transmissions on a multiple access channel. Ethernet, a local area network, is built upon this algorithm. The fundamental theoretical issue is stability: does the backlog of packets awaiting transmission remain bounded in time, provided the rates of new packet arrivals are small enough? We present a realistic model of n greater than equivalent to 2 stations communicating over the channel. Our main result is to establish that the algorithm is stable if the sum of the arrival rates is sufficiently small. We report results from a simulation study, which indicate alternative retransmission strategies can significantly improve performance.

AB - We consider the stochastic behavior of binary exponential backoff, a probabilistic algorithm for regulating transmissions on a multiple access channel. Ethernet, a local area network, is built upon this algorithm. The fundamental theoretical issue is stability: does the backlog of packets awaiting transmission remain bounded in time, provided the rates of new packet arrivals are small enough? We present a realistic model of n greater than equivalent to 2 stations communicating over the channel. Our main result is to establish that the algorithm is stable if the sum of the arrival rates is sufficiently small. We report results from a simulation study, which indicate alternative retransmission strategies can significantly improve performance.

UR - http://www.scopus.com/inward/record.url?scp=0021980821&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0021980821&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0021980821

SN - 0897911512

SP - 379

EP - 387

BT - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

PB - ACM (Order n 508850)

ER -