OPTIMIZING HARD QOS AND SECURITY WITH DISJOINT PATH ROUTING
DOI:
https://doi.org/10.20535/2411-2976.22023.33-39Keywords:
Quality of Service, security, routing, disjoint paths, bandwidth, compromise probabilityAbstract
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.
References
R. Lacoste and B. Edgeworth, CCNP Enterprise Advanced Routing ENARSI 300-410 Official Cert Guide, Cisco Press, 2020.
Medhi, D., Ramasamy, K. Network routing: Algorithms, Protocols, and Architectures; Morgan Kaufmann: San Francisco, CA, USA, 2017.
I.V. Strelkovskaya and I.N. Solovskaya, "Tensor model of multiservice network with different classes of traffic service", Radioelectron.Commun.Syst., vol. 56, pp. 296–303, 2013, doi: 10.3103/S0735272713060058.
I.V. Strelkovskaya, T.I. Grygoryeva and I.N. Solovskaya, "Self-Similar Traffic in G/M/1 Queue Defined by the Weibull Distribution", Radioelectron.Commun.Syst., vol. 61, pp. 128–134, 2018, doi: 10.3103/S0735272718030056.
O. Lemeshko, M. Yevdokymenko, O. Yeremenko, A. M. Hailan, P. Segeč and J. Papán, "Design of the Fast ReRoute QoS Protection Scheme for Bandwidth and Probability of Packet Loss in Software-Defined WAN," 2019 IEEE 15th International Conference on the Experience of Designing and Application of CAD Systems (CADSM), Polyana, Ukraine, 2019, pp. 1-5, doi: 10.1109/CADSM.2019.8779321.
O. Lemeshko, O. Yeremenko, M. Yevdokymenko, A. Shapovalova, A. M. Hailan and A. Mersni, "Cyber Resilience Approach Based on Traffic Engineering Fast ReRoute with Policing," 2019 10th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS), Metz, France, 2019, pp. 117-122, doi: 10.1109/IDAACS.2019.8924294.
W. Sun, Z. Wang and G. Zhang, "A QoS-guaranteed intelligent routing mechanism in software-defined networks", Computer Networks, vol. 185, p.107709, 2021, doi: 10.1016/j.comnet.2020.107709.
H. K. Deva Sarma, M. P. Dutta and M. P. Dutta, "A Quality of Service Aware Routing Protocol for Mesh Networks Based on Congestion Prediction," 2019 International Conference on Information Technology (ICIT), Bhubaneswar, India, 2019, pp. 430-435, doi: 10.1109/ICIT48102.2019.00082.
A. Mudgerikar and E. Bertino, "Intelligent Security Aware Routing: Using Model-Free Reinforcement Learning," 2023 32nd International Conference on Computer Communications and Networks (ICCCN), Honolulu, HI, USA, 2023, pp. 1-10, doi: 10.1109/ICCCN58024.2023.10230195.
S. Maheswari, N. Mishra, B. Shadaksharappa and T. M. Sivanesan, "Secured Dynamic Opportunistic Routing in Ad-hoc Wireless Network," 2023 2nd International Conference on Edge Computing and Applications (ICECAA), Namakkal, India, 2023, pp. 293-297, doi: 10.1109/ICECAA58104.2023.10212369.
B. M. Shruthi and C. Raju, "A Comprehensive Analysis on Trust Based Secure Routing Protocol used in Internet of Things (IoTs)," 2023 International Conference on Applied Intelligence and Sustainable Computing (ICAISC), Dharwad, India, 2023, pp. 1-4, doi: 10.1109/ICAISC58445.2023.10200961.
R. K. Mohanty, S. P. Sahoo and M. R. Kabat, "A Network Reliability based Secure Routing Protocol (NRSRP) for Secure Transmission in Wireless Body Area Network," 2023 8th International Conference on Communication and Electronics Systems (ICCES), Coimbatore, India, 2023, pp. 663-668, doi: 10.1109/ICCES57224.2023.10192691.
T. Gomes, L. Jorge, R. Girão-Silva, J. Yallouz, P. Babarczi and J. Rak, "Fundamental Schemes to Determine Disjoint Paths for Multiple Failure Scenarios", in Rak, J., Hutchison, D. (eds) Guide to Disaster-Resilient Communication Networks. Computer Communications and Networks, pp. 429–453, Springer, Cham, 2020, doi: 10.1007/978-3-030-44685-7_17.
D. Lopez-Pajares, E. Rojas, J. A. Carral, I. Martinez-Yelmo and J. Alvarez-Horcajo, "The Disjoint Multipath Challenge: Multiple Disjoint Paths Guaranteeing Scalability," in IEEE Access, vol. 9, pp. 74422-74436, 2021, doi: 10.1109/ACCESS.2021.3080931.
O. Lemeshko, O. Yeremenko, M. Yevdokymenko and B. Sleiman, "System of Solutions the Maximum Number of Disjoint Paths Computation Under Quality of Service and Security Parameters", in Ilchenko, M., Uryvsky, L., Globa, L. (eds) Advances in Information and Communication Technology and Systems. MCT 2019. Lecture Notes in Networks and Systems, vol. 152, pp. 191–205, Springer, Cham, 2021, doi: 10.1007/978-3-030-58359-0_10.
O. Lemeshko, O. Yeremenko, M. Yevdokymenko and B. Sleiman, "Research and Development of Bilinear QoS Routing Model over Disjoint Paths with Bandwidth Guarantees in SDN", in Hu, Z., Dychka, I., He, M. (eds) Advances in Computer Science for Engineering and Education VI. ICCSEEA 2023. Lecture Notes on Data Engineering and Communications Technologies, vol. 181, pp. 223–235, Springer, Cham, 2023, doi: 10.1007/978-3-031-36118-0_20.
D. Lopez-Pajares, J. Alvarez-Horcajo, E. Rojas, J. A. Carral and I. Martinez-Yelmo, "One-Shot Multiple Disjoint Path Discovery Protocol (1S-MDP)," in IEEE Communications Letters, vol. 24, no. 8, pp. 1660-1663, Aug. 2020, doi: 10.1109/LCOMM.2020.2990885.
Y. H. Robinson et al., "Link-Disjoint Multipath Routing for Network Traffic Overload Handling in Mobile Ad-hoc Networks," in IEEE Access, vol. 7, pp. 143312-143323, 2019, doi: 10.1109/ACCESS.2019.2943145.
K. Kaneko, S. V. Nguyen and H. T. T. Binh, "Pairwise Disjoint Paths Routing in Tori," in IEEE Access, vol. 8, pp. 192206-192217, 2020, doi: 10.1109/ACCESS.2020.3032684.
K. Sreeram, A. Unnisa, V. Poornima and S. Chaudhari, "QoS aware Multi-Constrained Node Disjoint Multipath Routing for Wireless Sensor Networks," 2019 5th International Conference on Advanced Computing & Communication Systems (ICACCS), Coimbatore, India, 2019, pp. 382-385, doi: 10.1109/ICACCS.2019.8728475.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 Oleksandr Lemeshko, Oleksandra Yeremenko, Maryna Yevdokymenko, Batoul Sleiman
This work is licensed under a Creative Commons Attribution 4.0 International License.
The ownership of copyright remains with the Authors.
Authors may use their own material in other publications provided that the Journal is acknowledged as the original place of publication and National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute” as the Publisher.
ITS articles are published under Creative Commons licence:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under CC BY 4.0that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
