Model of secure routing based on determining the maximum number of disjoint paths to minimize the probability of compromise the confidential messages

Authors

  • А.В. Лемешко
  • А.С. Еременко
  • А.В. Персиков
  • Б. Слейман

DOI:

https://doi.org/10.30837/rt.2019.2.197.03

Keywords:

secure routing, probability of compromise, multipath routing, disjoint paths

Abstract

The paper proposes a model of secure routing based on determining the maximum number of disjoint paths in order to minimize the probability of compromise the confidential messages transmitted in the infocommunication network. The proposed model is based on solving the optimization problem of Integer Linear Programming in the presence of linear constraints, Boolean routing variables, and variables determining the number of used routes that take integer values. It has been established that the model provides an increase in the level of network security in terms of the probability of compromise of transmitted messages when it is used to calculate the maximum number of disjoint paths when implementing secure routing.

References

ITU-T X-805. Security architecture for systems providing end-to-end communications. October 2003. 28 p. URL: https://www.itu.int/rec/T-REC-X.805-200310-I/en.

ISO 7498-2:1989 Information processing systems – Open Systems Interconnection – Basic Reference Model – Part 2: Security Architecture, 1989. 32 p.

ITU-T X-800. Security architecture for Open Systems Interconnection for CCITT applications. March 1991. 48 p. URL: https://www.itu.int/rec/T-REC-X.800-199103-I.

Stallings W. Cryptography and Network Security: Principles and Practice. 7th Edition. Pearson, 2016. 768 p.

Schneier B. Data and Goliath: The hidden battles to collect your data and control your world. WW Norton & Company, 2015. 398 p.

Lemeshko A. V., Evseeva O. Yu., Garkusha S. V. Research on Tensor Model of Multipath Routing in Telecommunication Network with Support of Service Quality by Greate Number of Indices // Telecommunications and RadioEngineering. 2014. Vol. 73, No. 15. P. 1339-1360. DOI: 10.1615/TelecomRadEng.v73.i15.30.

Lou W., Kwon Y. H-SPREAD: A Hybrid Multipath Scheme for Secure and Reliable Data Collection in Wireless Sensor Networks // IEEE Transactions on Vehicular Technology. 2006. Vol. 55, No. 4. P. 1320–1330. DOI: 10.1109/TVT.2006.877707.

Yeremenko O. S., Ali S. A. Secure Multipath Routing Algorithm with Optimal Balancing Message Fragments in MANET // Radioelectronics and Informatics. 2015. № 1 (68). Р. 26–29.

Alouneh S., Agarwal A., En-Nouaary A. A Novel Path Protection Scheme for MPLS Networks using Multi-path Routing. Computer Networks: The International Journal of Computer and Telecommunications Networking. 2009. Vol. 53, No. 9. P. 1530–1545. DOI: 10.1016/j.comnet.2009.02.001.

Yeremenko O., Lemeshko O., Persikov A. Secure Routing in Reliable Networks: Proactive and Reactive Approach. Advances in Intelligent Systems and Computing II, CSIT 2017, Advances in Intelligent Systems and Computing, Springer, Cham. 2018. Vol. 689. P. 631–655. DOI: 10.1007/978-3-319-70581-1_44.

Yeremenko O. S. Enhanced Flow-based Model of Multipath Routing with Overlapping by Nodes Paths. Problems of Infocommunications Science and Technology (PIC S&T): Proceedings of the IEEE Second International Scientific-Practical Conference, Kharkiv, Ukraine, 13−15 October, 2015. Kharkiv : Kharkiv National University of Radio Electronics, 2015. P. 42–45. DOI: 10.1109/INFOCOMMST.2015.7357264.

Challal Y., Ouadjaout A., Lasla N., Bagaa M., Hadjidj A. Secure and efficient disjoint multipath construction for fault tolerant routing in wireless sensor networks // Journal of network and computer applications. July 2011. Vol. 34, Issue 4. P. 1380-1397. DOI: https://doi.org/10.1016/j.jnca.2011.03.022.

Gomes T., Martins L., Ferreira S., Pascoal M., Tipper D. Algorithms for determining a node-disjoint path pair visiting specified nodes // Optical Switching and Networking. 2017. Vol. 23. P. 189-204. DOI: https://doi.org/10.1016/ j.osn.2016.05.002.

Cruz P., Gomes T., Medhi D. A Heuristic for Widest Edge-disjoint Path Pair Lexicographic Optimization // Reliable Networks Design and Modeling (RNDM): Proceedings of the IEEE 2014 6th International Workshop, Barcelona, Spain. 17-19 Nov. 2014. P. 9-15. DOI: 10.1109/RNDM.2014.7014925.

Guo L. Efficient approximation algorithms for computing k disjoint constrained shortest paths // Journal of Combinatorial Optimization. July 2016. Vol. 32, Issue 1. P. 144-158. DOI: https://doi.org/10.1007/s10878-015-9934-2.

Eppstein D. Finding the k shortest paths. SIAM // Journal on computing. 1998. Vol. 28, Issue 2. P. 652-673. DOI: 10.1137/S0097539795290477.

Chang Z., Zhao G., Sun Y. A Calculation Method for The Reliability of a Complex k-out-of-n System. Quality, Reliability, Risk, Maintenance, and Safety Engineering (QR2MSE) // Proceedings of the 2013 International Conference, Chengdu, China. 15-18 July 2013. P. 204-207. DOI: 10.1109/QR2MSE.2013.6625566.

Myslitski K., Rak J. Evaluation of Time-Efficiency of Disjoint Paths Calculation Schemes. Transparent Optical Networks (ICTON) // Proceedings of the 17th International Conference, Budapest, Hungary. 5-9 July 2015. P. 1 4. DOI: 10.1109/ICTON.2015.7193309.

Qu Z., Ren W., Wang Q. A new node-disjoint multi-path routing algorithm of wireless Mesh network. Computer, Mechatronics, Control and Electronic Engineering (CMCE) // Proceedings of the 2010 International Conference, Changchun, China. 24-26 Aug. 2010. Vol. 4. P. 1-3. DOI: 10.1109/CMCE.2010.5609590.

Shi Y. Calculation of Network System Reliability Based on Improved Disjointed Minimal Path Set. E-Product E-Service and E-Entertainment // Proceedings of the 2010 International Conference, Henan, China. 7-9 Nov. 2010. P. 1 4. DOI: 10.1109/ICEEE.2010.5660486.

Downloads

How to Cite

Лемешко, А., Еременко, А., Персиков, А., & Слейман, Б. (2019). Model of secure routing based on determining the maximum number of disjoint paths to minimize the probability of compromise the confidential messages. Radiotekhnika, 2(197), 31–37. https://doi.org/10.30837/rt.2019.2.197.03

Issue

No. 197 (2019): Radiotekhnika

Section

Articles

License

Authors who publish with this journal agree to the following terms:

1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

2. 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.

3. 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 (See The Effect of Open Access).