arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0806.2395cs.DC
收藏

非结构对等网络的Ad-hoc有限无标度模型

Ad-hoc Limited Scale-Free Models for Unstructured Peer-to-Peer Networks

Hasan Guclu, Durgesh Kumari, Murat Yuksel

摘要:

几个协议效率度量(例如,可扩展性、搜索成功率、路由可达性和稳定性)取决于即使在由ad-hoc节点加入或离开网络所引起的扰动下也能保持结构的能力。由于这种网络的分布式和潜在的非协作性质,如在对等(P2P)网络中,保持结构变得更加禁止。因此,大多数实际的解决方案涉及非结构化的方法,同时试图在协议栈的各个级别保持结构。本文的主要重点是研究无标度拓扑结构的构建和维护,在分布式的方式,而不需要全局拓扑信息的时候,节点加入或离开。我们通过将邻居的数量限制在预定义的硬截止值(即,没有对等体是主要的集线器),以及对等体通过对离开网络的节点的邻居进行重新布线而产生的ad-hoc行为。我们还研究了这些硬截止和ad-hoc节点的重新布线对P2P搜索效率的影响。

英文摘要:

Several protocol efficiency metrics (e.g., scalability, search success rate, routing reachability and stability) depend on the capability of preserving structure even over the churn caused by the ad-hoc nodes joining or leaving the network. Preserving the structure becomes more prohibitive due to the distributed and potentially uncooperative nature of such networks, as in the peer-to-peer (P2P) networks. Thus, most practical solutions involve unstructured approaches while attempting to maintain the structure at various levels of protocol stack. The primary focus of this paper is to investigate construction and maintenance of scale-free topologies in a distributed manner without requiring global topology information at the time when nodes join or leave. We consider the uncooperative behavior of peers by limiting the number of neighbors to a pre-defined hard cutoff value (i.e., no peer is a major hub), and the ad-hoc behavior of peers by rewiring the neighbors of nodes leaving the network. We also investigate the effect of these hard cutoffs and rewiring of ad-hoc nodes on the P2P search efficiency.

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

↑