Abstract
Autonomicity, realized through control-loop structures operating within network devices and the network as a whole, is an enabler for advanced and enriched self-manageability of network devices and networks. In this paper, we argue that the degree of self-management and self-adaptation embedded by design into existing protocols needs to be well understood before one can enhance or integrate such protocols into self-managing network architectures that exhibit more advanced autonomic behaviors. We justify this claim through an illustrative case study: we show that the well-known and extensively used intra-domain IP routing protocol, OSPF, is itself a quite capable self-managing entity, complete with all the basic components of an autonomic networking element like embedded control-loops, decision-making modules, distributed knowledge repositories, etc. We describe these components in detail, concentrating on the numerous control-loops inherent to OSPF, and discuss how some of the control-loops can be enriched with external decision making logics to implement a truly self-adapting routing functionality.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Moy, J.: OSPF Version 2. RFC 2328 (April 1998)
Oran, D.: OSI IS-IS Intra-domain Routing Protocol. RFC 1142 (February 1990)
Fortz, B., Thorup, M.: Internet traffic engineering by optimizing OSPF weights. In: INFOCOM (2), pp. 519–528 (2000)
Ballani, H., Francis, P.: Conman: a step towards network manageability. SIGCOMM Comput. Commun. Rev. 37(4), 205–216 (2007)
Chaparadza, R., Papavassiliou, S., Kastrinogiannis, T., Vigoureux, M., Dotaro, E., Davy, A., Quinn, K., Wodczak, M., Toth, A.: Creating a viable evolution path towards self-managing future internet via a standardizable reference model for autonomic network engineering. In: Proceedings of FIA 2009, Prague (May 2009)
The EFIPSANS Project, http://www.efipsans.org
Katz, D., Kompella, K., Yeung, D.: Traffic Engineering (TE) Extensions to OSPF Version 2. RFC 3630 (September 2003)
Kompella, K., Rekhter, Y.: OSPF Extensions in Support of Generalized Multi-Protocol Label Switching (GMPLS). RFC 4203 (October 2005)
Apostolopoulos, G., Kama, S., Williams, D., Guerin, R., Orda, A., Przygienda, T.: QoS Routing Mechanisms and OSPF Extensions. RFC 2676 (August 1999)
Villamizar, C.: OSPF Optimized Multipath (OSPF-OMP). Internet Draft (February 1999)
Shand, M., Bryant, S.: IP Fast Reroute Framework. Internet Draft (February 2009)
Katz, D., Ward, D.: Bidirectional forwarding detection. Internet Draft (February 2009)
Enyedi, G., Szilágyi, P., Rétvári, G., Császár, A.: IP Fast ReRoute: Lightweight Not-Via without additional addresses. To appear at INFOCOM 2009 (May 2009)
Levchenko, K., Voelker, G.M., Paturi, R., Savage, S.: XL: an efficient network routing algorithm. SIGCOMM Comput. Commun. Rev. 38(4), 15–26 (2008)
Pei, G., Gerla, M., Chen, T.W.: Fisheye state routing: A routing scheme for ad hoc wireless networks. In: Proceedings of ICC 2000, New Orleans, LA (June 2000)
Khanna, A., Zinky, J.: The revised arpanet routing metric. SIGCOMM Comput. Commun. Rev. 19(4), 45–56 (1989)
Rétvári, G., Bíró, J.J., Cinkler, T.: On shortest path representation. IEEE/ACM Trans. Netw. 15(6), 1293–1306 (2007)
Thorup, M.: OSPF areas considered harmful. Internet Draft (April 2003)
Teixeira, R., Shaikh, A., Griffin, T., Rexford, J.: Dynamics of hot-potato routing in IP networks. SIGMETRICS Perform. Eval. Rev. 32(1), 307–319 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rétvári, G., Németh, F., Chaparadza, R., Szabó, R. (2009). OSPF for Implementing Self-adaptive Routing in Autonomic Networks: A Case Study. In: Strassner, J.C., Ghamri-Doudane, Y.M. (eds) Modelling Autonomic Communications Environments. MACE 2009. Lecture Notes in Computer Science, vol 5844. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05006-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-05006-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05005-3
Online ISBN: 978-3-642-05006-0
eBook Packages: Computer ScienceComputer Science (R0)