Abstract

In this paper, the mathematical model of calculating the maximum number of disjoint paths in secure routing in the infocommunication network is presented. The task of calculating the maximum number of disjoint paths was reduced to solving the optimization problem of integer programming with maximization the number of paths in the presence of linear constraints, since the routing variables are Boolean, and variables that determine the number of routes used take only integer values. Using the maximum number of paths in a fragmented transmission of a secret message allows minimizing its probability of compromise.

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 call

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.