Minimizing packet loss by optimizing OSPF weights using online simulation

Abstract

In this paper, we present a scheme for minimizing packet loss in OSPF networks by optimizing link weights using online simulation. We have chosen packet loss rate in the network as the optimization metric as it is a good indicator of congestion and impacts the performance of the underlying applications. We have formulated packet loss rate in the network in terms of the link parameters, such as bandwidth and buffer space, and the parameters of the traffic demands. A GI/M/1/K queuing model has been used to compute the packet drop probability on a given link. The problem of optimizing OSPF weights is known to be NP-hard even for the case of a linear objective function Bernard Fortz and Mikkel Thorup (2000), We use online simulation (OLS) framework T. Ye et al. (2001) to search for a good link weight setting and as a tool for automatic network management. OLS uses fast, scalable recursive random search (RRS) algorithm to search the parameter space. Our results demonstrate that the RRS takes 50-90% fewer function evaluations as compared to the local search heuristic Bernard Fortz and Mikkel Thorup (2000) of to find a "good" link weight setting. The amount of improvement depends on the network topology, traffic conditions and optimization metric. We have simulated the proposed OSPF optimization scheme using ns and our results demonstrate improvements of the order of 30-60% in the total packet drop rate for the traffic and topologies considered.