ON THE STABILITY OF THE ETHERNET.

Jonathan Goodman, Albert G. Greenberg, Neal Madras, Peter March

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publicationConference Proceedings of the Annual ACM Symposium on Theory of Computing
PublisherACM (Order n 508850)
Pages379-387
Number of pages9
ISBN (Print)0897911512
StatePublished - 1985

Fingerprint

Ethernet
Local area networks

ASJC Scopus subject areas

  • Software

Cite this

Goodman, J., Greenberg, A. G., Madras, N., & March, P. (1985). ON THE STABILITY OF THE ETHERNET. In 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.

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Goodman, J, Greenberg, AG, Madras, N & March, P 1985, ON THE STABILITY OF THE ETHERNET. in Conference Proceedings of the Annual ACM Symposium on Theory of Computing. ACM (Order n 508850), pp. 379-387.
Goodman J, Greenberg AG, Madras N, March P. ON THE STABILITY OF THE ETHERNET. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing. ACM (Order n 508850). 1985. p. 379-387
Goodman, Jonathan ; Greenberg, Albert G. ; Madras, Neal ; March, Peter. / ON THE STABILITY OF THE ETHERNET. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. ACM (Order n 508850), 1985. pp. 379-387
@inproceedings{a381b116617d46ef9c0b2f9d4374a5ce,
title = "ON THE STABILITY OF THE ETHERNET.",
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.",
author = "Jonathan Goodman and Greenberg, {Albert G.} and Neal Madras and Peter March",
year = "1985",
language = "English (US)",
isbn = "0897911512",
pages = "379--387",
booktitle = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",
publisher = "ACM (Order n 508850)",

}

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

SN - 0897911512

SP - 379

EP - 387

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

PB - ACM (Order n 508850)

ER -