摘要
在非结构化P2P系统中,P2P拓扑直接影响了网络的性能,如何构建P2P拓扑是一件重要的问题。采用一个简单的映射将非结构化P2P抽象成一个G(V,E)图,在G(V,E)及其非结构化P2P拓扑的特点基础上,提出了一种非结构化P2P的随机有向图拓扑模型,并讨论了该拓扑模型的度分布、连通性和直径,为研究非结构化P2P系统的性能和算法协议提供了仿真的理论基础。
In unstructured P2P system,the topology of P2P influences directly the performance of the network. It is a very important problem how to design a topology of P2P. The paper uses a simple map to abstract an unstructured P2P into a G( V, E) graph. Based on G( V, E) graph and characteristics of unstructured P2P, the paper proposes a random directed graph topology model of unstructured P2P. And also the paper discusses distribution of the nodal degree, connectivity and diameter of the model. On the other hand, the model provides theoretic foundation to research performance and algorithms and protocols of unstructured P2P system.
出处
《计算机应用与软件》
CSCD
北大核心
2007年第4期64-66,共3页
Computer Applications and Software
基金
广西自然科学基金资助(桂科自0447091)。
关键词
对等网络
分布式哈希表
随机有向图
拓扑
Peer-to-peer Distributed hash table Random directed graph Topology