Highly intensive data dissemination in complex networks

Abstract

This paper presents a study on data dissemination in unstructured Peer-to-Peer (P2P) network overlays. The absence of a structure in unstructured overlays eases the network management, at the cost of non-optimal mechanisms to spread messages in the network. Thus, dissemination schemes must be employed that allow covering a large portion of the network with a high probability (e.g. gossip based approaches). We identify principal metrics, provide a theoretical model and perform the assessment evaluation using a high performance simulator that is based on a parallel and distributed architecture. A main point of this study is that our simulation model considers implementation technical details, such as the use of caching and Time To Live (TTL) in message dissemination, that are usually neglected in simulations, due to the additional overhead they cause. Outcomes confirm that these technical details have an important influence on the performance of dissemination schemes and that the studied schemes are quite effective to spread information in P2P overlay networks, whatever their topology. Moreover, the practical usage of such dissemination mechanisms requires a fine tuning of many parameters, the choice between different network topologies and the assessment of behaviors such as free riding. All this can be done only using efficient simulation tools to support both the network design phase and, in some cases, at runtime.

Multi-level simulation of Internet of Things on smart territories

“…As a first effort to fix this problem, we have added to S 3 a message caching mechanism that operates in every node. This is an approach that is very common in presence of dissemination algorithms based on gossip [31]. Figure 6 shows that, in this simulation model, the effect of message caching is negligible in terms of reduction of the communication overhead.…”

Implications of dissemination strategies on the security of distributed ledgers

“…In fact there are other protocols that allow either to reduce the number of messages sent or to enhance the anonymity of the transaction's creator. Some alternative algorithms that can be used for the dissemination of a transaction are [10]:…”

Fault tolerant adaptive parallel and distributed simulation through functional replication

“…Nodes of the graphs are peers while links represent communication connections [36,37]. In these overlays, all nodes have the same out-degree, that has been set to 5 in our experiments.…”