Fast Multipath Jump Algorithms for Security Constraints
Huang Wanwei, Chen Yang, Jianwei Zhang, Chunfeng Du, Sunan Wang · International Journal of Performability Engineering · 2019
Transmission path jump can effectively resist network reconnaissance attacks by fragmented data transmission.However, most of the existing path jump models are based on SMT or game theory, which results in an exponential increase of computing time with network size.An efficient path generation algorithm for active random routing is proposed.Firstly, based on the global view of the network defined by the software, the paths of multiple streams are randomly changed actively and concurrently to resist reconnaissance, eavesdropping, and DoS attacks.Secondly, the traditional path calculation algorithm is re-modelled to satisfy the capacity, security, and QoS constraints of the K path generated, while improving the computational efficiency.Then, the optimal K value is solved, and the security effect of dynamic path is analysed.Finally, simulation results based on typical network topology show that the proposed algorithm can avoid and defend against malicious eavesdropping by attackers and improve the computational efficiency.