Approaches to selection of combinatorial algorithm for optimization in network traffic control of safety-critical systems

Traffic control in modern computer networks, including those within critical infrastructures (e.g. Nuclear Power Plants), implies various optimization problems solving by switching/routing devices in real time. Some of such problems include, for example, choosing of optimal route, distribution of data packets during multiway routing, redistribution of both service and user data, efficient changing of virtual configuration in network segment containing a bottleneck, which, in turn, appeared due to fault or failure of some physical links. In a majority of cases, input data in such problems have a discrete character (for example, traffic samples, statistical estimations, etc.); hence, it is inevitable to use algorithms of discrete optimization. Combinatorial algorithms for finding the solution in discrete optimization problem, applied to switching/routing nodes of critical infrastructures' networks, are considered. Conditions for selection of algorithm type, depending on nature of the problem, are determined. Implicit enumeration algorithms on lacing and tree, as well as algorithms of dynamic programming method are analyzed in details.