By Topic

A random-access algorithm for data networks carrying high-priority traffic

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)
Liu, M. ; Comsat Labs., Clarksburg, MD, USA ; Papantoni-Kazakos, P.

The authors consider data networks carrying mixed traffic, partially low and partially high priority. For such networks, they propose a synchronous limited sensing random access algorithm per channel, which gives a delay advantage to the high-priority traffic. The algorithm basically consists of two dynamically coupled window algorithms, one for the high and one for the low-priority packets. Assuming limit Poisson user models for both the traffic classes, the authors optimize the windows of the mixed algorithm for: (a) throughput maximization under no specific delay constraints, and (b) throughput maximization subject to expected delay constraints for the high-priority traffic. For cases (a) and (b), they study the delay characteristics of the algorithm, for the two classes of data traffic. With appropriate selection of the two window sizes, the algorithm can attain relatively high throughput, while it simultaneously maintains low expected per high-priority packet delays, whose values are only slightly affected by the total traffic rate

Published in:

Communications, IEEE Transactions on  (Volume:40 ,  Issue: 1 )