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

基于网络拓扑和节点异构的Chord系统 被引量：3

Chord System Based on Network Topology and Heterogeneity of Nodes
下载PDF
导出
摘要 结构化P2P系统在建立逻辑覆盖图时并没有考虑实际的物理拓扑结构,导致覆盖网络与底层物理网络的严重不匹配。另外,结构化P2P系统也没有考虑节点的性能差异,这都影响了系统的路由效率。在结构化对等网络Chord基础上,提出了一种改进的路由算法THChord(Topology and Heterogeneity-based Chord),把物理拓扑相近的节点聚类,并引入超级节点对查询过的信息和热点信息进行缓存。仿真实验表明,THChord的路由性能与Chord相比有了明显的提高。 Structured P2P system didn＇t consider the actual physical topology when building the logical overlay, which would couse a serious mismatching between logical overlay network and physical network. In addition, Structured P2P system didn＇t attention the heterogeneity of nodes. All of these could affect the routing performance of the system. An advanced algorithm--THChord（Topology and Heterogeneity-based Chord） based on Chord was proposed. It clustered the close physical node, and used super node to cache searched information and hot information. Simulation experiments show that THChord could improve system＇s routing performance obviously.
作者 郭松梅 王新生 龚华 李春风
机构地区 燕山大学信息科学与工程学院
出处 《计算机科学》 CSCD 北大核心 2009年第3期90-92,共3页 Computer Science
关键词 结构化对等网络 拓扑匹配 界标簇 聚类 超级节点 Structured P2P, Topology matching, Landmark binning, Clustering, Supernode
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献10

  • 1Napster - file sharing system[EB/OL]. http : / / www. napster. com, 2002-11
  • 2Gnutella Website [EB/OL]. http://gnutella. wego. com, 2004- 09
  • 3Stoica I, Morris R, Karger D, et al. Chord.. a scalable peer-to-peer lookup service for internet applications[C]//Proc, of ACM SIC,- COMM. San Diego,California,August 2001
  • 4Ramasamy S, Francis P, Handley M, et al. A scalable contentaddressable network[C]// Proc. of ACM SIGCOMM. New York,2001
  • 5Rowston A,Druschel P. Pastry: scalable distributed object location and routing for large-scale peer-to-peer systems [C]/// Proc. of the 18th IFIP/ACM International Conference on Distributed System Platforms. Germany, 2001
  • 6Zhao B, Kubiatowicz J,Joseph A. Tapestry:an infrastructure for fault-resilient wide-area location and routing[R]. U. C. Berkeley,Tech. Rep. UCB//CSD-01-1141 ,April 2001
  • 7Saroiu S, Gummadi P K,Gribble S D. A measurement study of Peer-to-Peer file sharing systems // Proc. of the Multimedia Computing and Networking Conference. San Jose, California, USA, 2002
  • 8Sen Shubho, Wang Jia. Analyzing P 2 P traffic across large net - works///Proc, of the ACM SICK;OMM Internet Measurement Workshop (IMW). Marseilles, France, 2002
  • 9Ratnasamy S, Handley M, Karp R, et al. Topologically-aware overlay construction and server selection [C]// Proc. of INFOCOM 2002. 2002
  • 10Zegura EW, Calvert KL, Bhattacharjee S. How to model an internetwork//Proc. Of the INFOCOM' 96. New York: Institute of Electrical and Electronics Engineers, Inc. 1996 : 594-602

同被引文献30

  • 1熊继平,郭立鹏,洪佩琳,李津生.基于IPv6地址聚类性的改进型DHT网络[J].小型微型计算机系统,2006,27(8):1421-1425. 被引量：5
  • 2修志华,熊继平,李津生,洪佩琳.IPv6中基于节点异构的P2P改进系统[J].小型微型计算机系统,2007,28(3):407-410. 被引量：2
  • 3ZHOU Jiaogen GUAN Jihong LI Pingxiang.DCAD:a Dual Clustering Algorithm for Distributed Spatial Databases[J].Geo-Spatial Information Science,2007,10(2):137-144. 被引量：15
  • 4STOICA I, MORRIS R, KARGER D, et al. Chord: A scalable peer-to-peer lookup service for Internet applications [ C]//Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. New York: ACM, 2001: 149-160.
  • 5RATHASAMY S, FRANCIS P, HANDLEY M, et al. A scalable content-addressable network [ J]. SIGCOMM Computer Communication Review, 2001, 31(4): 161-172.
  • 6ZHAO B Y, HUNAG LING, STRBLNG J, et al. Tapestry: A resilient global-scale overlay for service deployment [ J]. IEEE Journal on Selected Areas in Communications, 2004, 22(1): 41 -53.
  • 7ROWSTON A, DRUSCHEL P. Pastry: Scalable, distributed objec! location and routing for large-scale peer-to-peer systems [ EB/OL]. (2005 - 06 - 21) [2010 - 01 - 12]. http://www, research. Microsoft, com/~ antr/PAST/pastry, ps.
  • 8ABBES T, BOUHOULA A, RUSINOWITCH M. On the fly pattern matching for intrusion detection with snort [ J]. Annals of Telecommunications, 2004, 59(9/10): 1-23.
  • 9AGRAWAL R, IMIELINSK T, SWAMI A. Mining association rules between sets of items in large database [ J]. ACM SIGMOD Record, 2008, 22(2): 207-216.
  • 10GRAHNE G, ZHU J F. Fast algorithms for frequent itemset mining using FP-trees [ J]. IEEE Transactions on Knowledge and Data Engineering, 2010, 17(10) : 1347 - 1362.

引证文献3

二级引证文献3

计算机科学
2009年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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