To obtain access to full text of journal and articles you must register!
- Article name
- Formalizing the calculation of the number of scenarios in the multiple startup connections algorithm using combinatorics
- Authors
- Zyuzin V. D., , v.d.zyuzin@gmail.com, Lobachevsky State University of Nizhny Novgorod, Nizhny Novgorod, Russia
Bashmurov N. A., , bashmurov.nikolai@yandex.ru, Lobachevsky State University of Nizhny Novgorod, Nizhny Novgorod, Russia
- Keywords
- virtual private networks / multiple startup connections algorithm / information security / routing / combinatorics
- Year
- 2025 Issue 1 Pages 19 - 25
- Code EDN
- IMNKIO
- Code DOI
- 10.52190/2073-2600_2025_1_19
- Abstract
- The article discusses an algorithm for multiple initial connections to enhance the protection of Virtual Private Networks (VPN) by complicating traffic analysis and interception during the early stages of node interaction. Using combinatorial methods, an exponential growth of the number of routes was identified depending on the number of nodes, initial packets, and algorithm steps. Generalized formulas for calculating unique paths, considering parallel transmission and dynamic routing, are proposed. An example of a system with four nodes and two initial packets demonstrates the rapid growth of routing scenarios. The results allow for a quantitative assessment of the algorithm's complexity and serve as a foundation for optimizing parameters, which increases the resilience of VPNs against routing-level attacks and opens up prospects for the development of scalable peer-to-peer solutions.
- Text
- BUY for read the full text of article
- Buy
- 500.00 rub
