Departmental Papers (ESE)


An important requirement of a robust traffic engineering solution is insensitivity to changes, be they in the form of traffic fluctuations or changes in the network topology because of link failures. In this paper we focus on developing a fast and effective technique to compute traffic engineering solutions for OSPF/IS-IS environments that are robust to link failures in the logical topology. OSPF and IS-IS are the dominant intra-domain routing protocols where traffic engineering is primarily governed by link weights. Our focus is on computing a single set of link weights for a traffic engineering instance that performs well over all single logical link failures. Such types of failures, although usually not long lasting, of the order of tens of minutes, can occur with high enough frequency, of the order of several a day, to significantly affect network performance. The relatively short duration of such failures coupled with issues of computational complexity and convergence time due to the size of current day networks discourage adaptive reactions to such events. Consequently, it is desirable to a priori compute a routing solution that performs well in all such scenarios. Through computational evaluations we demonstrate that our technique yields link weights that perform well over all single link failures and also scales well, in terms of computational complexity, with the size of the network.

Document Type

Conference Paper

Date of this Version

May 2005


Postprint version. Published in Lecture Notes in Computer Science, Volume 3462, NETWORKING 2005: Proceedings of the 4th International IFIP-TC6 Networking Conference 2005, pages 634-646.
Publisher URL:


Network, Routing, Robustness, Traffic Engineering, IGP, Optimization, link failures



Date Posted: 26 July 2005

This document has been peer reviewed.