By Topic

Proactive Routing for Congestion Avoidance in Network Recovery under Single-Link Failures

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)
Rojas-Cessa, R. ; Dept. of Electr. & Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA ; Zhen Qin

Routing schemes for network recovery aim to find connection paths under the scenarios of link or node failures that disrupt end-to-end connectivity. Several recovery schemes consider a proactive search for alternative links (or paths) that can restore the lost connectivity after the failure. However, the effect that the modification of network traffic after the switch over the alternative paths brings can undermine the objective of these schemes as links can become overloaded. This effect can cause temporary instability, requiring a new selection of paths and interrupt communications. This new search would defeat the purpose of pro-actively disposing of alternative paths. To address this issue, this paper proposes an on-demand and proactive routing approach, where the demand is based on providing new paths for existing network traffic while avoiding link congestion. Because some links may get congested in an attempt to accommodate re-routed flows in a recovery tree, on-demand routing is based on the selection of paths according to the existing traffic load in the failed link and the available bandwidth in the alternative links. This approach produces one or multiple-paths from source nodes to destination nodes to satisfy network load requirements and to avoid interruptions produce by route oscillations. The proposed scheme can create as many trees as needed to satisfy traffic flowing.

Published in:

Tools with Artificial Intelligence, 2009. ICTAI '09. 21st International Conference on

Date of Conference:

2-4 Nov. 2009