Mathematical model for multicast routing of flows with shared explicit reservation

• Main Authors: Fitria, Rizka, Suwilo, Saib, Rosmaini, Elly
• Format: Conference Proceeding
• Language: English
• Subjects: Communications systems; Integer programming; Linear programming; Multicasting; Optimality criteria; Optimization; Packets (communication); Quality of service architectures
• ISSN: 0094-243X; 1551-7616
• DOI: 10.1063/5.0198883

The problem of difficulty in network communication systems has become a common problem that is widely discussed in the fields of mathematics and computer science. A common problem in constructing routes for data packets to be successfully transferred from a source to a number of destinations is the multicast routing problem. Frequent routing problems usually include a minimum average delay from source to destination, resource usage costs, load on the network, and performance on the network. This problem requires optimization in order to produce optimal solutions for each problem. This problem can usually be solved using minimum or maximum Quality of Service (QoS) parameters, but the solution does not always provide optimal user network resources. In this study, optimality criteria or explicit reservation solutions will be used, which are developed with a mixture of linear programming that aims to minimize resources including time, cost, and bandwidth so that all routing from one or more data sources to destinations can be minimized. Mixed-linear integer programming is used to build multicast routing optimization problems so that the proposed model uses available resources more efficiently.