Fast rerouting algorithm in distributed computer networks based on subnet routing method

Rerouting processes are considered to be especially important in modern computer networks. To provide the quality of service (QoS) in conditions of network equipment overloads and failures the rerouting protocols used must provide continuous access to the network for end users. One of effective approaches of support of fault-tolerant routing is use of subnet routing method. The purpose of work is development of mathematical model and fast rerouting algorithm of data flows on the distributed computer networks based on subnet routing method. In the work the program emulator is developed and the comparative analysis of efficiency of the offered approach with some known algorithms of fast rerouting is carried out.