Cart (Loading....) | Create Account
Close category search window
 

Delay analysis of tree conflict resolution algorithm with and without broadcast reservation using random or pseudo random addressing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Cheng-Shong Wu ; Dept. of Electr. Eng. Syst., Univ. of Southern California, Los Angeles, CA, USA ; Li, V.O.K.

An analysis is made of the performance of tree conflict resolution algorithms. A system with a finite number of users is considered, and each user provides buffers to store backlogged packets. In particular, the delay and system capacity of Capetanakis's original tree protocol (1979) and the broadcast reservation (BR) protocol using both random and pseudo random addressing are studied. Due to the nature of random access, the maximum throughput is low (only 0.348 for the original tree protocol). To improve it, the BR protocol combines the original tree protocol with the idea of demand assignment and yields very good delay-throughput. For the tree protocols, the random addressing scheme is fair but less efficient than deterministic addressing. To have fair and efficient addressing, an addressing scheme called pseudo random addressing is studied. It is as efficient as deterministic addressing and yet as fair as random addressing

Published in:

Communications, 1991. ICC '91, Conference Record. IEEE International Conference on

Date of Conference:

23-26 Jun 1991

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.