Abstract:
In the current article the problem of finding a connected subnet of the nodes with additional functionality is considered to organize two-level routing. Finding of such nodes is performed by the method of data aggregation of network elements. Also a comparison of these results with the similar ones obtained by minimal cut method is carried out.