arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1607.02733physics.soc-phcs.SI
收藏

动态节点参与的有限无标度拓扑

Towards Limited Scale-free Topology with Dynamic Peer Participation

Xiaoyan Lu, Eyuphan Bulut, Boleslaw Szymanski

摘要:

为了提高非结构化P2P网络的性能,人们提出了一种增长模型来构造无尺度覆盖拓扑。然而,以前的增长模型能够保持有限的无标度拓扑时,节点只加入,但不离开网络;的情况下,节点离开网络,同时保持精确的缩放参数不包括在解决方案中。因此,在这些模型中没有考虑P2P网络中固有的节点参与的全部动态。为了处理节点加入和离开网络,我们提出了一个强大的增长模型E-SRA,它能够产生完美的有限的无标度覆盖拓扑与用户定义的缩放参数和硬截止。我们的方法的可扩展性得到了保证,因为不需要全局信息来添加或删除节点。E-SRA还可以容忍由错误或攻击引起的单个节点故障。仿真结果表明,E-SRA优于其他增长模型产生的拓扑结构与所需的无标度属性的高度坚持。搜索算法,包括洪泛和归一化洪泛,实现了更高的效率在E-SRA产生的拓扑结构。

英文摘要:

Growth models have been proposed for constructing the scale-free overlay topology to improve the performance of unstructured peer-to-peer (P2P) networks. However, previous growth models are able to maintain the limited scale-free topology when nodes only join but do not leave the network; the case of nodes leaving the network while preserving a precise scaling parameter is not included in the solution. Thus, the full dynamic of node participation, inherent in P2P networks, is not considered in these models. In order to handle both nodes joining and leaving the network, we propose a robust growth model E-SRA, which is capable of producing the perfect limited scale-free overlay topology with user-defined scaling parameter and hard cut-offs. Scalability of our approach is ensured since no global information is required to add or remove a node. E-SRA is also tolerant to individual node failure caused by errors or attacks. Simulations have shown that E-SRA outperforms other growth models by producing topologies with high adherence to the desired scale-free property. Search algorithms, including flooding and normalized flooding, achieve higher efficiency over the topologies produced by E-SRA.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑