By Topic

On the throughput of degenerate intersection and first-come first-served collision resolution algorithms

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

3 Author(s)

It is shown that, for a ternary feedback random access channel with a Poisson arrival process, 0.5 is an upper bound to the throughput for all "degenerate intersection" algorithms (DIA's) and first-come first-served algorithms (FCFSA's). As a by-product, the nested FCFSA with the largest throughput is found for the random access channel with a Bernoulli arrival process with parameter p . For p \geq 0.018 , this algorithm has the highest throughput over all DIA's and FCFSA's. Lastly, it is shown that. for some values of p , a non-DIA, non-FCFSA has a higher throughput than the optimum DIA or FCFSA.

Published in:

Information Theory, IEEE Transactions on  (Volume:31 ,  Issue: 2 )