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

一类DHT算法中负载的概率分布 被引量：3

Probabilistic distribution of load in one class of DHT
下载PDF
导出
摘要 根据节点之间间距的概率,推导出Chord、Pastry和虚拟服务器(VS)平衡方案下节点负载的概率分布。分析表明在这些分布式哈希表(DHT)算法中,节点负载都服从相同形式的伽马分布。特别地,当一个物理节点上放置20个虚拟节点,以概率0.99保证节点之间的负载差异不超过两倍。仿真实验验证了以上结果。 Accord.ing to the probability of intervals between nodes, the paper deduced the distribution of load in Chord, Pastry and virtual servers （VS） balancing scheme. The analysis showed that in these algorithms the load of nodes obeyed the Gamma distribution with similar parameters. Particularly, when put 20 virtual nodes on a physical node, it could he guaranteed with the probability 0.99 that the difference of load between two nodes will not exceed two times. And the simulation verifies the results.
作者 聂晓文 卢显良 孟江涛 彭永祥
机构地区 电子科技大学计算机学院
出处 《计算机应用研究》 CSCD 北大核心 2009年第10期3763-3766,共4页 Application Research of Computers
关键词 分布式哈希表 负载均衡 概率密度函数 累积分布函数 distributed hash table （DHT） load balance probability density function （PDF） cumulative distribution function （CDF）
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献8

  • 1STOICA I, MORRIS R, LIBEN-NOWELL D, et al. Chord: a scalable peer-to-peer lookup protocol for lnternet applications[ J]. IEEE/ ACM Trans on Networking, 2003,11 ( 1 ) :17-32.
  • 2ROWSTRON A, DRUSCHEL P. Pastry : scalable, decentralized object location, and routing for large-scale peer-to-peer systems [ C ]// Proc of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware). [ S.l. ] : ACM Press, 2001 : 329- 350.
  • 3KING V, SAIA J. Choosing a random peer[ C] //Proc of the 23rd Annual ACM Symposium on Principles of Distributed Computing. [ S. l. ] :ACM Press, 2004:125-130.
  • 4WANG X, LOGUINOV D. Load-balancing performance of consistent hashing: asymptotic analysis of random node join [ J]. IEEE/ACM Trans on Networking, 2007,15 ( 14 ) : 892- 905.
  • 5DOUCEUR J R. The Sybil attack reer-to-peer systems[ C ]//Proc of the 1 st International Workshop. Cambridge : Springer, 2002: 251- 260.
  • 6KRISHNAMURTHY S, EL-ANSARY S, AURELL E, et al. An analytical study of a structured overlay in the presence of dynamic membership[ J]. IEEE/ACM Trans on Networking, 2008,16 (14) : 814- 825.
  • 7CORLESS R M, GONNET G H, HARE D E, et al. Lambert' s W function in Maple[ J]. Maple Technical Newsletter, 1993, 9:12- 22.
  • 8ROSS S M. Introduction to probability models[ M]. 9 ed. Singapore: Elsevier (Singapore) Pte Ltd, 2007:64-76.

同被引文献23

  • 1聂晓文,卢显良,周旭,李梁,徐海湄.DHT算法基本统计特性及其应用[J].四川大学学报（工程科学版）,2009,41(5):170-175. 被引量：2
  • 2刘田甜,李超,胡庆成,张桂刚.云环境下多副本管理综述[J].计算机研究与发展,2011,48(S3):254-260. 被引量：20
  • 3STOICA I,MORRIS R,KARGER D. Chord:a scalable peer-to-peer lookup service for intemet applications[A].San Diego,2001.149-160.
  • 4DABEK F,KAASHOEK M F,KARGER D. Wide-area cooperative storage with CFS[A].Banff,2001.202-215.
  • 5ROWSTRON A,DRUSCHEL P. Pastry:scalable,distributed object location and routing for large-scale peer-to-peer systems[A].Heidelberg,2001.329-350.
  • 6DRUSCHEL P,ROWSTRON A. PAST:a large-scale,persistent peer-to-peer storage utility[A].Schoss Elmau,2001.75-80.
  • 7ZHAO B Y,KUBIATOWICZ J D,JOSEPH A D. Tapestry:an Infrastructare for Faulttolerance Wide-Area Location and Routing.U C Berkeley Technical Report UCB//CSD-01-1141[R].Berkeley,2001.329-350.
  • 8ANANTH R,LAKSHMINARAYANAN K,SURANA S. Load balancing in structured P2Psystems[A].2003.68-79.
  • 9GODFREY B,LAKSHMINARAYANAN K,SURANA S. Load balancing in dynamic structured P2P systems[A].2003.2253-2262.
  • 10GODFREY P,STOICA I. Heterogeneity and load balance in distributed hash tables[A].2005.596-606.

引证文献3

二级引证文献7

计算机应用研究
2009年 第10期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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