基于组合上下文的服务替换方法

doi:10.3969/j.issn.1000-436x.2014.09.006

摘要/Abstract

摘要：

随着用户需求的多样性和网络环境的日益复杂性，组合服务的复杂程度越来越高，在对失效服务进行替换时，为了减少被替换服务的冗余信息和提高替换方法的准确性，提出以待替换服务的组合上下文为研究对象，通过以下2个步骤完成替换：第一，基于已有的着色petri网服务工作流建模方法，提出服务的组合上下文信息采集算法(CCICA,composition context information collection algorithm)，以服务的组合上下文为服务信息采集源；第二，提出基于编辑距离的服务替换方法(LDBSSM,levenshtein distance-based service substitution method)，并将服务接口的依赖关系加入到了算法中。仿真实验表明，该方法不仅较好地减少了被替换服务的信息冗余，而且有效提高了服务替换的准确性，具有更好的实用价值。

关键词: 服务替换, 组合上下文, 着色petri网, 编辑距离

Abstract:

With the variety of requirements from service requesters and the increasing complexity of network environ-ments,service composition has become more and more complicated.In order to decrease redundant information of the substituted service and improve the accuracy of service substitution,the composition context was regarded as the match-ing criteria and tried to substitute failed service with the following two steps.First,a composition context information collecting algorithm (CCICA) was proposed based on the color petri net model of the service workflow,and regarded the composition context as the collecting source of service information.Second,a levenshtein distance-based service substi-tution method (LDBSSM) was given,which was integrated with dependencies between service interfaces.Simulation re-sults show that the proposed LDBSSM method is practical because it can not only reduce redundancy of substituted ser-vice information but also effectively improve the accuracy of service substitution.

Key words: service substitution, composition context, colored petri net, levenshtein distance

王海艳,李思瑞. 基于组合上下文的服务替换方法[J]. 通信学报, 2014, 35(9): 57-66.

Hai-yan WANG,Si-rui LI. Service substitution method based on composition context[J]. Journal on Communications, 2014, 35(9): 57-66.

图/表 8

图1

图2

表1

表2

图3

图4

图5

图6

参考文献 18

[1]	ZHANG M W , ZHU Z L , ZHANG L , et al. An execution context aware approach for Web service substitution[A]. Proc of the Interna-tional Conference on Advanced Information Management and Ser-vice[C]. Jeju,Korea, 2011.13-18.
[2]	CHAN N N , GAALOUL W , TATA S , et al. Composition context matching for Web service recommendation[A]. International Confer-ence on Services Computing[C]. Washington DC,USA, 2011.624-631.
[3]	LI K , XIA Y J , WU J , et al. Analyzing behavioral substitution of Web services based on π-calculus[A]. IEEE International Conference on Web Services[C]. Miami,FL,USA, 2010.441-448.
[4]	LI K , XIA Y J , WU J , et al. Analyzing behavioral substitution of Web services based on π-calculus[A]. IEEE International Conference on Web Services[C]. Miami,FL,USA, 2010.441-448.
[5]	刘莹，张一川，张斌等．基于行为效果的服务可替换性分析[J]．计算机研究与发展， 2010,47(8):1442-1449. LIU Y , ZHANG Y C , ZHANG B , et al. Analysis of service replace-ability on behavior effect[J]. Journal of Computer Research and Development, 2010,47(8):1442-1449.
[6]	DUMAS M , YANG Y , ZHANG L , et al. Improving Web service survivability via gracefully degraded substitution[A]. International Conference on Web Intelligence and Intelligent Agent Technology[C]. Toronto,Canada, 2010.597-600.
[7]	邓水光，尹建伟，李莹等．基于二分图匹配的语义Web服务发现方法[J]．计算机学报， 2008,31(8):1364-1375. DENG S G , YIN J W , LI Y , et al. A method of semantic Web service discovery based of bipartite graph matching[J]. Chinese Journal of Computers, 2008,31(8):1364-1375.
[8]	ZHANG C , CHEN H P , DU J B . A Tabu search approach for dynamic service substitution in SOA applications[A]. IEEE Asia Pacific Ser-vices Computing Conference[C]. Jeju,Island,Korea, 2011.284-289.
[9]	TAN W , FAN Y S , ZHOU M . A petri net-based method for compatibil-ity analysis and composition of Web services in business process exe-cution language[J]. IEEE Transactions on Automation Science and Engineering, 2009,6(1):94-106.
[10]	李喜彤，范玉顺． Web 服务流程相容性和相似性分析[J]．计算机学报， 2009,32(12):2429-2437. LI X T , FAN Y S . Analyzing compatibility and similarity of Web service process[J]. Chinese Journal of Computers, 2009,32(12):2429-2437.
[11]	胡俊，范举，陈姗姗等．空间数据上 Top-k 关键词模糊查询算法[J]．计算机学报， 2012,35(11):2237-2246. HU J , FAN J , CHEN S S , et al. Top-k fuzzy spatial keyword search[J]. Chinese Journal of Computers, 2012,35(11):2237-2246.
[12]	LAVOIE T , MERLO E . An accurate estimation of the levenshtein distance using metric trees and manhattan distance[A]. International Workshop on Software Clones[C]. Zurich, 2012.1-7.
[13]	SUNG-HWAN K , JONG-KYU S , HWAN-GUE C . Flexible and effi-cient string similarity search with alignment-space transform[A]. Pro-ceedings of the 7th International Conference on Ubiquitous Informa-tion Management and Communication[C]. New York,NY,USA, 2013.
[14]	JENSEN K . An introduction to the theoretical aspects of colored petri nets[J]. Lecture Notes in Computer Science, 1994,803:230-272.
[15]	郭玉彬，杜玉越，奚建清． Web 服务组合的有色网模型及运算性质[J]．计算机学报， 2006,29(7):1067-1075. GUO Y B , DU Y Y , XI J Q . A CP-net model and operation properties for Web service composition[J]. Chinese Journal of Computers, 2006,29(7):1067-1075.
[16]	ZHENG Z B , LYU M R . Optimal fault tolerance strategy selection for Web services[J]. International Journal of Web Services Research, 2010,7(4):21-40.
[17]	ZHENG Z B , LYU M R . An adaptive QoS-aware fault tolerance strategy for Web services[J]. Empirical software Engineering, 2010,15(4):323-345.
[18]	SANTHANAM G R , BASU S , HONVAR V . Web service substitution based on preferences over non-functional attributes[A]. IEEE Interna-tional Conference on Services Computing[C]. Bangalore,India, 2009.210-217.

服务集	r₁/%	服务集	r₁/%
S-1	0	S-6	50
S-2	10	S-7	60
S-3	20	S-8	70
S-4	30	S-9	80
S-5	40	S-10	90

服务集	r₂/%	服务集	r₂/%
S'-1	0	S'-6	50
S'-2	10	S'-7	60
S'-3	20	S'-8	70
S'-4	30	S'-9	80
S'-5	40	S'-10	90