Advertisement

Autonomous Optimization of Next Generation Networks

  • Uwe Walter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4725)

Abstract

For an efficient usage of the transmission capacity of a QoS-supporting Next Generation Network, it is beneficial to influence the routing of traffic flows by the optimization of link metrics. Deploying a Network Admission Control at the network border helps to comply with assured service guarantees as it can effectively protect against overload situations, especially in times of varying traffic matrices or failures.

Since the manual adaptation of link metrics and NAC budgets is neither quick nor efficient, it makes sense to integrate these optimization algorithms into a self-configuration tool, which is able to autonomously keep the network in the best possible operational condition. This paper presents a management system that re-optimizes link metrics and NAC budgets when necessary. Different scenarios show the benefits of this approach for an increased network resilience and efficient operation.

Keywords

Link Failure Network Utilization Reference Network Failure Scenario Bidirectional Link 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Fortz, B., Thorup, M.: Internet Traffic Engineering by Optimizing OSPF weights. In: Proceedings of IEEE Infocom, IEEE Computer Society Press, Los Alamitos (2000)Google Scholar
  2. 2.
    Riedl, A.: A Genetic Algorithm for Routing Optimization in IP Networks Utilizing Bandwidth and Delay Metrics. In: Proceedings of IEEE Workshop on IP Operations and Management IPOM, Dallas, IEEE Computer Society Press, Los Alamitos (2002)Google Scholar
  3. 3.
    Ericsson, M., Resende, M., Pardalos, P.: A genetic algorithm for the weight setting problem in OSPF routing. Journal of Combinatorial Optimization 6(3) (September 2002)Google Scholar
  4. 4.
    Fortz, B., Thorup, M.: Optimizing OSPF/IS-IS Weights in a Changing World. IEEE Journal on Selected Areas in Communications 20(4) (May 2002)Google Scholar
  5. 5.
    Fortz, B., Rexford, J., Thorup, M.: Traffic Engineering With Traditional IP Routing Protocols. IEEE Com. Mag. 40(10) (October 2002)Google Scholar
  6. 6.
    Rexford, J.: Handbook of Optimization in Telecommunications. Kluwer Academic Publishers, Dordrecht (2005)Google Scholar
  7. 7.
    Nucci, A., Schroeder, B., Bhattacharyya, S., Taft, N., Diot, C.: IGP Link Weight Assignment for Transient Link Failures. In: Proceedings of the 18th International Teletraffic Congress (ITC-18), Berlin, Germany (August 2003)Google Scholar
  8. 8.
    Fortz, B., Thorup, M.: Robust optimization of OSPF/IS-IS weights. In: Proceedings of International Network Optimization Conference (INOC), Evry/Paris, France (October 2003)Google Scholar
  9. 9.
    Reichert, C., Magedanz, T.: A Fast Heuristic for Genetic Algorithms in Link Weight Optimization. In: 5th International Workshop on Quality of Future Internet Services (QoFIS), Barcelona, Spain (September 2004)Google Scholar
  10. 10.
    Hasslinger, G., Schnitter, S., Franzke, M.: The Efficiency of Traffic Engineering with Regard to Link Failure Resilience. Telecommunication Systems Journal 29(2) (June 2005)Google Scholar
  11. 11.
    Hoogendoorn, C., Charzinski, J., Schrodi, K., Heldt, N., Huber, M., Winkler, C., Riedl, J.: Towards the Next Generation Network. In: ICNP 2004. 12th IEEE International Conference on Network Protocols, Berlin, Germany, IEEE Computer Society Press, Los Alamitos (2004)Google Scholar
  12. 12.
    Schrodi, K.: High Speed Networks for Carriers. In: Carle, G., Zitterbart, M. (eds.) PfHSN 2002. LNCS, vol. 2334, Springer, Heidelberg (2002)Google 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
  14. 14.
    Mocci, U., Virtamo, J., Roberts, J.: Broadband Network Traffic: Performance Evaluation and Design of Broadband Multiservice Networks: Final Report of Action Cost 242. Springer, New York (1999)Google Scholar
  15. 15.
    Labourdette, J.F., Hart, G.: Blocking Probabilities in Multitraffic Loss Systems: Insensitivity, Asymptotic Behaviour and Approximations. IEEE Transactions on Communications 40(8) (August 1992)Google Scholar
  16. 16.
    Nilson, A.A., Perry, M., Gersht, A., Iversen, V.: On multi-rate Erlang-B Computations. In: Proceedings of 16th International Teletraffic Congress (ITC 16), Edinburgh, Scotland (June 1999)Google Scholar
  17. 17.
    Charzinski, J., Walter, U.: Optimized Incremental Network Planning. In: Proceedings of the 13th GI/ITG Conference on Measuring, Modelling and Evaluation of Computer and Communication Systems, 27.-29.3, Nürnberg, Germany, GI ITG, VDE Verlag (March 2006) 349–362 (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Uwe Walter
    • 1
  1. 1.Institute of Telematics – Universität Karlsruhe (TH), Zirkel 2, 76128 KarlsruheGermany

Personalised recommendations