DHT负载均衡的必要性  

On the Necessity of Load Balance in DHT

作　　者：聂晓文[1] 卢显良[1] 李梁[1] 徐海湄[1] 蒲汛[1] 

机构地区：[1]电子科技大学计算机学院,成都610054

出　　处：《计算机科学》2009年第9期92-95,共4页Computer Science

摘　　要：在分布式哈希表(DHT)中,节点ID通常随机选择,但这并不意味着DHT是负载均衡的。仿真结果表明,Chord网络中的负载是不均衡的。在总结对该问题相关工作的基础上,理论上证明了DHT算法本质上的不均衡性,并精确给出节点负载不均衡性的上界范围,仿真验证了分析结论。In the distributed hash table （DHT）, the identifiers of nodes are chosen at random, but this does not mean that the DHT is load-balanced. The simulation in Chord has shown that the load is imbalanced. The paper summarized the previous work on this problem to make clear that DHT is imbalanced essentially. We gave the precise scope of the upper bound of imbalance,and verified the results with simulations.

关 键 词：对等网 分布式哈希表(DHT) 负载均衡 概率分布 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]