Preventive start-time optimization against network failure
Eiji Oki · 2014
This paper reviews research on preventive start-time optimization (PSO). PSO determines a suitable set of link weights in an open shortest path network at the network operation start time that can handle any link failure scenario preventively. PSO minimizes the worst-case congestion ratio in case of failure. PSO can avoid both unexpected network congestion and network instability. We formulate the original PSO problem as a mixed integer liner programming problem by extending the starttime optimization model and describe heuristic approaches. We also introduce mathematical programming models for the PSO variations. In addition, we expand PSO into generalized preventive start-time optimization (GPSO) to find a link weight set that balances both congestion ratios under no failure and the worst-case failure.