Scheduled System Maintenance:
On May 6th, system maintenance will take place from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). During this time, there may be intermittent impact on performance. We apologize for the inconvenience.
By Topic

Delay analysis of the n-ary stack random-access algorithm

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)
Merakos, L. ; Dept. of Electr. & Comput. Eng., Northeastern Univ., Boston, MA, USA ; Bisdikian, C.

An analysis is presented of the delay performance of the n-ary stack algorithm, an easy-to-implement random-access algorithm that uses collision-no-collision binary feedback and requires only limited feedback sensing by the users. Utilizing the regenerative character of the stochastic processes that are associated with the random-access system, tight upper and lower bounds on the mean packet delay and on the packet delay variance are derived. It is shown that the algorithm with n=3 has the best delay characteristics. Simulation results for the percentiles of the packet delay distribution are given

Published in:

Information Theory, IEEE Transactions on  (Volume:34 ,  Issue: 5 )