Inter-arrival times of message propagation on directed networks

Abstract

One of the challenges in fighting cybercrime is to understand the dynamics of message propagation on botnets, networks of infected computers used to send viruses, unsolicited commercial emails (SPAM) or denial of service attacks. We map this problem to the propagation of multiple random walkers on directed networks and we evaluate the inter-arrival time distribution between successive walkers arriving at a target. We show that the temporal organization of this process, which models information propagation on unstructured peer to peer networks, has the same features as SPAM arriving to a single user. We study the behavior of the message inter-arrival time distribution on three different network topologies using two different rules for sending messages. In all networks the propagation is not a pure Poisson process. It shows universal features on Poissonian networks and a more complex behavior on scale free networks. Results open the possibility to indirectly learn about the process of sending messages on networks with unknown topologies, by studying inter-arrival times at any node of the network.

9 pages, 12 figures

References in corpus (14)

• First-passage times in complex scale-invariant media
• LinkRank: Finding communities in directed networks
• Universality in solar flare and earthquake occurrence
• First Passage Properties of the Erdos-Renyi Random Graph
• Random walk and trapping processes on scale-free networks
• Trapping in complex networks
• Scaling and correlations in the dynamics of forest-fire occurrence
• Random Walks on Directed Networks: the Case of PageRank
• Localization Transition of Biased Random Walks on Random Networks
• Navigating Networks with Limited Information
• Schroedinger-like PageRank equation and localization in the WWW
• Time-energy correlations in solar flare occurrence
• Correlations and Omori law in Spamming
• Random Walks on Complex Networks