Hierarchical method of routing and resource allocation in DiffServ-TE network

In this paper, we propose a How-based model and the hierarchical method of routing and resource allocation in DiffServ-TE network. This method is based on the interaction prediction principle due to a two-level functional hierarchy of calculation is organized in the method, and aimed at increasing their scalability and reducing computational complexity. At the lower level, the routing order is determined, and at the upper level, the link resource is allocated between flows with different classes of service. The numerical example confirms the convergence of the method to optimal solutions for a finite number of iterations. Also due to the use of the interaction prediction principle, the solution of the problem of route recalculation and the order of link resource allocation can be completed at an arbitrary iteration and the resulting solution will be acceptable and satisfy all the conditions and constraints.