期刊文献+

SM-Chord:自维护的多属性Chord

SM-Chord: self-maintenance based multi-attribute Chord
下载PDF
导出
摘要 针对Chord不支持多属性查找,通过分析结构化覆盖网络Chord,提出了SM-Chord。该系统充分利用各个节点的自身性能来维护自己的资源,以资源的多个属性值构成Chord环,从而使该系统既可以支持多属性查找,又可以减少资源重新部署带来的带宽消耗。仿真试验结果表明,SM-Chord在保持Chord查找成功率的同时,能够通过负载分担提高系统的负载平衡能力,并且降低了系统的带宽消耗。 To solve Chord does not support for multi-attribute to fred, a new Chord named SM-Chord is proposed after comparison and analyzed various overlay networks such as Chord. The system makes full use of the system' s own performance of the various nodes to maintain their own resources, and multi-attribute of resource make up of Chord ring. So the system support multi-attribute search, and reduce bandwidth consumption which caused by the redeployment of resources. Through analysis and simulation experiments show that the SM-Chord maintain the success rate of Chord, reduce the load of hot spot and achieve load balance and reduce bandwidth consumption.
作者 刘颖 李建军
出处 《计算机工程与设计》 CSCD 北大核心 2010年第1期72-74,共3页 Computer Engineering and Design
关键词 SM-Chord P2P 负载均衡 自维护 多属性 SM-Chord P2P load balance self-maintenance multi-attribute
  • 相关文献

参考文献8

  • 1杨斌,孟波.P2P经典路由算法的改进[J].计算机工程与设计,2004,25(2):262-264. 被引量:12
  • 2Cai M,Frank M,Chen J,et al.MAAN: A multi-attribute addressable network for grid information services[C].Phoenix,AZ:4th Int'l Workshop on Grid Computing,2003:184-191.
  • 3Brighten Godfrey P, Stoica I.Heteroganeity and load balance in distributed Hash tables[C].Miami,FL, USA: IEEE INFOCOM, 2005:596-606.
  • 4Theoni Pitoura, Nikos Ntarmos,Peter Triantafillou.Replication, load balancing and efficient range query processing in DHTs[C]. EDBT,2006:131-148.
  • 5Krishna P Gummadi,Stefan Saroiu, Steven D Gribble.King: estimating latency between arbitrary internet end hosts [C]. Marseille,France:Proceedings of SIGCOMMIMW,2002.
  • 6Bharambe A, Agrawal M, Seshan Mercury. Supporting scalable multi-attribute range queries [C]. Portland, Oregon: Proceedings ofACM SIGCOMM,2004:353-366.
  • 7刘云,马义忠,贠秋峰.Chord算法性能及优化策略分析[J].计算机工程与设计,2008,29(21):5454-5456. 被引量:7
  • 8Theoni Pitoura, Peter Triantafillou. Self-join size estimation in large-scale distributed data systems[C]. ICDE,2008:764-773.

二级参考文献14

  • 1陈东锋,杨寿保,彭小燕.TaChord :利用拓扑相关路由算法和超级节点的Chord系统(英文)[J].Journal of Southeast University(English Edition),2004,20(3):273-278. 被引量:4
  • 2张震,王晓明.对等网中Chord资源查找算法研究[J].计算机工程与应用,2006,42(11):147-152. 被引量:16
  • 3张浩,金海,聂江武,徐婕,章勤.Dual-Chord:一种更加有效的分布式哈希表[J].小型微型计算机系统,2006,27(8):1450-1454. 被引量:9
  • 4田隽,庞萍,张剑英,韩朝军.P2P网络中主流DHT搜索算法的分析比较[J].电脑知识与技术,2007(1):140-142. 被引量:4
  • 5Anjali Gupta,Barbara Liskov, Rodrigo Rodrigues.One hop lookups for peer-to-peer overlays[C]. Proc of the 9th Workshop on Hot Topics in Operating Systems,2003. http://www.usenix.org/ events/hotos03/.
  • 6Ion Stoica,Robert Morris,David Karger, et al.Chord: A scalable peer-to-peer lookup service for internet applications [C]. Proceedings ACM SIGCOMM, 2001:149-160.
  • 7Frans Kaashoek, David R Karger. Koorde:A simple degree-optimal Hash table[C]. Proceedings IPTPS, 2003.
  • 8Ben Y Zhao,John Kubiatowicz.Tapestry: An infrastructure for fault-tolerant wide-area location and routing[R]. Technical Report UCB/CSD-01 - 1141, Berkeley: Computer Science Division, 2001.
  • 9[1]Batchelder, Robert&Hayward, Simon. Peer-to-Peer-Something Old, Something new[J]. Gartner Group, 2001, 10(4).
  • 10[2]Anne Z. What can P2P apps do for enterprise user [EB/OL].Whitepaper, Peer-to-Peer Central.2001. http://www. peertopeercentral.com/whitepaper. html.

共引文献17

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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