Window Random Access Protocols for Local Computer Networks

Authors:
D. Towsley;G. Venkatesh
Affiliations:
Department of Electrical and Computer Engineering, University of Massachusetts;-
Venue:
IEEE Transactions on Computers - Lecture notes in computer science Vol. 174
Year:
1982

Citing 2
Cited 2

Ethernet: distributed packet switching for local computer networks

Communications of the ACM
The Honeywell Experimental Distributed Processor - an Overview

Computer

An analysis of a time window multiaccess protocol with collision size feedback (WCSF)

Proceedings of the Computer Network Performance Symposium
The space division multiple access protocol: asynchronous implementation and performance

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

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.