Simulating Greedy Propagation of P2P Worms

Greedy propagation policy for un- structured P2P worms employs the neighboring node list of each node in peer-to-peer (P2P) network to speed up the propagation of P2P worms. After describing the technique background of P2P worms, the algorithm of greedy propagation is addressed. Simulating design for this novel propagation policy is also described. Then, the effects of the greedy propagation policy on spreading speed, convergent convergence speed, and attacking traffic in static P2P worms are simulated and discussed. The primary experimental results show that the greedy propagation is harmful and can bring severe damages to P2P network.