Model of multicast routing with support of shared explicit reservation of link resources

In this paper the mathematical model of multicast routing of flows with support shared explicit reservation of link resources is proposed. The proposed model consists of a linear expressions, which are responsible for providing the connectivity of the calculated multicast routes, and also the absence of loops in them. The novelty of the model is the using of conditions of prevention the congestion in communication links due the implementation of the shared explicit reservation, which allows allocating the links resource between multiple flows, but at the same time the list of these flows is strictly defined. The optimization problem of multicast routing of flows with support shared explicit reservation of link resources is formulated as the task of mixed integer linear programming. Using the proposed model allows to use the available link resource more efficient (on average 20-25%) by providing the coherence of solutions of multicast routing problem and organization of shared explicit reservation of link resources.