By Topic

The structural property of network bottlenecks in maxmin fair flow control

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

In this letter we introduce a new conceptual framework to investigate into 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 there can be many bottleneck rates on each hierarchical level. So H can be much smaller than K.

Published in:

Communications Letters, IEEE  (Volume:2 ,  Issue: 3 )