Bounds for the optimal decentralized access protocol in a local area network

Zvi Rosberg

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

Here, we consider a local area network under the set of decentralized access protocols. Lower and upper bounds are obtained for the optimal long-run average waiting cost. These bounds are shown to be quite tight for a typical network.

Original languageEnglish
Pages (from-to)261-268
Number of pages8
JournalPerformance Evaluation
Volume6
Issue number4
DOIs
StatePublished - 1 Jan 1986
Externally publishedYes

Keywords

  • Access Protocol
  • Distributed Protocol
  • Local Area Network
  • Optimal Scheduling
  • Single Server Queue

Fingerprint

Dive into the research topics of 'Bounds for the optimal decentralized access protocol in a local area network'. Together they form a unique fingerprint.

Cite this