OPTIMIZING HARD QOS AND SECURITY WITH DISJOINT PATH ROUTING

Abstract

Background. The combination of secure routing and hard QoS is a worthwhile topic that involves designing and implementing network protocols and systems that can provide high performance and robust protection for data flow due to shared goals. Secure QoS routing over disjoint paths is a challenging problem that requires balancing the trade-off between network security and bandwidth guarantees. Objective. This article investigates a mathematical model that can address secure QoS routing by formulating it as an optimization problem with a linear objective function and linear or bilinear constraints. The objective function aims to minimize the paths compromise probability, while the constraints ensure that the total bandwidth of the paths meets the QoS requirements. Methods. We use computer simulation of hard QoS and security with disjoint path routing. Also we use mathematical programming methods in order to describe secure QoS routing. Results. The article presents a numerical study of the model using different scenarios and parameters. The results show that the model can effectively provide secure QoS routing over disjoint paths with a high bandwidth guarantee level and a low compromise probability. The work analyses the sensitivity of the solutions to the QoS requirements and reveals that there is usually some margin in the bandwidth provision. Conclusions. The proposed model is a promising tool for secure QoS routing over disjoint paths in various network environments.