Fast Multipath Jump Algorithms for Security Constraints

doi:10.23940/ijpe.19.08.p20.21992207

Int J Performability Eng ›› 2019, Vol. 15 ›› Issue (8): 2199-2207.doi: 10.23940/ijpe.19.08.p20.21992207

Previous Articles Next Articles

Fast Multipath Jump Algorithms for Security Constraints

Wanwei Huang^a, Yang Chen^c, Jianwei Zhang^a,*, Chunfeng Du^b, Sunan Wang^d

a Software Engineering College, Zhengzhou University of Light Industry, Zhengzhou, 450002, China
b School of Computer and Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou, 450002, China
c National Digital Switching System Engineering Technology Research Center, Zhengzhou, 450002, China
d School of Electronics and Communication Engineering, Shenzhen Polytechnic College, Shenzhen, 518055, China

Submitted on ;
Contact: * E-mail address: zhangjw@zzu.edu.cn
About author:Wanwei Huang received his Ph.D. in communication and information systems from PLA Information Engineering University in 2009. He is currently a lecturer at Zhengzhou University of Light Industry. His research interest is communication engineering. Yang Chen is a master's student at the National Digital Switching System Engineering Technology Research Center. His research interests include cloud computing, SDN, and network security. Jianwei Zhang received his Ph.D. in computer application technology from PLA Information Engineering University in 2010. He is currently a professor at Zhengzhou University of Light Industry. His research interests include broadband information networks and network security. Chunfeng Du is a master's student in the School of Computer and Communication Engineering at Zhengzhou University of Light Industry. His research interests include network engineering and big data. Sunan Wang is an associate professor in the Electronic and Communication Engineering College at Shenzhen Vocational and Technical College. His research fields are network system architecture, data flow analysis, and information security.
Supported by:
This work is supported by the National Natural Science Foundation of China (No. 61672471), Henan Province University Science and Technology Innovation Team (No. 18IRTSTHN012), Plan for Scientific Innovation Talent of Henan Province (No. 184200510010), and Ph.D. Foundation of Zhengzhou Institute of Light Industry (No. 2016BSJJ041).

Abstract

Abstract: 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.

Key words: software-defined networking, multi-path, path jump

Wanwei Huang, Yang Chen, Jianwei Zhang, Chunfeng Du, Sunan Wang. Fast Multipath Jump Algorithms for Security Constraints [J]. Int J Performability Eng, 2019, 15(8): 2199-2207.

Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks

References

[1] Q. L. Han, B. Shao,L. J. Li, “Publishing Histograms with Outliers under Data Differential Privacy,” Security and Communication Networks, Vol. 9, No. 14, pp. 2313-2322, 2016
[2] G. R. Chen, “Problems and Challenges of Control Theory in Complex Dynamic Network Environment,” Chinese Association of Automation, Vol. 39, No. 4, pp. 312-321, 2013
[3] S. Tarciana, G. Reinaldo, O. Luciana, C. Igor, S. Djamel,J. Martin, “OSPF-AN: An Intra Domain Routing Protocol for Ambient Networks,” inProceedings of International Conference on Advanced Communication Technology, Vol. 1, pp. 212-217, 2008
[4] Y. F. Lei, “Application Research of OSPF Dynamic Routing Protocol in Campus Network,”Computer CD-ROM Software and Application, Vol. 16, pp. 299-300, 2014
[5] Z. J.Feng and Q. Zhu, “Enterprise Network Design based on OSPF (Open Shortest Path First) Routing Protocol,” Computer Knowledge and Technology, Vol. 14, No. 18, pp. 16-18, 2018
[6] Q. Hua, Y. S. Li,J. Liu, “A CCN Centralized Control Cache Decision Method based on SDN,” Telecommunications Science, Vol. 33, No. 5, pp. 12-20, 2017
[7] Z. Li, “Research on Control Plane Availability and Reliability based on SDN Architecture,” Beijing University of Technology, 2015
[8] D. B. Qi, X. G. Wang,X. Fu, “Exploration and Research on Technical Difficulties of Multi-Path System in Cross-Organizational Trials,” Drug Evaluation Study, Vol. 40, No. 10, pp. 1372-1377, 2017
[9] J. D. Touch, G. G. Finn, Y. S. Wang,L. Eggert, “DynaBone: Dynamic Defense using Multi-Layer Internet Overlays,” inProceedings of DARPA Information Survivability Conference and Exposition, pp. 22-24, IEEE, US, 2003
[10] Y. Chen, H. C. Hu,G. Z. Cheng, “Design and Implementation of Software-Defined Intranet Dynamic Defense System,” Acta Electronica Sinica, Vol. 46, No. 11, pp. 2604, 2018
[11] E. Talipov, D. Jin,J. Jung, “Path Hopping based on Reverse AODV for Security,” inProceedings of Asia-Pacific International Conference on Network Operations and Management, pp. 574-577, Springer-Verlag, 2006
[12] Q. Duan, E. Al-Shaer,H. Jafarian, “Efficient Random Route Mutation Considering Flow and Network Constraints,” inProceedings of 2013 IEEE Conference on Communications and Network Security, pp. 260-268, IEEE, 2013
[13] W. Lan, J. X. Wang, M. Li, W. Peng,F. X. Wu, “Computational Approaches for Prioritizing Candidate Disease Genes based on PPI Networks,” Tsinghua Science and Technology, Vol. 20, No. 5, pp. 500-512, 2015
[14] G. L. Sun, T. Chen, Y. Y. Su,C. L. Li, “Internet Traffic Classification based on Incremental Support Vector Machines,” Mobile Networks and Applications, Vol. 23, No. 4, pp. 789-796, 2018
[15] M. Al-Fares, A. Loukissas, and A. Vahdat, “A Scalable, Commodity Data Center Network Architecture,” in Proceedings of the ACM SIGCOMM 2008 Conference on Data Communication, pp. 63-74, 2008
[16] A. Greenberg, J. R. Hamilton,N. Jain, “VL2: A Scalable and Flexible Data Center Network,” Association for Computing Machinery, Vol. 39, No. 4, pp. 51-62, 2009

Fast Multipath Jump Algorithms for Security Constraints

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 1

Recommended 0