Profile
International Journal of Computer & Software Engineering Volume 6 (2021), Article ID 6:IJCSE-170, 5 pages
https://doi.org/10.15344/2456-4451/2021/170
Original Article
Special Issue: Computational Analysis and Modeling
On Vulnerability of the Longest Prefix Matching Rule to the IP Classless Subnetting

Yao Tong and Shigeo Akashi*

Department of Information Sciences, Tokyo University of Science, Noda City, Chiba Prefecture, 278-8510, Japan
Prof. Shigeo Akashi, Department of Information Sciences, Tokyo University of Science, Noda City, Chiba Prefecture, 278-8510, Japan; E-mail: akashi@is.noda.tus.ac.jp
05 November 2021; 16 November 2021; 18 November 2021
Tong Y, Akashi S (2021) On Vulnerability of the Longest Prefix Matching Rule to the IP Classless Subnetting. Int J Comput Softw Eng 6: 170. doi: https://doi.org/10.15344/2456-4451/2021/170

Abstract

The more commonly the Internet is used among the nations in the world, the more diversified is the way of cyber attacks. This fact implies that it is more difficult for the network administrators to develop generic countermeasures against various kinds of cyber attacks and malwares. Therefore, network theoretic classification of cyber attacks may play so important roles in constructing versatile countermeasures in the future. In this paper, network theoretic comparison of several cyber attacks with each other is discussed for the purpose of deriving the way of developing the generic conutermeasures against diversified malicious use of network theoretic skills.