Algorithms for Fast Resilience Analysis in IP Networks

  • Michael Menth
  • Jens Milbrandt
  • Frank Lehrieder
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4268)


When failures occur in IP networks, the traffic is rerouted over the next shortest paths and potentially causes overload on the respective links. This leads to congestion on links and to end-to-end service degradation. These can be anticipated by evaluating the bandwidth requirements of the traffic on the links after rerouting for a set of relevant failure scenarios \(\mathcal{S}\). As this set can be large in practice, a fast evaluation of the bandwidth requirements is needed. In this work, we propose several optimized algorithms for that objective together with an experimental assessment of their computation time. In particular, we take advantage of the incremental shortest path first (iSPF) algorithm to reduce the computation time.


Short Path Node Degree Node Failure Network Element Rate Vector 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Moy, J.: RFC2328: OSPF Version 2 (April 1998)Google Scholar
  2. 2.
    ISO. ISO 10589: Intermediate System to Intermediate System Routing Exchange Protocol for Use in Conjunction with the Protocol for Providing the Connectionless-Mode Network Service (1992)Google Scholar
  3. 3.
    Oran, D.: RFC1142: OSI IS-IS Intra-Domain Routing Protocol (Feburary 1990)Google Scholar
  4. 4.
    Iannaccone, G., Chuah, C.-N., Bhattacharyya, S., Diot, C.: Feasibility of IP Restoration in a Tier-1 Backbone. IEEE Network Magazine (Special Issue on Protection, Restoration and Disaster Recovery) (March 2004)Google Scholar
  5. 5.
    McQuilan, J.M., Richer, I., Rosen, E.C.: The New Routing Algorithm for the ARPANET. IEEE Transactions on Communications 28(5) (May 1980)Google Scholar
  6. 6.
    Francois, P., Filsfils, C., Evans, J., Bonaventure, O.: Achieving Sub-Second IGP Convergence in Large IP Networks. ACM SIGCOMM Computer Communications Review 35(2), 35–44 (2005)CrossRefGoogle Scholar
  7. 7.
    Vasseur, J.-P., Pickavet, M., Demeester, P.: Network Recovery, 1st edn. Morgan Kaufmann / Elsevier (2004)Google Scholar
  8. 8.
    Narvaez, P.: Routing Reconfiguration in IP Networks. PhD thesis, Massachusetts Institut of Technology (MIT) (June 2000)Google Scholar
  9. 9.
    El-Sayed, H., Ahmed, M., Jaseemuddin, M., Petriu, D.: A Framework for Performance Characterization and Enhancement of the OSPF Routing Protocol. In: IASTED International Conference on Internet and Multimedia Systems and Applications (EuroIMSA), Grindelwald, Switzerland (Feburary 2005)Google Scholar
  10. 10.
    Nelakuditi, S., Lee, S., Yu, Y., Zhang, Z.-L.: Failure Insensitive Routing for Ensuring Service Availability. In: Jeffay, K., Stoica, I., Wehrle, K. (eds.) IWQoS 2003. LNCS, vol. 2707, pp. 287–304. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  11. 11.
    Buriol, L., Resende, M., Thorup, M.: Speeding up Dynamic Shortest Path Algorithms. AT&T Labs Research, Technical Report TD-5RJ8B (2003)Google Scholar
  12. 12.
    Disjkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1, 269–271 (1959)CrossRefMathSciNetGoogle Scholar
  13. 13.
    Menth, M.: Efficient Admission Control and Routing in Resilient Communication Networks. PhD thesis, University of Würzburg, Faculty of Computer Science, Am Hubland (July 2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Michael Menth
    • 1
  • Jens Milbrandt
    • 1
  • Frank Lehrieder
    • 1
  1. 1.Institute of Computer ScienceUniversity of WürzburgGermany

Personalised recommendations