O.Ya. Kravets - Dr. Sci. (Eng.), professor, Voronezh State Technical University. E-mail: csit@ bk.ru
E.S. Podvalniy - Dr. Sci. (Eng.), professor, the Russian Presidential Academy of National Economy and Public Administration. E-mail: nauka@ rags.vrn.ru
A.V. Achkasov - Ph. D. (Eng.), Voronezh State Technical University. E-mail: achkasov@list.ru

This article considers the theoretical features of inter module interaction mechanisms in transient modes of functioning based on the wave algorithms. The analysis of the various algorithms of intersystem and inter module interaction reducible to the routing in terms of their structural stability during the reconfiguration of the controlled object layout necessitates a detailed study of the wave algorithms. Ensuring the permanent readiness of specialized complexes are complicated by the potential failure of the terrestrial network elements and their unregulated reconstruction inhibiting the system control in the transient operation modes. The useful properties of the Lee's wave algorithm in distributed systems have been considered previously. The routing algorithm is analyzed that guarantees message delivery regardless of the network condition, even if there is one subnet containing the source of the package and its receiver and is connected. The algorithm reliability characteristics are studied. The redundancy of the algorithm has been almost not investigated. The modifications of wave algorithm are mostly associated with using different stopping criteria of the floating packet. The existing stopping criteria and analyzed their advantages and disadvantages have been considered. For example in the transient modes when the network characteristics change and the modified network diameter is insufficient-the stopping criterion is being triggered prematurely, whereby the message is removed from the network, and does not reach the destination. For some applications the «cost» of packet loss is much higher than its «price» even at long staying in the network, and the algorithm based on a penalty evaluations, is unacceptable. In assessing the efficiency of the modifications of the wave algorithm assumed that the integral characteristics are explored. For the G graph induced layout, the three basic indexes are supposed to introduce: R (G) is the number of the received messages generated by a single transaction; P (G) is the number of transceiver needed for the complete cessation of the messages circulation; J (G) - the number of re-received messages during a transaction. The analysis provided enables the modified algorithm development. Upon the reception of the last message the recipient generates a special message, which propagates across the network, devouring both parental and subsidiary messages. The structure of some fields of the used service messages is also novel. The method of distributed control of rapid alert systems by then determinate layout network-based monitoring systems has been developed. A high-performance routing algorithm with proven unimprovability in the sense of minimum redundancy of the network data flows has been also developed.