By Topic

Delay analysis of interval-searching contention 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

2 Author(s)

The intelligent design of a random multiple-access communication system involves analyzing the tradeoffs among throughput rate, transmission delay, and stability subject to additional restrictions imposed by distributed processing requirements. Interval-searching contention resolution algorithms have been found to achieve high throughput, and simulations have shown that they also possess short average delay. A general approach to the delay analysis of interval-searching contention resolution is proposed based on solving an integral equation for the distribution of a quantity called the transmission lag. For a certain multibit feedback algorithm, this analytical technique leads to exact determination of the throughput-delay characteristic. For the celebrated " 0.487 " algorithm, the method yields upper and lower bounds to the curve of expected delay versus throughput that are in close agreement with simulation results.

Published in:

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