Solutions of flow assignment task at unreliable computer communication networks

The aim of the paper is to present and discuss an idea of algorithm devoted to obtain approximate solution of flow assignment task formulated for unreliable network, i.e, network where failures of communication channels may occur. It is assumed that the sub-optimal solution of flow assignment task for unreliable network is available based on known flow assignment for reliable network. The main expected feature of the proposed algorithm is time required to obtain the solution with smaller accuracy. It is assumed that the optimal flow for the reliable network may be multiple reused to determine sub-optimal flow at network where failures of different communication channels may occur.