期刊文献+

P2P环境下基于双层代理的服务发现模型 被引量:1

Two-layered Agent Based Model for Service Discover in P2P Environment
下载PDF
导出
摘要 以集中式注册中心为核心的面向服务体系结构和以服务提供商为中心的服务组织模式容易导致用户发现和订阅服务的难度随着服务的增加而增加。针对上述问题,该文提出一种P2P环境下基于双层代理的语义Web服务发现模型。该模型通过双层代理机制实现基于语义的Web服务的发现和匹配,并提供服务质量协商机制。实验表明该模型具有较高的查全率和查准率。 Service oriented architecture organizes services in a provider-centric manner and discovers services in a centralized register mechanism, which brings a critical problem that more services come to being more complex and difficult the service discovery and subscription become. A two-layered agent based model for semantic service discover in P2P environment is proposed in this paper to address the problem. The model implements semantic service discovery through two-layered agent mechanism and provides QoS negotiation mechanism. Experiments indicate the model has a high recall rate and precision rate.
出处 《计算机工程》 CAS CSCD 北大核心 2009年第2期118-120,128,共4页 Computer Engineering
基金 国家自然科学基金资助项目(70771077)
关键词 P2P网络 社区 代理 服务匹配 服务质量 P2P networks community agent service match QoS
  • 相关文献

参考文献4

二级参考文献24

  • 1Wang G Y. Algebra view and information view of rough sets theory[A]. Data Mining and knowledge Discovery: Theory, Tools, and Technology Ⅲ, Proceedings of SPIE [C], 2001,4384:200-207.
  • 2Guan J W, Bell D A, Guan Z. Matrix computation for information systems[J]. Information Sciences, 2001,131:129-156.
  • 3Kryszkiewicz M. Rough set approach to incomplete information systems[J]. Information Sciences.1998,112: 39-49.
  • 4Slowinski R, Vsnderpooten D. A Generalized definition of rough approximations based on similarity[C]. IEEE Trans on Data and Knowledge Engineering, 2000,12(2): 331-336.
  • 5Tzung-Pei Hong, Li-Huei Tseng, Shyue-Liang Wang. Learning Rules from incomplete training examples by rough sets[J]. Expert Systems with Applications, 2002,22: 285-293.
  • 6Kreger H. IBM Web Services Conceptual Architecture. 2001.http://www.ibm.com.
  • 7Papazoglou M P, Georgakopoulos D. Service-oriented computing: Introduction. Communications of ACM, 2003, 46(10):24-28.
  • 8Avizienis A, Laprie J C, Randell Bet al. Basic concepts and taxonomy of dependable and secure computing. IEEE Trans.Dependable and Secure Computing, 2004, 1(1): 11-33.
  • 9Tsai W T, Song W, Paul R et al. Services-oriented dynamic reconfiguration framework for dependable distributed computing. In 28th Annual Int. Computer Software and Applications Conf. (COMPSAC), Hongkong, China, 2004, pp.554- 559.
  • 10WebLogic Homepage. http://www.bea.com.

共引文献45

同被引文献5

  • 1Barab~isi A, Albert R. Emergence of Scaling in Random Networks[J]. Science, 1999, 286(5739): 509-512.
  • 2Boccaletti S, Latora V, Moreno Y, et al. Complex Networks: Structure and Dynamics[J]. Physics Reports, 2006, 424(4/5): 175-308.
  • 3Kleinberg J. The Small-world Phenomenon: An Algorithmic Perspective[C]//Proceedings of the 32nd Annual ACM Symposium on Theory of Computing. New York, USA: ACM Press, 2000: 163-170.
  • 4Barrat A, Barthelemy M, Vwspignani A. Weighted Evolving Networks: Coupling Topology and Weight Dynamics[J]. Phys. Rev. Lett., 2004, 92(22): 87-92.
  • 5陶少华,杨春,李慧娜,张勇.基于节点吸引力的复杂网络演化模型研究[J].计算机工程,2009,35(1):111-113. 被引量:14

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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