TY - GEN
T1 - Load-balanced IP fast failure recovery
AU - Zhang, Mingui
AU - Liu, Bin
AU - Zhang, Beichuan
PY - 2008
Y1 - 2008
N2 - As a promising approach to improve network reliability, Proactive Failure Recovery (PFR) re-routes data traffic to backup paths without waiting for the completion of routing convergence after a local link failure. However, the diverted traffic may cause congestion on the backup paths if it is not carefully split over multiple paths according to their available capacity. Existing approach assigns new link weights based on links' load and re-calculates the routing paths, which incurs significant computation overhead and is susceptible to route oscillations. In this paper, we propose an efficient scheme for load balancing in PFR. We choose an adequate number of different types of loop-free backup paths for potential failures, and once a failure happens, the affected traffic is diverted to multiple paths in a well balanced manner. We formulate the traffic allocation problem as a tractable linear programming optimization problem, which can be solved iteratively and incrementally. As a result, only the flows affected by the failures are re-allocated to backup paths incrementally without disturbing flows not directly affected by the failures. Simulation results show that our scheme is computationally efficient, can effectively balance link utilization in the network, and can avoid route oscillations.
AB - As a promising approach to improve network reliability, Proactive Failure Recovery (PFR) re-routes data traffic to backup paths without waiting for the completion of routing convergence after a local link failure. However, the diverted traffic may cause congestion on the backup paths if it is not carefully split over multiple paths according to their available capacity. Existing approach assigns new link weights based on links' load and re-calculates the routing paths, which incurs significant computation overhead and is susceptible to route oscillations. In this paper, we propose an efficient scheme for load balancing in PFR. We choose an adequate number of different types of loop-free backup paths for potential failures, and once a failure happens, the affected traffic is diverted to multiple paths in a well balanced manner. We formulate the traffic allocation problem as a tractable linear programming optimization problem, which can be solved iteratively and incrementally. As a result, only the flows affected by the failures are re-allocated to backup paths incrementally without disturbing flows not directly affected by the failures. Simulation results show that our scheme is computationally efficient, can effectively balance link utilization in the network, and can avoid route oscillations.
KW - Failure recovery
KW - Linear programming
KW - Load balance
KW - OSPF
UR - http://www.scopus.com/inward/record.url?scp=56649103582&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=56649103582&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-87357-0_5
DO - 10.1007/978-3-540-87357-0_5
M3 - Conference contribution
AN - SCOPUS:56649103582
SN - 3540873562
SN - 9783540873563
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 53
EP - 65
BT - IP Operations and Management - 8th IEEE International Workshop, IPOM 2008, Proceedings
T2 - 8th IEEE International Workshop on IP Operations and Management, IPOM 2008
Y2 - 22 September 2008 through 26 September 2008
ER -