Window Random Access Protocols for Local Computer Networks
- 1 August 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-31 (8) , 715-722
- https://doi.org/10.1109/tc.1982.1676077
Abstract
In this paper we consider a local computer network in which users communicate with each other over a single bus. We develop window search algorithms with which to implement random access protocols on the bus. Two protocols, one nonadaptive and the other adaptive are described. The maximum throughputs and throughput-delay tradeoffs are provided for both. These protocols show significant improvement over previous random access protocols used in local computer networks. We also consider the problem of allowing new users to join the system.Keywords
This publication has 8 references indexed in Scilit:
- Performance analysis of carrier sense multiple access with collision detectionComputer Networks (1976), 1980
- Packet Switching in Radio Channels: New Conflict-Free Multiple Access SchemesIEEE Transactions on Communications, 1980
- Generalized TDMA: The Multi-Accessing Tree ProtocolIEEE Transactions on Communications, 1979
- BRAM: The Broadcast Recognizing Access MethodIEEE Transactions on Communications, 1979
- An Adaptive Technique for Local DistributionIEEE Transactions on Communications, 1978
- The Honeywell Experimental Distributed Processor – an OverviewComputer, 1978
- EthernetCommunications of the ACM, 1976
- Packet Switching in Radio Channels: Part I--Carrier Sense Multiple-Access Modes and Their Throughput-Delay CharacteristicsIEEE Transactions on Communications, 1975