Load-balanced IP fast failure recovery

Mingui Zhang, Bin Liu, Beichuan Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages53-65
Number of pages13
Volume5275 LNCS
DOIs
StatePublished - 2008
Event8th IEEE International Workshop on IP Operations and Management, IPOM 2008 - Samos Island, Greece
Duration: Sep 22 2008Sep 26 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5275 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other8th IEEE International Workshop on IP Operations and Management, IPOM 2008
CountryGreece
CitySamos Island
Period9/22/089/26/08

Fingerprint

Recovery
Path
Linear programming
Resource allocation
Traffic
Routing
Oscillation
Network Reliability
Load Balancing
Congestion
Assign
Completion
Choose
Optimization Problem
Calculate
Simulation

Keywords

  • Failure recovery
  • Linear programming
  • Load balance
  • OSPF

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Zhang, M., Liu, B., & Zhang, B. (2008). Load-balanced IP fast failure recovery. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5275 LNCS, pp. 53-65). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5275 LNCS). https://doi.org/10.1007/978-3-540-87357-0_5

Load-balanced IP fast failure recovery. / Zhang, Mingui; Liu, Bin; Zhang, Beichuan.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5275 LNCS 2008. p. 53-65 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5275 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhang, M, Liu, B & Zhang, B 2008, Load-balanced IP fast failure recovery. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5275 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5275 LNCS, pp. 53-65, 8th IEEE International Workshop on IP Operations and Management, IPOM 2008, Samos Island, Greece, 9/22/08. https://doi.org/10.1007/978-3-540-87357-0_5
Zhang M, Liu B, Zhang B. Load-balanced IP fast failure recovery. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5275 LNCS. 2008. p. 53-65. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-87357-0_5
Zhang, Mingui ; Liu, Bin ; Zhang, Beichuan. / Load-balanced IP fast failure recovery. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5275 LNCS 2008. pp. 53-65 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{9ed4bbc0e2044d1b88ddefea4c7e81c4,
title = "Load-balanced IP fast failure recovery",
abstract = "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.",
keywords = "Failure recovery, Linear programming, Load balance, OSPF",
author = "Mingui Zhang and Bin Liu and Beichuan Zhang",
year = "2008",
doi = "10.1007/978-3-540-87357-0_5",
language = "English (US)",
isbn = "3540873562",
volume = "5275 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "53--65",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

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

VL - 5275 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 53

EP - 65

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -