Abstract: In peer-to-peer(P2P) systems, it is built upon an overlay whose topology is independent of the underling physical network, which would cause a serious topology mismatching between the P2P logical overlay network and the physical underlying IP network. This mismatch would lead up to a large of redundant traffic in the Internet. A practicable method which optimizes the P2P logical overlay network is proposed. It has been found that the approach can availably solve the mismatching problem and significantly reduce the stretch quotiety.

Key words: Structured P2P, Overlay, Matching, Landmark, Stretch quotiety

摘要： 在结构化P2P系统中，建立逻辑覆盖图时并没有考虑实际物理层的拓扑结构，这将导致覆盖图与底层物理图的严重不匹配，从而使得覆盖图上相邻节点的延迟远远大于其物理图中的延迟，并在Internet中造成大量不必要的流量。该文提出了一个拓扑匹配算法，通过模拟仿真实验证明，该算法能在很大程度上解决不匹配问题，并使拉伸系数大大减小。

关键词: 结构化P2P, 覆盖图, 匹配, 界标簇, 拉伸系数

CLC Number: 

• TP393.01