Research: Analysis of delay bounds of a tree protocol with collision detection

Authors:
W. S. Chung;C. K. Un;B. C. Shin
Affiliations:
Communication Research Laboratory, Department of Electrical Engineering, Korea Advanced Institute of Science and Technology 373-1 Yusong-gu Gusong-dong, Taejon, Korea;Communication Research Laboratory, Department of Electrical Engineering, Korea Advanced Institute of Science and Technology 373-1 Yusong-gu Gusong-dong, Taejon, Korea;Communication Research Laboratory, Department of Electrical Engineering, Korea Advanced Institute of Science and Technology 373-1 Yusong-gu Gusong-dong, Taejon, Korea
Venue:
Computer Communications
Year:
1994

Citing 3
Cited 0

A 0.487 throughput limited sensing algorithm

IEEE Transactions on Information Theory
A simple window random access algorithm with advantageous properties

IEEE Transactions on Information Theory
A Method for the Delay Analysis of Random Multiple-Access Algorithms Whose Delay Process is Regenerative

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

A collision resolution problem in a discrete time multiaccess channel is considered, where the stations are independent and the channel feedback is ternary (i.e. idle, success or collision). The tree protocol with collision detection (Tree/CD) is a collision resolution protocol that performs better than Ethernet. In this paper, we evaluate precisely the upper and lower bounds of the Tree/CD delay using a recursive method, consider the limited sensing algorithm, and examine the throughput performance. Compared with the results of Huang and Wu^1, the analysis is exact over a wide range of a slot lengths and traffic intensities.