期刊文献+

改进的网络服务资源定位算法

Improved Algorithm for Web Service Resource Location
下载PDF
导出
摘要 针对对等网络中Chord模型的不足,以网络资源定位为研究对象,将减少资源定位的等待时间作为改进目标,在分析现有解决思路和方法的基础上,引入双向路由机制和考虑后继节点列表的路由选择机制。针对模型的改变,对原有路由方法、稳定机制和路由信息的维护方法进行修改,并加以实现。模拟实验证明,与原算法相比,该改进资源定位算法减少了资源定位的等待时间。 This paper puts forward an improvement goals for the Chord model, such as reducing query waiting time, and analyzes the existing ideas and methods to achieve these goals. It introduces the bidirectional routing mechanism into the new algorithm and takes the successors list into the consideration of the next route hop chosen mechanism. Simulation result shows the algorithm has less queries waiting time than the original algorithm.
出处 《计算机工程》 CAS CSCD 北大核心 2009年第5期19-21,33,共4页 Computer Engineering
基金 国家"863"计划基金资助项目"动态Web服务组合关键技术及其性能分析研究"(2007AA01Z138)
关键词 资源定位 双向路由 后继节点列表 resource location bidirectional routing successor node list
  • 相关文献

参考文献5

二级参考文献16

  • 1唐辉,李祖鹏,张国杰,黄建华.结构化覆盖网络模型Chord研究[J].计算机工程与应用,2005,41(1):132-135. 被引量:14
  • 2苏忠,战晓雷,对等网[M].清华大学出版社2003.2
  • 3Clay Shirky.What is p2p and what is t[C].In:O'Reilly's Emerging Technology Conference,2002,5
  • 4Napster Inc[EB/OL].http://www.naspter.com
  • 5Gnutella[EB/OL].http://www.gnutelliums.com
  • 6BitTorrent[EB/OL].http://bitconjurer.org/BitTorrent/
  • 7Stoica I,Morris R,Karger D,et al.Chord:A Scalable Peer-to-peer Lookup Service for Internet Applications[C]//Proceedings of the ACM SIGCOMM'01,San Diego,CA.2001-08.
  • 8Karger 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]//Proceedings of the 29th Annual ACM Symposium on Theory of Computing.1997-05.
  • 9FIPS 180-2-02 Secure Hash Standard,Federal Information Processing Standards Publication[S].Department of Commerce,NIST,2002-08.
  • 10Stoica I,Morris R,Liben-nowell D,et al.Chord:A Scalable Peer-to-peer Lookup Protocol for Internet Applications[J].IEEE/ ACM Transactions on Networking,2003,11(1).

共引文献17

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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