Description: The analysis of structure of informative packages is conducted. Mathematical expressions are certain for the calculation of mean time of delivery of complete informative packages, and similarly informative packages of broken to pieces. Researches of dependence of relation of mean time of delivery of initial package are conducted to mean time of delivery of the fragmented package from the number of fragments at the arbitrary law of distributing of errors in a flow line. The criterion of optimum fragmentation of packages is chosen for achievement of the maximally possible diminishing of mean time of delivery of information. The algorithm of search of optimum number of fragments of informative package is developed.
Keywords: telecommunication network, network traffic, length of informative package, fragmentation, mean time of delivery of informative packages