论文标题
对年龄敏感八卦网络的时间表漏洞
Timestomping Vulnerability of Age-Sensitive Gossip Networks
论文作者
论文摘要
我们认为八卦网络由维护当前版本的文件组成，使用异步八卦机制在网络中传播新的信息，以及一个遗忘的对手，通过数据时间播级操作将数据包感染在目标节点上，以替代新的包装包装包装包装包装，将数据包在目标节点上传播。我们展示了网络拓扑如何使对手影响网络中的年龄缩放。我们表明，在完全连接的网络中，单个感染节点将预期的年龄从$ O（\ log n）$增加到$ O（n）$。此外，我们表明，对手的最佳行为是将所有传出数据包的时间戳重置为当前时间和所有传入数据包的时间戳，以使受感染节点的过时时间；从而阻止任何新的信息进入感染节点，并促进从感染节点中接受陈旧信息进入其他网络节点。最后，对于完全连接的网络，我们表明，如果只有一个受感染的节点触点仅一个节点而不是网络的所有节点，则系统年龄仍然可以降级到$ o（n）$。这些表明，网络完全连接的性质既可能是好处，又是损害信息新鲜度。完全连通性，同时可以快速传播信息，还可以快速散布对抗输入。然后，我们分析了网络连接频谱的另一端的单向环网络，在这里我们表明，对抗性对节点的年龄缩放的影响受到与对手的距离的限制，并且网络的大部分时间范围持续不断be $ o（\ sqrt {n}）$，与case case case case case case case no adversary无关。我们最终通过模拟支持我们的发现。
We consider gossip networks consisting of a source that maintains the current version of a file, $n$ nodes that use asynchronous gossip mechanisms to disseminate fresh information in the network, and an oblivious adversary who infects the packets at a target node through data timestamp manipulation, with the intent to replace circulation of fresh packets with outdated packets in the network. We demonstrate how network topology capacitates an adversary to influence age scaling in a network. We show that in a fully connected network, a single infected node increases the expected age from $O(\log n)$ to $O(n)$. Further, we show that the optimal behavior for an adversary is to reset the timestamps of all outgoing packets to the current time and of all incoming packets to an outdated time for the infected node; thereby preventing any fresh information to go into the infected node, and facilitating acceptance of stale information out of the infected node into other network nodes. Lastly for fully connected network, we show that if an infected node contacts only a single node instead of all nodes of the network, the system age can still be degraded to $O(n)$. These show that fully connected nature of a network can be both a benefit and a detriment for information freshness; full connectivity, while enabling fast dissemination of information, also enables fast dissipation of adversarial inputs. We then analyze the unidirectional ring network, the other end of the network connectivity spectrum, where we show that the adversarial effect on age scaling of a node is limited by its distance from the adversary, and the age scaling for a large fraction of the network continues to be $O(\sqrt{n})$, unchanged from the case with no adversary. We finally support our findings with simulations.
