Macro description of communication networks in the presence of transit flows

A macro description is offered for communication networks with transit flows. The computation complexity is practically independent of the number of channels in bunches. For communication networks where links between nodes complies with the principle every one with every one a comparison is made in many cases with the Mar­kov model. Little computer time is needed to implement the method.