论文标题
八卦年龄对时间编写的敏感性
Susceptibility of Age of Gossip to Timestomping
论文作者
论文摘要
我们考虑了一个完全连接的网络，该网络由维护当前版本的文件，$ n $节点，使用异步八卦机制在网络中传播新鲜信息的$ n $节点，以及通过Data TimeStamp操作中的目标节点在目标节点上感染数据包的对手，并有目的地将新鲜包装包装包装包装包装在网络中。我们表明，单个感染节点将完全连接的网络的预期年龄从$ O（\ log n）$增加到$ O（n）$。此外，我们表明，对手的最佳行为是将所有传出数据包的时间戳重置为当前时间和所有传入数据包的时间戳。此外，如果对手允许受感染的节点接受网络的一小部分传入数据包，则大型网络可以设法遏制从感染节点的陈旧文件的传播，并将网络年龄拉回$ O（\ log log n）$。最后，我们表明，如果受感染的节点触点仅一个单个节点而不是网络的所有节点，则系统年龄仍然可以降低到$ o（n）$。这些表明，网络完全连接的性质既可能是好处，又是损害信息新鲜度。完全连通性，同时可以快速传播信息，还可以快速散布对抗输入。
We consider a fully connected network 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 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 show that a single infected node increases the expected age of a fully connected network 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. Additionally, if the adversary allows the infected node to accept a small fraction of incoming packets from the network, then a large network can manage to curb the spread of stale files coming from the infected node and pull the network age back to $O(\log n)$. Lastly, 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.
