By Topic

An incentive compatible flow control algorithm for rate allocation in computer 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
$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

1 Author(s)
Sanders, B.A. ; Inst. fur Inf., Eidgenossiche Tech. Hochschule Zurich, Switzerland

The dynamic resource sharing that is a characteristic of store-and-forward computer/communication networks allows efficient use of the communication channel but may result in congestion and unfairness with high utilizations. A flow control algorithm is presented to prevent these effects by fairly allocating input rates to the users of the network. The allocation of rates is posed as an optimization problem where users derive a quantifiable benefit (unknown a priori and depending on network performance) from their use of the network. Total benefits are maximized using information reported by the users in a gradient hill climbing algorithm. The incentive problems that arise are examined, and an incentive-compatible pricing mechanism is introduced that prevents strategic manipulation of the algorithm

Published in:

Computers, IEEE Transactions on  (Volume:37 ,  Issue: 9 )