By Topic

Near-optimal virtual path routing for survivable 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
$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

2 Author(s)
K. Murakami ; Dept. of Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, USA ; H. S. Kim

Addresses the problem of virtual path routing for survivable ATM networks. An algorithm is developed to find a virtual path configuration and bandwidth assignment which minimizes the expected amount of lost flow upon network restoration from a failure. The concept of two-step restoration is introduced to achieve fast restoration as well as optimal reconfiguration. The problem can be formulated as a nonlinear nonsmooth multicommodity flow problem with linear constraints. A modified flow deviation approach is developed to obtain the steepest decent direction for a nonsmooth objective function. Based on the proposed scheme, convergence to a near-optimum is possible by properly adjusting optimization parameters

Published in:

INFOCOM '94. Networking for Global Communications., 13th Proceedings IEEE

Date of Conference:

12-16 Jun 1994