By Topic

The convergence properties of distributed maxmin fair rate allocation 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)
Wangdong Qi ; Nanjing Inst. of Commun. Eng., China ; Xiren Xie

We introduce a new conceptual framework to investigate the underlying structure of network bottlenecks in maxmin fair flow control. It is shown that a network has a hierarchical structure with regard to its bottlenecks. The number, H, of network bottleneck levels is proved to be no greater than the number, K, of network bottleneck rates. It is also shown that H can be much smaller than K. We propose a new computational model of maxmin fair rate allocation based on the structural property of network bottlenecks. It is shown that in comparison with a widely used computational model, this one provides a better description of the convergence processes of a class of distributed maxmin fair rate allocation (DMFRA) algorithms. As a natural outcome, we also obtain new and tighter upper bounds on the convergence time of these algorithms

Published in:

Communication Technology Proceedings, 2000. WCC - ICCT 2000. International Conference on  (Volume:2 )

Date of Conference: