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