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

Zvi Rosberg

doi:10.1016/0166-5316(86)90035-0

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

Zvi Rosberg

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	261-268
Number of pages	8
Journal	Performance Evaluation
Volume	6
Issue number	4
DOIs	https://doi.org/10.1016/0166-5316(86)90035-0
State	Published - 1 Jan 1986
Externally published	Yes

Keywords

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

ASJC Scopus subject areas

Software
Modeling and Simulation
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1016/0166-5316(86)90035-0

Cite this

@article{b8be5b94179141a3ac8c31e786a92514,

title = "Bounds for the optimal decentralized access protocol in a local area network",

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.",

keywords = "Access Protocol, Distributed Protocol, Local Area Network, Optimal Scheduling, Single Server Queue",

author = "Zvi Rosberg",

year = "1986",

month = jan,

day = "1",

doi = "10.1016/0166-5316(86)90035-0",

language = "English",

volume = "6",

pages = "261--268",

journal = "Performance Evaluation",

issn = "0166-5316",

publisher = "Elsevier B.V.",

number = "4",

}

TY - JOUR

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

AU - Rosberg, Zvi

PY - 1986/1/1

Y1 - 1986/1/1

N2 - 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.

AB - 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.

KW - Access Protocol

KW - Distributed Protocol

KW - Local Area Network

KW - Optimal Scheduling

KW - Single Server Queue

UR - https://www.scopus.com/pages/publications/0022887585

U2 - 10.1016/0166-5316(86)90035-0

DO - 10.1016/0166-5316(86)90035-0

M3 - Article

AN - SCOPUS:0022887585

SN - 0166-5316

VL - 6

SP - 261

EP - 268

JO - Performance Evaluation

JF - Performance Evaluation

IS - 4

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this