A game based passive worm defense model for P2P networks

Abstract

Passive worm, a huge hidden trouble to P2P applications, has drawn much attention because of its undetectable, destructive, and wide-ranging features. Existing propagation models for passive worm only noticed its similarity to biological viruses in propagation, ignored the impact of social attributes of P2P nodes on the spread of worms, such as trust relationship, network topology, security awareness and potential profit. Although these models were simple and efficient, they did not match the defense process of passive worm in dynamic environment. This paper proposes a defense model of passive worm in P2P networks. The contributions made in this paper include four aspects. First, we analyze the deficiency of current defense model of passive worm based on mean-field theory in P2P networks. Second, we build a node evaluation system based on trust relationship, by which the resource providers in P2P networks are determined. Third, we develop a defense model based on game theory. Fourth, we provide extensive numerical study and simulation experiments to the impact of some relevant model parameters on the defense of passive worm in P2P networks. The model presented in this paper is applicable for defending against passive worms in P2P networks. 1

The Dynamical Modeling Analysis of the Spreading of Passive Worms in P2P Networks

“…A worm in P2P networks is a program that replicates itself and propagates through the network from one computer to another to infect healthy computers. According to spreading approach [1,2], P2P worms can be divided into three categories: passive worms, reactive worms and proactive worms. Passive worms can hide themselves in files and spread as the files are downloaded and executed on healthy computers.…”