复杂网络中的高密集型数据传播
Highly intensive data dissemination in complex networks
摘要:
研究了非结构化P2P网络中的数据分发问题。非结构化覆盖中结构的缺失简化了网络管理,代价是在网络中传播消息的非最佳机制。因此,必须采用允许以高概率覆盖网络的大部分(例如,基于Gossip的方法)。我们确定的主要指标,提供了一个理论模型,并使用高性能的模拟器,是基于并行和分布式架构进行评估。本研究的一个要点是,我们的模拟模型考虑实现的技术细节,如使用缓存和生存时间(TTL)在消息传播,通常被忽视的模拟,由于额外的开销,他们造成的。结果证实,这些技术细节的传播计划的性能有重要的影响,研究计划是相当有效的P2P覆盖网络中传播信息,无论其拓扑结构。此外,这种传播机制的实际使用需要对许多参数进行微调,在不同的网络拓扑结构之间进行选择,并评估搭便车等行为。所有这一切都只能使用有效的仿真工具来支持网络设计阶段,在某些情况下,在运行时。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。