ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Computer Communications
Volume 17, Issue 4, April 1994, Pages 288-296
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (639 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/0140-3664(94)90083-3    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1994 Published by Elsevier Science B.V.

Research

Analysis of delay bounds of a tree protocol with collision detection

W. S. Chung, C. K. Un and B. C. Shin

Communication Research Laboratory, Department of Electrical Engineering, Korea Advanced Institute of Science and Technology 373-1 Yusong-gu Gusong-dong, Taejon, Korea

Received 27 April 1992; 
revised 11 January 1993. 
Available online 10 June 2003.

Purchase the full-text article



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

Article Outline

• References

Computer Communications
Volume 17, Issue 4, April 1994, Pages 288-296
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.