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

基于分布式哈希表对等网络的Web服务发现 被引量：1

Web Service Discovery Based on DHT Peer-to-Peer Network
在线阅读 下载PDF
导出
摘要 采用基于分布式哈希表(Distributed Hash Table,DHT)的对等网络构建了一个用于Web服务发现的分布式注册中心PWSD(Peer-to-Peer Web Service Discovery).在PWSD中,服务信息完全以非集中式的方式进行管理.针对原始的DHT路由算法无法支持基于XML的Web服务发现过程,扩展了DHT路由算法(以Chord为例)以支持基于XPath的路由查询.实验结果表明,PWSD具有良好的可扩展性. This paper proposed a scalable Web service discovery architecture based on DHT （distributed Hash table） peer-to-peer overlay network named PWSD （peer-to-peer Web service discovery）. In PWSD, the service descriptions are managed in a completely decentralized way. Moreover, since the basic peer-to- peer routing algorithm can not be applied directly in the service discovery process, the basic peer-to-peer routing algorithm was extended with XML support, which enables PWSD to support XPath query. The experimental results show that the PWSD has good scalability.
作者 李寅 马范援 邹福泰
机构地区 上海交通大学计算机科学与工程系
出处 《上海交通大学学报》 EI CAS CSCD 北大核心 2006年第5期805-809,共5页 Journal of Shanghai Jiaotong University
基金 2003上海市科委科技攻关重大项目(03dz15027 03dz15028)
关键词 对等网络 分布式哈希表 WEB服务发现 peer-to-peer network distributed Hash table （DHT） Web service discovery
分类号 TP393.09 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献5

  • 1Stoica I, Morris R, Karger D, et al. Chord: A scalable peer-to-peer lookup service for internet applications[C]//ACM SIGCOMM. San Diego, CA: ACM Press,2001: 149-160.
  • 2邹福泰,潘乐云,吴增德,马范援.基于会话异构的结构化对等网络拓扑模型[J].上海交通大学学报,2004,38(z1):145-147. 被引量：5
  • 3Balazinska M, Balakrishnan H, Karger D. INS/Twine: A scalable peer-to-peer architecture for intentional resource discovery[C]// International Conference on Pervasive Computing. Heidelberg, Germany:Springer, 2002. 195--210.
  • 4Schmidl C, Parashar M. A peer-to-peer approach to web service discovery[J]. World Wide Web Journal,2004,7(2) : 211-229.
  • 5Zegura E W, Calvert K L, Bhattacharjee S. How to model an internetwork[C]/IEEE Conference on Computer Communications ( INFOCOMM'96). New York IEEE Press, 1996:594-602.

二级参考文献6

  • 1[1]Stoica I, Morris R, Karger D, et al. Chord: a scalable peer-to-peer lookup service for Internet applications[A]. ACM SIGCOMM[C]. San Diego, CA:ACM Press, 2001.
  • 2[2]Druschel P, Rowstronand A. Pastry: scalable, distributed object location and routing for large-scale peer-to peer systems [A]. Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms [ C ]. Heidelberg, Germany:Springer, 2001.
  • 3[3]Zhao B Y, Huang L, Stribling J, et al. Tapestry: a resilient global scale overlay for service deployment [J]. IEEE Journal on Selected Areas in Communica tions, 2004, 22(1):41-53.
  • 4[4]Sylvia R, Paul F, Mark H, et al. A scalable contentaddressable network [A]. ACM Sigcomm [C]. San Diego, CA:ACM Press, 2001. 161-172.
  • 5[5]Xu Z, Rui M, Hu Y. Reducing maintenance overhead in DHT based peer-to-peer algorithms[A]. Proceedings of the 3rd International Conference on Peer-toPeer Computing (P2P'03) [C]. Sweden: Linkpings,2003.
  • 6[6]Sariou S, Gummadi K, Gribble S. A measurement study of peer-to-peer file sharing systems [A]. Proceedings of Multimedia Conferencing and Networking [C]. San Jose: ACM Press, 2002.

共引文献4

同被引文献5

  • 1葛继科.基于本体层次结构的服务匹配研究[J]西南大学学报,2009(02):303-342.
  • 2S Li,J Zhang,X Huang,S Bai. Semantic Computation in Chinese Question-Answering System[J].Journal of Computer Sciennce and Technology,2002,(06):933-939.
  • 3E Agirr,G Rigau. Word sense disambiguation using conceptual density[A].1996.16-22.
  • 4E Agirre,G Rigau. A Propoeal for word Sense disambiguation using conceptual distance[A].1995.12-17.
  • 5乔丽,李昊,侯胜利,王威.基于节点误差网络重构的故障诊断模型[J].计算机仿真,2010,27(7):239-243. 被引量：2

引证文献1

上海交通大学学报
2006年 第5期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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