An important and fundamental issue in designing structured P2P systems is the tradeoff between the number of logicallinks and the number of hops. This paper presents K-Chord (KC), a flexible protocol based on Chord and the idea of proportional search. We conduct an in-depth study on KC. Let $D$ denote any given number, in order to guarantee that each query can be resolved in $O(D)$ hops, it is necessary and sufficient to maintain $Omega(D(n^{1/D}-1))$ links on each node in KC, where $n$ is the number of nodes in the system. The performances of KC have been evaluated using both theoretical analysis and simulation.
展开▼
机译：设计结构化P2P系统时，一个重要且基本的问题是逻辑链接数与跳数之间的权衡。本文介绍了K-Chord（KC），这是一种基于Chord和比例搜索思想的灵活协议。我们对KC进行了深入研究。令$ D $表示任何给定的数字，以保证每个查询都能以$ O（D）$跃点进行解析，维持$ Omega（D（n ^ {1 / D} -1）是必要且充分的）$在KC中每个节点上的链接，其中$ n $是系统中的节点数。已使用理论分析和仿真评估了KC的性能。
展开▼
