6th International ICST Symposium on Modeling and Optimization

Research Article

Using Stochastic Approximation to Design OSPF Routing Areas that Satisfy Multiple and Diverse End-to-End Performance Requirements

Download448 downloads
  • @INPROCEEDINGS{10.4108/ICST.WIOPT2008.3197,
        author={Kyriakos Manousakis and Anthony J. McAuley},
        title={Using Stochastic Approximation to Design OSPF Routing Areas that Satisfy Multiple and Diverse End-to-End Performance Requirements},
        proceedings={6th International ICST Symposium on Modeling and Optimization},
        publisher={IEEE},
        proceedings_a={WIOPT},
        year={2008},
        month={8},
        keywords={OSPF routing areas; scalability; manageability; optimization; system capacity; end-to-end performance},
        doi={10.4108/ICST.WIOPT2008.3197}
    }
    
  • Kyriakos Manousakis
    Anthony J. McAuley
    Year: 2008
    Using Stochastic Approximation to Design OSPF Routing Areas that Satisfy Multiple and Diverse End-to-End Performance Requirements
    WIOPT
    IEEE
    DOI: 10.4108/ICST.WIOPT2008.3197
Kyriakos Manousakis1,*, Anthony J. McAuley1,*
  • 1: Applied Research, Telcordia Technologies, Piscataway, NJ, 08901
*Contact email: kyriakos@research.telcordia.com, mcauley@research.telcordia.com

Abstract

Dividing an Open Shortest Path First (OSPF) Autonomous System (AS) into independent routing areas allows area topology abstraction, reducing route overhead, table size, and convergence time, while providing some isolation from bad routing data. On the contrary, areas reduce connectivity, while increasing configuration complexity, routing path length, and traffic concentration. The formation of performance efficient OSPF areas subject to multiple requirements is known to be NP-complete problem; however, some simple heuristics have been used to optimize for particular routing metrics. For example, a min-cut can be used to ensure balanced number of nodes per area. However, no existing tools can optimize for actual end-to-end performance requirements or take into account the characteristics of network topology. This paper describes a fast and flexible optimization tool that automates the design of Open Shortest Path First (OSPF) routing areas to meet heterogeneous end-to-end performance requirements. The tool is based on an enhanced version of Simulated Annealing (SA) algorithm, which is a general stochastic approximation method capable of handling multiple, diverse and conflicting requirements (multi-objective optimization). The Simulated Annealing based tool can provide from highly optimized solutions for network planners designing conventional wired OSPF networks with known application flows to scalability and robust solutions in wireless networks using MANET OSPF extensions with changing application needs. This paper formulates the OSPF areas design as a weighted-sum multi-objective optimization of routing metrics to maximize user capacity, while minimizing the increased delay and lost connectivity. For diverse topologies, we show significantly reduced user delay (over 25%) and increased available bandwidth (by over 400%). Further, we show that by simply adjusting the weights, the tool can prioritize the performance requirements and adapt to heterogeneous network environments.