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

Authors:
M. Y. Elsanadidi;Wesley W. Chu
Affiliations:
Department of Computer Science, University of Maryland, College Park, Md.;Computer Science Department, University of California at Los Angeles, Los Angeles, California
Venue:
Proceedings of the Computer Network Performance Symposium
Year:
1982

Citing 3
Cited 1

Ethernet: distributed packet switching for local computer networks

Communications of the ACM
Analysis of broadcast communication systems with acknowledgment considerations

Analysis of broadcast communication systems with acknowledgment considerations
Window Random Access Protocols for Local Computer Networks

IEEE Transactions on Computers - Lecture notes in computer science Vol. 174

Multiple-access protocols and time-constrained communication

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyze the performance of a window multiaccess protocol with collision size feedback. We obtain bounds on the throughput and the expected packet delay, and assess the sensitivity of the performance to collision recognition time and packet transmission time. An approximate optimal window reduction factor to minimize packet isolation time is {equation}, where n is the collision size and R the collision recognition time (in units of packet propagation delay). The WCSF protocol, which requires more information than CSMA-CD, is shown to have at least 30% more capacity than CSMA-CD for high bandwidth channels; that is, when packet transmission time is comparable to propagation delay. The capacity gain of the WCSF protocol decreases as the propagation delay decreases and the collision recognition time increases. Our study also reveals the inherent stability of WCSF. When the input load increases beyond saturation. The throughput remains at its maximum value.