期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

DHT负载均衡的必要性 被引量：1

On the Necessity of Load Balance in DHT
下载PDF
导出
摘要 在分布式哈希表(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.
作者 聂晓文 卢显良 李梁 徐海湄 蒲汛
机构地区 电子科技大学计算机学院
出处 《计算机科学》 CSCD 北大核心 2009年第9期92-95,共4页 Computer Science
关键词 对等网 分布式哈希表(DHT) 负载均衡 概率分布 Peer-to-peer network,Distributed hash table （DHT）, Load balance, Probability distribution
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献14

  • 1Zhao B Y,Kubiatowicz J D,Joseph A D.Tapestry:An Infrastructure for Fault-tolerant Wide-area Location[D].University of California at Berkeley,2001.
  • 2Stoica l,et al.Chord:a scalable peer-to-peer lookup protocol for Internet applications[J].Networking,IEEE/ACM Transactions,2003,11 (1):17-32.
  • 3Rowstron A I T,Druschel P.Pastry:Scalable,Decentralized Object Location,and Routing for Large-Scale Peer-to-Peer Systems[C]//Proceedings of the IFIP/ACM International Conference on Distributed Systcms Platforms Heidelberg.Springer-Verlag,2001.
  • 4Krishnamurthy S,et al.A Statistical Theory of Chord under Churn[C]//Proceedings of The 4th Annual International Workshop on Peer-To-Peer Systems (IPTPS 05).Ithaca,NY,USA,2005.
  • 5Mo Z,Yafei D,Xiaoming L.A measurement study of the structured overlay network in P2P file-sharing systems[M].Hindawi Publishing Corp,2007.
  • 6Silvia Bianchi S S,Felber P,Kropf P.Adaptive Load Balancing for DHT Lookups[C]//Proceedings of the 15th International Conference on Computer Communications and Networks (ICCCN'06).Arlington,VA,October 2006.
  • 7Datta A,Schmidt R,Aberer K.Query-load balancing in structured overlays[C]//Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGRID'07).Riode Janeiro,Brazil,2007.
  • 8Baeza-Yates R,Ribeiro-Neto B.Modern Information Retrieval[M].Addison Wesley,1999.
  • 9Saroiu S G,Krishna,Steven G.A Measurement Study of Peerto-Peer File Sharing Systems[C]//Proceedings of Multimedia Computing and Networking 2002 (MMCN'02).2002.
  • 10Rhea S,et al.Handling Churn in a DHT[D].EECS Department,University of California,Berkeley,2003.

同被引文献12

  • 1Karger D, Lehman E, Leighton T, et al. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web [C]//Proc 29th Annual ACM Symposium on Theory of Computing, New York: ACM Press, 1997.
  • 2Naor M, Wieder U. Novel architectures for P2P applications: The continuous-discrete approach [J]//ACM Transactions on Algorithms, 2007, 3(3): 50-59.
  • 3VMerie K, Jared S. Choosing a random peer [C][/Proc 23rd ACM Symposium on Principles of Distributed Computing (PODC'04), New York: ACM Press, 2004: 125- 130.
  • 4Wang Xiaoming, Dmitri L. Load-balancing performance of consistent hashing: asymptotic analysis of random node join [J].IEEE/ACM Transactions on Networking, 2007, 15(4): 892-905.
  • 5Adler M, Halperin E, Karp R M, et al. A stochastic process on the hypercube with applications to peer-to-peer networks [C]//Proc 35nd ACM Symposium on Theory of Computing (STOC'03), New York: ACM Press, 2003: 575-584.
  • 6Ittai A, Baruch A, Yossi A, et al. A generic scheme for building overlay networks in adversarial scenarios [C]//ProcInternational Parallel and Distributed Processing Symposium (IPDPS'03), Washington D C: IEEE Computer Society, 2003.
  • 7Karger D, Ruhl M. Simple efficient load balancing algorithms for peer-to-peer systems [C]/IProc 16th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'04), New York: ACM Press, 2004.
  • 8Kenthapadi K. Decentralized algorithms using both local and random probes for P2P load balancing [C]//Proc 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'05), New York: ACM Press, 2005: 135-144.
  • 9Gurmeet S M. Balanced binary trees for ID management and load balance in distributed hash tables [C]llProc 23rd ACM Symposium on Principles of Distributed Computing (PODC'04), New York: ACM Press, 2004: 197-205.
  • 10Giakkoupis G, Hadzilacos V. A scheme for load balancing in hetergoneous distributed hash tables [C]llProc 24th ACM Symposium on Principles of Distributed Computing (PODC'05), New York: ACM Press, 2005.

引证文献1

计算机科学
2009年 第9期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部