By Topic

Studies on distributed algorithm for network flow optimization problem based on tie-set flow vector space

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)
Y. Shibata ; Grad. Sch., Soka Univ., Tokyo, Japan ; H. Kubo ; H. Watanabe

Information networks have progressed rapidly toward large and complicated systems, and the amount of the information flowing through the networks is also increasing dramatically. Under these circumstances, it is important to establish distributed network management which utilizes network resources effectively. This paper presents a new approach to network optimization problems based on the theory of tie-set graph and tie-set flow vector space. A new distributed algorithm for network optimization is proposed, where local optimization on each tie-set leads to the global optimization of the network, autonomously. The proposed distributed algorithm can be applied to various network optimization problems.

Published in:

Circuits and Systems, 2004. ISCAS '04. Proceedings of the 2004 International Symposium on  (Volume:4 )

Date of Conference:

23-26 May 2004