Abstract
The overview of a mathematical model for multicast routing supporting shared explicit reservation of link resource was presented, which is introduced by linear expressions that responsible for ensuring the connectivity of the calculated multicast routes, as well as the absence of loops in them. The novelty of the model consists in introducing conditions for preventing congestion of communication links when implementing a shared explicit reservation, in which a link resource is allocated to several flows simultaneously, but the list of these flows is strictly defined. The task of routing multicast flows supporting shared explicit reservation of link resource is formulated as an optimization problem of mixed integer linear programming. The use of the proposed model makes it possible to exploit the available link resource more efficiently (on average, from 15 to 25%) by ensuring the consistency of solutions for multicast routing tasks and organizing of the shared explicit reservation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Eskişehir Technical University Journal of Science and Technology A - Applied Sciences and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
