By Topic

An efficient heuristic for the design of a survivable network architecture for dynamic routing

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)
Ouveysi, I. ; Telstra Res. Labs., Australia ; Wirth, A.

We investigate network planning and design under volatile conditions of link failures and traffic overload. Given the end-to-end traffic requirements, we generate a maximum spanning tree that can carry the traffic of any one origin-destination pair. The maximum spanning tree is augmented to handle any two simultaneous link failures or congestions. Then the augmented maximum spanning tree is synthesized by the algorithm of Gomory and Hu (1961) on the physically diverse links. We prove that the resulting network can provide full protection for the original network in the case of any two link failures unless both are from the maximum spanning tree. Using a linear programming optimization model, we update the synthesized network to handle any two link failures (or congestions) of the original network

Published in:

Global Telecommunications Conference, 1995. GLOBECOM '95., IEEE  (Volume:2 )

Date of Conference:

14-16 Nov 1995