Delay analysis of a window tree conflict resolution algorithm in a local area network environment

Authors:
George C. Polyzos;Mart L. Molle
Affiliations:
Department of Computer Science, University of Toronto, Toronto, Canada M5S 1A4;Department of Computer Science, University of Toronto, Toronto, Canada M5S 1A4
Venue:
SIGMETRICS '87 Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Year:
1987

Citing 3
Cited 0

Distributions of packet delay and interdeparture time in slotted ALOHA and carrier sense multiple access

Journal of the ACM (JACM)
Ethernet: distributed packet switching for local computer networks

Communications of the ACM
Asynchronous multiple access tree algorithms

SIGCOMM '83 Proceedings of the symposium on Communications Architectures & Protocols

Quantified Score

Hi-index	0.00

Visualization

Abstract

Expressions are found for the throughput and delay performance of a Tree Conflict Resolution Algorithm that is used in a Local Area Network with carrier sensing (and possibly also collision detection). We assume that Massey's constant size window algorithm is used to control access to the channel, and that the resulting conflicts (if any) are resolved using a Capetanakis-like preorder traversal tree algorithm with d-ary splitting. We develop and solve functional equations for various performance metrics of the system and apply the “Moving Server” technique to calculate the main component of the delay. Our results compare very favorably with those for CSMA protocols, which are commonly used in Local Area Networks that support sensing.