A stochastic worm model

详细信息    查看全文

• 作者：Hanxun Zhou ; Wei Guo
• 关键词：Network security ; Scanning worms ; Worm model ; Stochastic worm model ; Continuous ; time Markov chain
• 刊名：Telecommunication Systems
• 出版年：2017
• 出版时间：January 2017
• 年：2017
• 卷：64
• 期：1
• 页码：135-145
• 全文大小：
• 刊物类别：Business and Economics
• 刊物主题：IT in Business; Computer Communication Networks; Artificial Intelligence (incl. Robotics); Probability Theory and Stochastic Processes;
• 出版者：Springer US
• ISSN：1572-9451
• 卷排序：64

文摘

Internet worm infection continues to be one of top security threats and has been widely used by botnets to recruit newbots. In order to defend against future worms, it is important to understand how worms propagate and how different scanning strategies affect worm propagation dynamics. In our study, we present a (stochastic) continuous-time Markov chain model for characterizing the propagation of Internet worms. The model is developed for uniform scanning worms, and further for local preference scanning worms and flash worms. Specifically, for uniform and local preference scanning worms, we are able to (1) provide a precise condition that determines whether the worm spread would eventually stop and (2) obtain the distribution of the total number of infected hosts. By using the same modeling approach, we reveal the underlying similarity and relationship between uniform scanning and local preference scanning worms. Finally, we validate the model by simulating the propagation of worms.