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

References

  1. Santos O, Muniz J (2017) CCNA Cyber Ops Secfnd 210-250. Cisco Press, Indianapolis, 1st edition.
  2. Knuth DE (1973) The Art of Computer Programming. Addison-Wesley Publishing Company, Massachusetts, 2nd edition.
  3. Loukas G, Oke G (2010) Protection against Denial of Service Attacks: A Survey. Comput J 53: 1020-1037. [CrossRef] [Google Scholar]
  4. YChen Y, Hwang K, Kwok YK (2005) Filtering of shrew DDoS attacks in frequency domain. The IEEE Conference on Local Computer Networks 30th Anniversary. [CrossRef] [Google Scholar]
  5. Ben-Porat U, Bremler-Barr A, Levy H (2013) Vulnerability of Network Mechanisms to Sophisticated DDoS Attacks. IEEE Transactions on Computers 62: 1031-1043. [CrossRef] [Google Scholar]