Cart (Loading....) | Create Account
Close category search window

Deriving time complexities for a class of distributed gradient projection-based optimal routing 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

3 Author(s)
Antonio, John K. ; Sch. of Electr. Eng., Purdue Univ., West Lafayette, IN, USA ; Huang, G.M. ; Tsai, W.K.

An upper bound is derived for the time complexity of the gradient projection-based optimal routing algorithm for data communication networks of D.P. Bersekas et al. (MIT Tech. Rep. LIDS-P-1364, Feb. 1984). The overall time complexity of the algorithm is given by the product of the complexity of each iteration and the complexity of the number of iterations needed to converge. It turns out that the complexity of each iteration is dominated by the time required to solve shortest path problems, and is therefore straightforward to estimate. On the other hand, estimating a meaningful bound for the number of iterations needed for convergence presents a formidable challenge, and is therefore the main focus of this study. Classical techniques are not readily applicable to the problem at hand since the eigenvalues of the Hessian depend on factors such as network topology and traffic demand patterns in a very nontractable way. In this paper, an alternate analysis technique is developed which yields an upper bound for the number of iterations needed for convergence to within a small neighborhood of the optimal solution

Published in:

Decision and Control, 1990., Proceedings of the 29th IEEE Conference on

Date of Conference:

5-7 Dec 1990

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.