有向网络上消息传播的到达间隔时间
Inter-arrival times of message propagation on directed networks
摘要：
打击网络犯罪的挑战之一是了解僵尸网络上的信息传播动态，僵尸网络是用于发送病毒、未经请求的商业电子邮件或拒绝服务攻击的受感染计算机网络。我们将这个问题映射到有向网络上的多个随机步行者的传播，并评估到达目标的连续步行者之间的到达时间分布。我们表明，这个过程的时间组织，非结构化对等网络上的信息传播模型，具有相同的功能，垃圾邮件到达一个单一的用户。我们研究了三种不同的网络拓扑结构上的消息到达间隔时间分布的行为，使用两种不同的规则发送消息。在所有的网络中，传播不是一个纯泊松过程。它在泊松网络上表现出普遍的特征，在无标度网络上表现出更为复杂的行为。结果打开的可能性，间接了解的过程中发送消息的网络与未知的拓扑结构，通过研究在网络的任何节点的到达间隔时间。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
