By Topic

Optimal routing algorithm for high-speed (ATM) networks

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)
Sung-Woo Park ; Dept. of Inf. & Commun. Eng., Han-Nam Univ., Daejeon, South Korea ; Tsai, W.K.

The gradient-projection (GP) technique is used to solve the optimal routing problem (ORP) for high-speed asynchronous transfer mode (ATM) networks. The ORP minimizing network average packet loss probability is complicated due to packet losses at intermediate switching nodes, and the problem is nonconvex. The nonconvex ORP is transformed into a convex ORP called the reduced-ORP (R-ORP), and the GP algorithm is used to obtain a routing solution. The solution obtained for the R-ORP is shown to be a good approximation of the globally optimal solution for the ORP for realistic network operating conditions. A theoretical upper bound of the difference between the R-ORP solution and the ORP solution is derived

Published in:

INFOCOM '93. Proceedings.Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking: Foundation for the Future, IEEE

Date of Conference:

1993