[1]李文清,张常有,曹元大,等.Web服务对等联盟组织演化机制[J].东南大学学报(自然科学版),2011,41(3):463-467.[doi:10.3969/j.issn.1001-0505.2011.03.006]
 Li Wenqing,Zhang Changyou,Cao Yuanda,et al.Evolving mechanism of peer to peer alliance for Web service[J].Journal of Southeast University (Natural Science Edition),2011,41(3):463-467.[doi:10.3969/j.issn.1001-0505.2011.03.006]
点击复制

Web服务对等联盟组织演化机制()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
41
期数:
2011年第3期
页码:
463-467
栏目:
计算机科学与工程
出版日期:
2011-05-20

文章信息/Info

Title:
Evolving mechanism of peer to peer alliance for Web service
作者:
李文清1张常有12曹元大1赵正旭2
(1北京理工大学计算机学院,北京 100081)
(2 石家庄铁道大学信息科学技术学院,石家庄 050043)
Author(s):
Li Wenqing1Zhang Changyou12Cao Yuanda1Zhao Zhengxu2
(1School of Computer, Beijing Institute of Technology, Beijing 100081, China)
(2 School of Informatics Science and Technology, Shijiazhuang Tiedao University, Shijiazhuang 050043, China)
关键词:
Web服务对等联盟演化机制
Keywords:
Web service peer-to-peer alliance evolving mechanism
分类号:
TP393.104
DOI:
10.3969/j.issn.1001-0505.2011.03.006
摘要:
为提高分布式非结构化对等网络中Web服务发现的效率和稳定性,设计了一种以Web服务提供者的服务内容为评价依据的对等联盟演化机制.根据该机制,服务提供者依据各自提供的Web服务内容之间的相似程度,自发形成联盟.每个提供者维护的同盟表用来保存部分盟友列表,从全局形成服务联盟.服务提供者根据盟友关系将Web服务的描述信息发布给多个盟友,用以提高查询效率,从而构成分布式的Web服务发布体系.针对这种没有超级节点的纯分布式对等联盟,设计了其组织发展演化的动态管理协议.协议参数控制了成员的加入联盟、解除盟约,以及联盟的分裂、合并等自治活动.在大规模动态变化的网络环境下,模拟实验验证了联盟管理协议的有效性和稳定性.
Abstract:
In order to improve the efficiency and robustness of the Web service discovery process in the distributed peer-to-peer network, an alliance-based peer-to-peer network management mechanism is designed based on the content similarity among Web service providers. By measuring the similarity among service contents provided by each provider, the similar providers are clustered into the same alliance by autonomy. An alliance-list in each provider is built to contain several (not all) members’ information in the same alliance, called direct membership. According to the alliance-list, Web service descriptions are published to the alliance members in direct membership. In this way, the distributed Web service discovery mechanism is constructed. And, a dynamic self-management protocol is designed. Parameters of this protocol control the processes of member joining, membership revoking, alliance splitting and alliance merging. The experimental results show that the protocol is efficient and robust in a large system scale.

参考文献/References:

[1] Mache C.CTO roundtable:cloud computing [J].Communications of the ACM,2009,52(8):50-56.
[2] Eyhab A,Qusay H.Investigating Web services on the World Wide Web[C]//Proceedings of the 17th International Conference on World Wide Web.New York,2008:795-804.
[3] IBM,Microsoft.Web services inspection language [EB/OL].(2007-01-05)[2007-01-25].https://www.ibm.com/developerworks/library/specification/ws-wsilspec/.
[4] Benatallah B,Sheng Q Z,Dumas M.The SELF-SERV environment for Web services composition [J].IEEE Internet Computing,2003,7(2):40-48.
[5] Li R,Zhang Z,Wang Z,et al.Web-peer:a P2P-based system for publishing and discovering Web services [C]//Proceedings of 2005 IEEE International Conference on Services Computing.Orlando,USA,2005:149-156.
[6] Farnoush B,Chen C,Cyrus S.WSPDS:Web services peer-to-peer discovery service [C]//Proceedings of the International Conference on Internet Computing.Las Vegas,USA,2004:733-739.
[7] Li W,Zhang C,Zhang K.A Web service matching method based on distributed content semantics[C]//Proceedings of 2nd IEEE International Conference on Network Infrastructure and Digital Content.Beijing,China,2010:604-608.
[8] 张常有,曹元大,刘丹,等.I-Wander:一种面向非结构化对等网络的Web服务发现方法[J].北京理工大学学报,2008,26(6):521-525.
  Zhang Changyou,Cao Yuanda,Liu Dan,et al.I-Wander:a Web service discovery method for unstructured P2P network[J].Transactions of Beijing Institute of Technology,2008,26(6):521-525.(in Chinese)
[9] Eytan A.GUESS:the graph exploration system version 1.0.1 (beta) [EB/OL].[2010-01-14].http://graphexploration.cond.org/manual.html.

相似文献/References:

[1]周宇,张鹏程,李必信.一种Web服务组合的数学模型[J].东南大学学报(自然科学版),2007,37(4):593.[doi:10.3969/j.issn.1001-0505.2007.04.010]
 Zhou Yu,Zhang Pengcheng,Li Bixin.Mathematical model for Web service composition[J].Journal of Southeast University (Natural Science Edition),2007,37(3):593.[doi:10.3969/j.issn.1001-0505.2007.04.010]
[2]谢春丽,李必信,苏志勇.基于WSDG的Web服务组合可靠性预测[J].东南大学学报(自然科学版),2012,42(6):1074.[doi:10.3969/j.issn.1001-0505.2012.06.010]
 Xie Chunli,Li Bixin,Su Zhiyong.WSDG-based reliability prediction approach for Web service composition[J].Journal of Southeast University (Natural Science Edition),2012,42(3):1074.[doi:10.3969/j.issn.1001-0505.2012.06.010]
[3]王喜凤,李必信,廖力,等.基于优化逆问题的Web服务选择[J].东南大学学报(自然科学版),2011,41(3):437.[doi:10.3969/j.issn.1001-0505.2011.03.001]
 Wang Xifeng,Li Bixin,Liao Li,et al.Inverse optimization problem based Web services selection[J].Journal of Southeast University (Natural Science Edition),2011,41(3):437.[doi:10.3969/j.issn.1001-0505.2011.03.001]
[4]翟社平,魏娟丽,李增智.基于Agent协商的语义Web服务知识模型[J].东南大学学报(自然科学版),2009,39(6):1114.[doi:10.3969/j.issn.1001-0505.2009.06.006]
 Zhai Sheping,Wei Juanli,Li Zengzhi.Semantic Web services knowledge model based on agent negotiation[J].Journal of Southeast University (Natural Science Edition),2009,39(3):1114.[doi:10.3969/j.issn.1001-0505.2009.06.006]
[5]孙明杰,李必信,张鹏程.一种基于监控需求的Web服务运行时监控方法[J].东南大学学报(自然科学版),2009,39(4):716.[doi:10.3969/j.issn.1001-0505.2009.04.013]
 Sun Mingjie,Li Bixin,Zhang Pengcheng.Monitoring requirements-based method for runtime monitoring of Web services[J].Journal of Southeast University (Natural Science Edition),2009,39(3):716.[doi:10.3969/j.issn.1001-0505.2009.04.013]
[6]冯名正.CORBA与Web服务集成技术[J].东南大学学报(自然科学版),2005,35(6):843.[doi:10.3969/j.issn.1001-0505.2005.06.003]
 Feng Mingzheng.Integration of Web Services and CORBA[J].Journal of Southeast University (Natural Science Edition),2005,35(3):843.[doi:10.3969/j.issn.1001-0505.2005.06.003]

备注/Memo

备注/Memo:
作者简介:李文清(1982—),女,博士生;张常有(联系人),男,博士,教授,zhangchangyou@tsinghua.org.cn.
基金项目:河北省自然科学基金资助项目(F2009000929)、国家自然科学基金资助项目(60873208).
引文格式: 李文清,张常有,曹元大,等.Web服务对等联盟组织演化机制[J].东南大学学报:自然科学版,2011,41(3):463-467.[doi:10.3969/j.issn.1001-0505.2011.03.006]
更新日期/Last Update: 2011-05-20