DOI QR코드

DOI QR Code

Internet Worm Propagation Model Using Centrality Theory

  • Kwon, Su-Kyung (Department of Electrical and Computer Engineering, Pusan National University) ;
  • Choi, Yoon-Ho (Department of Electrical and Computer Engineering, Pusan National University) ;
  • Baek, Hunki (Department of Mathematics Education, Catholic University of Daegu)
  • Received : 2016.11.02
  • Accepted : 2016.11.14
  • Published : 2016.12.23

Abstract

The emergence of various Internet worms, including the stand-alone Code Red worm that caused a distributed denial of service (DDoS), has prompted many studies on their propagation speed to minimize potential damages. Many studies, however, assume the same probabilities for initially infected nodes to infect each node during their propagation, which do not reflect accurate Internet worm propagation modelling. Thus, this paper analyzes how Internet worm propagation speed varies according to the number of vulnerable hosts directly connected to infected hosts as well as the link costs between infected and vulnerable hosts. A mathematical model based on centrality theory is proposed to analyze and simulate the effects of degree centrality values and closeness centrality values representing the connectivity of nodes in a large-scale network environment on Internet worm propagation speed.

Keywords

References

  1. Computer Worm, https://en.wikipedia.org/wiki/Computmer_worm
  2. Centrality, https://en.wikipedia.org/wiki/Centrality
  3. C. C. Zou, W. Gong and D. Towsley, Code red worm propagation modeling and analysis, the 9th ACM conference on Computer and communications security, (2002), 138-147.
  4. A. Mohammed, S. M. Nor and M. N. Marsono, Network Worm Propagation Model Based on a Campus Network Topology, the 2011 International Conference on Internet of Things and 4th International Conference on Cyber, (2011), 653-659.
  5. D. Zhang and Y. Wang, SIRS: Internet Worm Propagation Model and Application, Electrical and Control Engineering, 2010 International Conference on, (2010).
  6. M. Nekovee, Modeling the Spread of Worm Epidemics in Vehicular Ad Hoc Networks, Vehicular Technology Conference, (2006).
  7. M. S. Haghighi, S. Wen and Y. Xiang, On the Race of Worms and Patches: Modeling the Spread of Information in Wireless Sensor Networks, IEEE Transactions on Information Forensics and Security, (2016).
  8. J. Kim, S. Radhakrishnan and S. K. Dhall, Measurement and Analysis of Worm Prop-agation on Internet Network Topology, Computer Communications and Networks, (2004).
  9. C. C. Zou, D. Towsley and W. Gong, The Study of Network Worm Propagation Simulation, IEEE Transactions on Dependable and Secure Computing, (2007).
  10. C. C. Zou, D. Towsley and W. Gong, On the performance of Internet worm scanning strategies, Performance Evaluation, (2006), 700-723.
  11. A. Wagner, T. Dubendorfer, B. Plattner and R. Hiestand, Experiences with Worm Propagation Simulations, the 2003 ACM workshop on Rapid malcode, (2003), 34-41.
  12. I. Gaye, G. Mendy, S. Ouya and D. Seck, New centrality measure in Social Net-works based on Independent Cascade (IC) model, 2015 3rd International Conference on Future Internet of Things and Cloud, (2015), 675-680.
  13. Y. Wang, S. Wen and Y. Xiang, Modeling the Propagation of Worms in Networks: A Survey, IEEE Communications Surveys & Tutorials, (2013), 942-960.