期刊文献+

基于信誉机制的Pastry网络模型的改进 被引量:1

IMPROVEMENT OF REPUTATION-MECHANISM-BASED PASTRY NETWORK MODEL
下载PDF
导出
摘要 Pastry以其鲁棒的结构化拓扑模型和有效收敛的最大掩码匹配算法,成为了目前较流行的P2P网络模型,但是它丢弃了路由历史中所包含的启发信息,忽略了路由表中节点的路由性能因素,较片面的路由准则将阻碍路由性能的提升。提出在节点交互后对服务节点进行服务效果的评估,将Pastry网络中节点距离的概念融入评估因素,把待选择节点与目标节点的掩码匹配值和待选择节点的路由信誉结合在一起,丰富了路由规则,有效地提高路由命中率。最后进行了模拟实验,证明路由效率确实得到了提高。 Pastry has become a popular P2P network model for its robust structured topology model and effective convergent maximum mask matching algorithm.However it loses the illuminative information which the router history contains;and it ignores the router performance factors of nodes in the routing table.Its one-sided routing guidelines will hinder the routing performance improvement.The article suggests an assessment over service effects of service nodes after nodes interactions,melting the concept of node distance in Pastry network into assessment factors,and integrating the mask matching values of choice nodes and goal nodes with the router reputation of the choice nodes in order to enrich the router rules and effectively improve the router hit probability.In the end a simulation experiment is carried out which proves that the router efficiency is indeed improved.
出处 《计算机应用与软件》 CSCD 2011年第12期236-238,共3页 Computer Applications and Software
关键词 信誉模型 P2P网络 Pastry网络模型 Reputation model P2P networks Pastry network model
  • 相关文献

参考文献7

  • 1Beth T, Borcherding M, Klein B. Valuation of trust in open network [ C ]//Proe. Of the European Symp. on Research in Security ( ESO- RICS ). Brighton: Springer-Verlag, 1994:3 - 18.
  • 2Rowston A, Drusehel P. Pastry: Sealable Distributed Object Location and Routing for Large-scale Peer.to-peer Systems I C ]//Heidelberg: [s. n. ] ,2001:161 -172.
  • 3Comelli F, Damiani E, Sabrina De Capitani di Vimercati, et al. Choo- sing Reputable Servents in a P2P Networks [ C]//12th International World Wide Web Conference, Budapest: ACM Press,2002:441 - 449.
  • 4Kamvar S D ,Schlosser M T. EigenRep: reputation management in P2P networks[ C]//12th International World Wide Web Conference Buda- pest New York :ACM Press,2003 : 123 - 134.
  • 5吴仲华,王贵竹.基于Pastry改进的P2P模型[J].通信技术,2010,43(3):96-97. 被引量:3
  • 6喻梅.基于P2P系统的分布式查询算法的研究.计算机应用技术,2008,(1).
  • 7Brite. A Network Topology Generator Website[ EB/OL ]. (2008 -02 - 11 ) [2009 -03 -14]. http://www. CS. bu. edu/brite.

二级参考文献7

  • 1Stoica I,Morris R.Chord:A Scalable Peer-to-peer Lookup Service for Internet Application[J].IEEE/ACM Trans.2003,11(01):17-32.
  • 2Rowston A,Druschel P.Pastry:Scalable Distributed Object Location and Routing for Large-scale Peer-to-peer Systems[C].Heidelberg:[s.n.],2001:161-172.
  • 3Zhao B Y.Tapestry:A Resillent Global-Scale Overlay for Service Deployment[J].IEEE JSAC,2004,22(01):41-53.
  • 4Mullet W,Boykin P O,Roychowdhury V P,et al.Comparison of Image Similarity Queries in P2P Systems[J].USA:IEEE,2006:98-105.
  • 5Chen Wentsuen,Chao Chihong.An Interested-based Architecture for Peer-to-Peer Network Systems[C].USA:IEEE,2006:707-712.
  • 6Tao Gu,Hung Kengpung,Zhang Daqing.Information Retrieval in Schema-based P2P Systems Using One-dimensional Semantic Space[J].Elserier North-Holland,2007,51(16):4543-4560.
  • 7Brite.A Network Topology Generator Website[EB/OL].(2008-02-11)[2009-03-14]http://www.CS.bu.edu/brite.

共引文献2

同被引文献6

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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