论文部分内容阅读
资源和数据的有效定位是大规模 Peer-to-Peer 系统中面临的挑战性难题,分布 hash 表(DHT)方法是解决这一难题的重要技术途径. 文中首次基于 Kautz图提出了一种有效的 DHT方法——FissionE. FissionE是第一个常量度数、O(logN)网络直径且(1+o(1))拥塞的 DHT 方法, FissionE 的提出表明对于常量度数、常量拥塞的 DHT 方法, 其网络直径可以是 O(logN)的, 优于当前研究中猜想的?(N1/d).FissionE 方法的平均结点度数为 4, 网络直径小于 2*log2N, 平均路由路径长度log2N, 在结点规模较大时, 性能优于现有的常量度数 DHT 方法 CAN 和 Koorde.
The effective location of resources and data is a challenging problem in large-scale Peer-to-Peer systems, and the distributed hash table (DHT) method is an important technical way to solve this problem.This paper presents for the first time an effective DHT method - FissionE. FissionE is the first DHT method with constant O (logN) network diameter and (1 + o (1)) congestion. FissionE’s proposed method shows that for constant degree constant, constant congestion DHT method, (N1 / d) .FissionE method, the average node degree is 4, the network diameter is less than 2 * log2N, the average routing path length log2N, the node size Larger, performance is superior to the existing constant metric DHT methods CAN and Koorde.