计算机工程与应用 ›› 2006, Vol. 42 ›› Issue (5): 23-.

• 博士论坛 • 上一篇    下一篇

非结构的P2P网络拓扑模型

曹佳,张国清,鲁士文   

  1. 中科院计算所
  • 收稿日期:2005-09-20 修回日期:1900-01-01 出版日期:2006-02-11 发布日期:2006-02-11
  • 通讯作者: 曹佳 caojia caojia

Unstructure P2P Network Topology Models

,,   

  1. 中科院计算所
  • Received:2005-09-20 Revised:1900-01-01 Online:2006-02-11 Published:2006-02-11

摘要: 在P2P系统中,物理主机的组网比较灵活.由于网络拓扑直接影响了网络的性能,所以构建什么样的对等网络拓扑一直备受关注.本文讨论几种常用的非结构对等网络拓扑模型.非结构型的对等网络适合信息发布类型的应用,其组网和维护相对简单.我们的研究发现,虽然目前有很多构建非结构型的对等网络的方案,但是这些方案最终构建的对等网络基本可以归为三种类型的拓扑模型, 随机图论模型(Erdős-Rényi),k规则随机图和随机有向图.本文分别描述了这三种拓扑模型的度分布、连通性和直径,以及一些相关的典型应用.

关键词: 对等网络, 随机图, 直径

Abstract: P2P network is a flexible network. As we know, the network topology influences the performance of the network directly, so the P2P network topology is very important for the quality of the network. In this article we describe unstructured models. We find that though there are various kinds of policies to build unstructured P2P networks, these networks can be classify into three models which are Erdős-Rényi model, k-regular random graph and random directed graph. The distribution of the nodal degree, connectivity and diameter is our main concern. And some typical applications are mentioned with respect to each model.

Key words: P2P network, random graph, diameter