Abstract
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.
Keywords
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.
This work was funded by the Bavarian Ministry of Economic Affairs and the German Research Foundation (DFG). The authors alone are responsible for the content of the paper.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Moy, J.: RFC2328: OSPF Version 2 (April 1998)
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)
Oran, D.: RFC1142: OSI IS-IS Intra-Domain Routing Protocol (Feburary 1990)
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)
McQuilan, J.M., Richer, I., Rosen, E.C.: The New Routing Algorithm for the ARPANET. IEEE Transactions on Communications 28(5) (May 1980)
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)
Vasseur, J.-P., Pickavet, M., Demeester, P.: Network Recovery, 1st edn. Morgan Kaufmann / Elsevier (2004)
Narvaez, P.: Routing Reconfiguration in IP Networks. PhD thesis, Massachusetts Institut of Technology (MIT) (June 2000)
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)
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)
Buriol, L., Resende, M., Thorup, M.: Speeding up Dynamic Shortest Path Algorithms. AT&T Labs Research, Technical Report TD-5RJ8B (2003)
Disjkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1, 269–271 (1959)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Menth, M., Milbrandt, J., Lehrieder, F. (2006). Algorithms for Fast Resilience Analysis in IP Networks. In: Parr, G., Malone, D., Ó Foghlú, M. (eds) Autonomic Principles of IP Operations and Management. IPOM 2006. Lecture Notes in Computer Science, vol 4268. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11908852_3
Download citation
DOI: https://doi.org/10.1007/11908852_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47701-3
Online ISBN: 978-3-540-47702-0
eBook Packages: Computer ScienceComputer Science (R0)