Utility Max-Min Flow Control Using Slope-Restricted Utility Functions

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 773
  • Download : 424
We present a network architecture for the distributed utility max-min flow control of elastic and nonelastic flows where utility values of users (rather than data rates of users) are enforced to achieve max-min fairness. The proposed link algorithm converges to utility max-min fair bandwidth allocation in the presence of round-trip delays without using the information of users' utility functions. To show that the proposed algorithm can be stabilized not locally but globally, we found that the use of nonlinear control theory is inevitable. Even though we use a distributed flow-control algorithm, it is shown that any kind of utility function can be used as long as the minimum slopes of the functions are greater than a certain positive value. Though our analysis is limited to the single-bottleneck and homogeneous-delay case, we believe that the proposed algorithm is the first to achieve utility max-min fairness with guaranteed stability in a distributed manner.
Issue Date

Absolute stability; flow control; delay systems; nonlinear systems


: Communications, IEEE Transactions on, Volume: 55, Issue: 5, On page(s): 963-972

Appears in Collection
EE-Conference Papers(학술회의논문)
Files in This Item
Utility Max-Min Flow Control Using Slope-Restricted Utility Functions.pdf(1.29 MB)Download


  • mendeley


rss_1.0 rss_2.0 atom_1.0