Amin, MinaMinaAminDr. HO Kin-Hon, RoyRoyDr. HO Kin-HonWang, NingNingWangHowarth, MichaelMichaelHowarthPavlou, GeorgeGeorgePavlou2024-03-182024-03-182008Amin, Mina, Ho, Kin Hon, Wang, Ning, Howarth, Michael & Pavlou, George (2008). Making IP traffic engineering robust to intra- and inter-AS transient link failures. In IEEE (Ed.). NOMS 2008 - 2008 IEEE network operations and management symposium. NOMS 2008 - 2008 IEEE Network Operations and Management Symposium, Salvador, Brazil. IEEE.978142442065097814244206671542-12012374-9709http://hdl.handle.net/20.500.11861/9067Intra- and inter-AS transient link failures are common in operational IP networks. Robust intra- and inter-AS traffic engineering (TE) schemes have been proposed to optimize network performance against transient link failures. The existing literature has focused solely on either intra- or inter-AS link failure. They have, however, neglected the interactions between robust intra- and inter-AS TE, specifically the impact of intra-AS link failure on inter-AS TE and vice versa. As a result, the overall network performance may not be truly robust to link failures if the interactions are neglected. This paper proposes a joint robust TE approach that takes the interactions into account for achieving good network performance under both normal state and any single intra- or inter-AS link failure. We propose a two-phase heuristic to solve the problem and compare its performance with four alternative approaches that do not consider the interactions. Evaluation results reveal that our joint robust TE approach achieves higher robustness against intra- and inter-AS link failures than all the alternatives.enLink FailureTraffic EngineeringTransient FailureNormal ConditionsHeuristicNetwork PerformanceSingle LinkageSingle FailureImpact Of FailureObjective FunctionMinimalistPerformance MetricsWork In This AreaNetwork TopologyFeasible SolutionTraffic FlowHighest UseLoad BalancingIncrease In UtilizationFailure ConditionsLink WeightsConstraint ValueTraffic AssignmentLocal Search AlgorithmObjective Of This ApproachTabu SearchNetwork UtilityLink CapacityNotable WorkDegradation CostConference Paper10.1109/NOMS.2008.4575120