By Topic

Throughput properties of fair policies in ring networks

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
$33 $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)
L. Georgiadis ; IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA ; R. Guerin ; I. Cidon

Considers a slotted ring in which simultaneous transmission of messages by different stations is allowed, a property referred to as spatial reuse. Ring networks with spatial reuse can achieve significantly higher throughput than standard token rings but they also introduce the possibility of starvation for some nodes on the ring. To alleviate this problem, various policies have been suggested in the literature. The present objective is to characterize the node throughputs achievable by general transmission policies in ring networks with spatial reuse and then to evaluate the throughput trade-off for a class of policies that has been proposed in the literature in order to avoid starvation. Specifically, the authors study a policy that is based on the idea of allocating transmission quotas to the nodes. Each node is guaranteed transmission of his quota within a specified interval. The authors show that by appropriately allocating the quotas, policies that satisfy general optimality criteria-in particular criteria related to fairness-can be designed. They also study the asymptotic behavior of the quota policy when either the quotas or the number of nodes increase

Published in:

IEEE/ACM Transactions on Networking  (Volume:1 ,  Issue: 6 )