Copyright © 1994 Published by Elsevier Science B.V.
Research
Analysis of delay bounds of a tree protocol with collision detection
Received 27 April 1992;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
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 Wu1, the analysis is exact over a wide range of a slot lengths and traffic intensities.
Author Keywords: collision detection; delay bounds; tree protocol







E-mail Article
Add to my Quick Links

Cited By in Scopus (1)




