In the present paper we have found Lapiace-Stiltiece transformation for the time of message delivery to the receiver, as well as its response in the form of appropriate controlling frames. We have obtained the expression for estimation of optimal mean value of scanning period. Boundary conditions of scanning period have been laid down for several routing methods. In telecommunication networks data streams control is realized using appropriate protocol procedures, whose main purposes are: maintenance of efficient network operation; ensuring of the required resources allocation; network overload protection.  The most of routing algorithms require fixed information interchange between the nodes (in order to choose control strategy), as well as commands interchange (in order to implement this strategy). This work is aimed toward the search of time parameters, which determine resources outlay for maintenance of optimal control conditions packet flows in telecommunication networks.  Protocols of packet streams control provide for categorization of interaction objects into masters and slaves (primary and secondary ones). In order to form routing tables, information is necessary about the instantaneous network state and its traffic.  Routing method, ensuring the better efficiency/cost ratio may be not very dynamical. It depends on information transmission/processing ratio at decisions making. In the process of simulation it has been determined that simple and cheap routing algorithms are better [1-3]. Optimal period of scanning of (i+1)(i+2)...(i+m)-nodes by i-node is determined by minimization of influence of scanning period on the network response time. In order to determine the influence of scanning on response of receiving node, Laplace-Stiltiece transformation has been obtained