基于QoS的可信Web服务关键技术研究
|
摘要
随着互联网技术的不断发展,Web服务技术逐渐成为当前的一大研究热点。在Web服务技术众多研究中,Web服务的可信性已成为国际上致力于要解决的重要课题。对于部署在分布、开放、多变、难控的网络环境下的Web服务,保证其能够正确、安全和有效的为用户提供服务显得尤为重要。因此,进行高可信的Web服务研究具有一定的战略性、基础性和前瞻性,对我国软件业发展具有重大意义。
随着Web服务技术的不断发展,各种各样的应用也随之出现。因此,服务质量(Quality of Service, QoS)逐渐成为Web服务中的一个关键技术点,而通过对QoS的评价可判断Web服务的可信性。在目前的研究中,基于QoS的可信Web服务评价多集中在可信度量、QoS管理等方面。虽取得了一定的成果,但在某些问题上仍然缺乏深入的研究。基于Web服务的研究趋势和对Web服务进行可信评价问题的研究现状,本文从以下几个角度对基于QoS的可信Web服务问题进行了深入的研究,取得了以下研究成果：
1)针对当前分布式QoS代理难于有效支持QoS的范围查询等问题,提出一种基于QoS的分布式Web服务索引框架。该框架由两层结构的分布式系统构成,其中第一层运用Chord网络对具有相同或类似功能的Web服务进行分类管理,第二层主要用于管理领域相关的Web服务的QoS。为构建用于分布式管理的QoS多维空间,将分类管理的QoS进行归一化,并引入了基于KD-Tree的多维数据管理方式。KD-Tree实现了QoS的范围查询,通过范围查询的方式,可筛选掉大量不满足非功能需求的Web服务。为保证分布式系统的查询效率,提出了基于QoS-Tree的管理方式。QoS-Tree是通过占优关系而构建的,其不仅实现了KD-Tree中涉及到的范围查询功能,而且通过QoS-Tree中占优关系可以较容易的找到满足用户需求的QoS。另外,为避免分布式QoS-Tree中查询负载不均衡,一种负载均衡机制被引入到系统中。实验表明所提出的两种分布式树型结构均能有效支持QoS的范围查询,且QoS-Tree的查询效率要优寸KD-Tree。
2)针对开放环境对Web服务中某些QoS指标造成的影响,提出了基于区间型QoS和概率区间型QoS的度量方式以及相应的服务选择算法。区间型QoS的度量方式是通过比较QoS区间上的概率密度来获取QoS中某些指标受动态环境影响的程度。这种方式正确性虽高,但其比较方式只适合于单个或少量的服务选择。概率区间型QoS的度量方式主要是通过计算QoS概率密度区间的置信上、下界与其均值的偏差来描述动态环境对Web服务的影响,因此,最优组合服务的选择可采用均值的加权和最大以及偏差最小来度量。将该度量方式转化为单目标组合优化问题,提出了一种基于社团划分的改进遗传算法。算法通过社团划分方式维护种群的多样性,并通过优良模式的叠加以提高种群收敛速度。仿真实验表明两种度量方法均能有效克服动态环境对服务选择的影响,且基于区间型QoS的度量方式在正确率方面要比基于概率区间型QoS略高。但概率密度的度量方式更适合于采用遗传算法进行全局寻优。实验表明,改进遗传算法提高了服务选择的效率。
3)为提高Web服务选择过程中服务之间的合作可信,提出了一种Web服务合作声誉模型。为描述这种合作信誉,构建了Web服务合作网(Web Service Collaboration Network, WSCN)。在合作网中,邻居更新机制能淘汰虚假服务,保证候选服务的可信性。根据合作网结构,任何Web服务都包含两种关系,调用关系和合作关系。因此,Web服务合作声誉可通过这两种关系进行度量。该声誉模型包括两类指标,调用声誉是通过在WSCN的社区结构中选择适当推荐者而计算得到；被调用声誉指标是通过Web服务之间的调用频率来评价。基于WSCN,提出一种Web可信服务选择算法。实验表明WSCN保证了服务选择的可信性,声誉模型能有效的组织Web服务之间最可信的服务进行组合,同时合作关系能有效地加速服务选择的过程。
4)为解决海量Web服务带来的服务信息维护开销,提出一种基于云计算的Web服务管理平台。该平台分为四层,最底层由Hadoop分布式文件系统构成,用于支撑整个云环境。HBase支撑Web服务信息注册层,主要用于管理从Web服务中获取的功能和非功能属性。此外,为进一步提高Web服务选择效率,HBase表中还负责维护了Web服务之间的合作关系以及本体树和QoS-Tree。平台中的核心层使用的是MapReduce技术,该层主要是为满足Web服务信息的有效存储,提出了基于MapReduce的QoS数据提取、转换、加载操作和数据挖掘算法。在复杂的Web服务选择方面,通过MapReduce并行搜索所有可能的路径,并获取其中的最优解决方案。实验结果表明所提出的框架更适合海量Web服务的管理。
With network technology's development, many researchers have done lots of job in web service field. In many research areas of web service, the trustworthiness becomes the significant research subject. Due to the open, distributed, uncertain and uncontrollable network environment which web service deploys, providing accurate, secure and effective service for customers becomes especially important. Thus, the research on high-trustworthy web service is a prospective, basic and strategic task, it plays a significant role in the software development.
With web service technology's development, various applications based on it have emerged. The QoS research increasingly becomes a critical problem, and the trustworthiness of web service can be assessed by QoS. In recent years, the approaches to evaluate web service's trust based on QoS concentrate in trust evaluation, QoS management, and so on. However, some areas have not been well researched or even considered. Based on current web service research and status of trust evaluation based on QoS, we address some critical problems on trustworthy web service based on QoS.
The contribution of this dissertation includes:
1) To solve the problem that distributed QoS broker cannot support range query, a distributed web service index framework based on QoS is proposed. The framework consists of two kinds of structured distributed system, one is chord overlay network which is assigned to classify the web services according to the similarity of the functional properties, the other manages QoS of domain-related web service. To construct a multi-dimension QoS space, the classified QoS is normalized, and the distributed tree structure KD-Tree is introduced. In KD-Tree, the range query method is realized, by using this method, all satisfied QoS can be obtained. To improve the query effectiveness, another distributed tree structure QoS-Tree is proposed, and the range query method is also supported by QoS-Tree. Due to the dominated relationship in QoS-Tree, the query efficiency can be guaranteed. Additionally, to avoid the imbalance of query load in the distributed system, a load balance strategy is introduced which can balance workload efficiently. Experimental results validate the effectiveness of the proposed distributed tree structure approaches for complex query, and query cost of QoS-Tree is better than that of KD-Tree.
2) To solve the effect which open environment imposes on some QoS, a web service selection algorithm based on interval and probability interval QoS are proposed. The interval QoS measurement can effectively assess the uncertainty by comparing the probability density in QoS interval. Although the accuracy can be guaranteed, this method can only apply for a few web services to be combined. The effect described by probability interval can be evaluated by using the difference between the mean of probability density and the upper, lower bounds of probability density. Thus, the composite web service with probability interval QoS global optimization can be evaluated with the maximum weighted sum of mean and the minimum difference, and this measurement is transformed into combinatorial optimization, and a genetic algorithm is developed based on the community detection. The population diversity can be maintained by the multi-community structure, and excellent schema combination accelerates the population's convergence. The experimental results show that these two methods contribute to reduce the influence of dynamic environment. The accuracy measured by interval QoS is slightly higher than that of probability interval QoS, however, the genetic algorithm can apply to service selection based on probability interval to search for global optimum. The experiment of the improved GA shows that the selection efficiency based on probability interval QoS is enhanced.
3) To improve the collaboration trust between web services during selection process, a novel reputation model called collaboration reputation is proposed. To describe this reputation model, a web service collaboration network is constructed. In WSCN, the false web service is eliminated by using the neighbor update mechanism, and the credibility of web service selection can be guaranteed. According to the collaboration network, any web service has two types of relationship, invoking and invoked relationship. Therefore, the collaboration reputation can be assessed by these relationships. It includes two metrics; one called invoking reputation is computed by the proper recommender, which is selected in WSCN's community, the other is assessed by the invoked web service. In addition, the web service selection based on WSCN is designed. With the collaboration reputation guaranteed, the selection efficiency and the solution's credibility are both increased. Experimental results confirm that WSCN ensures credibility of web service selection, our reputation model has better ability to organize services to make trustworthy service combination, moreover, the selection process can be effectively sped up by the collaboration relationship among web services.
4) To address the maintenance cost which large-scale of web service impose on, web service management platform based on cloud computing is proposed. This platform is consisted of four layers. The bottom layer is based on Hadoop Distributed File System, which functions as a foundation for supporting the upper layers. In information registration layer, HBase is assigned to manage the functional and non-functional properties extracted from web service advertisement. To accurately and quickly select the satisfied web service, the web service collaboration table and interface matching table are designed according to HBase. In addition, the ontology tree and QoS-Tree table are also designed for further enhancing the performance of functional and non-functional property retrieval. The core layer uses MapReduce technique, and the process of extraction, transformation, load and data mining algorithm based on MapReduce are proposed to satisfy the efficient web service management. To satisfy the user's complex web service selection, the searching optimal solution in all possible paths which depends on MapReduce is proposed. The results of the extensive experiment show that this framework is more suitable for large-scale web service management, and the proposed algorithm provides better performance.
随着Web服务技术的不断发展,各种各样的应用也随之出现。因此,服务质量(Quality of Service, QoS)逐渐成为Web服务中的一个关键技术点,而通过对QoS的评价可判断Web服务的可信性。在目前的研究中,基于QoS的可信Web服务评价多集中在可信度量、QoS管理等方面。虽取得了一定的成果,但在某些问题上仍然缺乏深入的研究。基于Web服务的研究趋势和对Web服务进行可信评价问题的研究现状,本文从以下几个角度对基于QoS的可信Web服务问题进行了深入的研究,取得了以下研究成果：
1)针对当前分布式QoS代理难于有效支持QoS的范围查询等问题,提出一种基于QoS的分布式Web服务索引框架。该框架由两层结构的分布式系统构成,其中第一层运用Chord网络对具有相同或类似功能的Web服务进行分类管理,第二层主要用于管理领域相关的Web服务的QoS。为构建用于分布式管理的QoS多维空间,将分类管理的QoS进行归一化,并引入了基于KD-Tree的多维数据管理方式。KD-Tree实现了QoS的范围查询,通过范围查询的方式,可筛选掉大量不满足非功能需求的Web服务。为保证分布式系统的查询效率,提出了基于QoS-Tree的管理方式。QoS-Tree是通过占优关系而构建的,其不仅实现了KD-Tree中涉及到的范围查询功能,而且通过QoS-Tree中占优关系可以较容易的找到满足用户需求的QoS。另外,为避免分布式QoS-Tree中查询负载不均衡,一种负载均衡机制被引入到系统中。实验表明所提出的两种分布式树型结构均能有效支持QoS的范围查询,且QoS-Tree的查询效率要优寸KD-Tree。
2)针对开放环境对Web服务中某些QoS指标造成的影响,提出了基于区间型QoS和概率区间型QoS的度量方式以及相应的服务选择算法。区间型QoS的度量方式是通过比较QoS区间上的概率密度来获取QoS中某些指标受动态环境影响的程度。这种方式正确性虽高,但其比较方式只适合于单个或少量的服务选择。概率区间型QoS的度量方式主要是通过计算QoS概率密度区间的置信上、下界与其均值的偏差来描述动态环境对Web服务的影响,因此,最优组合服务的选择可采用均值的加权和最大以及偏差最小来度量。将该度量方式转化为单目标组合优化问题,提出了一种基于社团划分的改进遗传算法。算法通过社团划分方式维护种群的多样性,并通过优良模式的叠加以提高种群收敛速度。仿真实验表明两种度量方法均能有效克服动态环境对服务选择的影响,且基于区间型QoS的度量方式在正确率方面要比基于概率区间型QoS略高。但概率密度的度量方式更适合于采用遗传算法进行全局寻优。实验表明,改进遗传算法提高了服务选择的效率。
3)为提高Web服务选择过程中服务之间的合作可信,提出了一种Web服务合作声誉模型。为描述这种合作信誉,构建了Web服务合作网(Web Service Collaboration Network, WSCN)。在合作网中,邻居更新机制能淘汰虚假服务,保证候选服务的可信性。根据合作网结构,任何Web服务都包含两种关系,调用关系和合作关系。因此,Web服务合作声誉可通过这两种关系进行度量。该声誉模型包括两类指标,调用声誉是通过在WSCN的社区结构中选择适当推荐者而计算得到；被调用声誉指标是通过Web服务之间的调用频率来评价。基于WSCN,提出一种Web可信服务选择算法。实验表明WSCN保证了服务选择的可信性,声誉模型能有效的组织Web服务之间最可信的服务进行组合,同时合作关系能有效地加速服务选择的过程。
4)为解决海量Web服务带来的服务信息维护开销,提出一种基于云计算的Web服务管理平台。该平台分为四层,最底层由Hadoop分布式文件系统构成,用于支撑整个云环境。HBase支撑Web服务信息注册层,主要用于管理从Web服务中获取的功能和非功能属性。此外,为进一步提高Web服务选择效率,HBase表中还负责维护了Web服务之间的合作关系以及本体树和QoS-Tree。平台中的核心层使用的是MapReduce技术,该层主要是为满足Web服务信息的有效存储,提出了基于MapReduce的QoS数据提取、转换、加载操作和数据挖掘算法。在复杂的Web服务选择方面,通过MapReduce并行搜索所有可能的路径,并获取其中的最优解决方案。实验结果表明所提出的框架更适合海量Web服务的管理。
With network technology's development, many researchers have done lots of job in web service field. In many research areas of web service, the trustworthiness becomes the significant research subject. Due to the open, distributed, uncertain and uncontrollable network environment which web service deploys, providing accurate, secure and effective service for customers becomes especially important. Thus, the research on high-trustworthy web service is a prospective, basic and strategic task, it plays a significant role in the software development.
With web service technology's development, various applications based on it have emerged. The QoS research increasingly becomes a critical problem, and the trustworthiness of web service can be assessed by QoS. In recent years, the approaches to evaluate web service's trust based on QoS concentrate in trust evaluation, QoS management, and so on. However, some areas have not been well researched or even considered. Based on current web service research and status of trust evaluation based on QoS, we address some critical problems on trustworthy web service based on QoS.
The contribution of this dissertation includes:
1) To solve the problem that distributed QoS broker cannot support range query, a distributed web service index framework based on QoS is proposed. The framework consists of two kinds of structured distributed system, one is chord overlay network which is assigned to classify the web services according to the similarity of the functional properties, the other manages QoS of domain-related web service. To construct a multi-dimension QoS space, the classified QoS is normalized, and the distributed tree structure KD-Tree is introduced. In KD-Tree, the range query method is realized, by using this method, all satisfied QoS can be obtained. To improve the query effectiveness, another distributed tree structure QoS-Tree is proposed, and the range query method is also supported by QoS-Tree. Due to the dominated relationship in QoS-Tree, the query efficiency can be guaranteed. Additionally, to avoid the imbalance of query load in the distributed system, a load balance strategy is introduced which can balance workload efficiently. Experimental results validate the effectiveness of the proposed distributed tree structure approaches for complex query, and query cost of QoS-Tree is better than that of KD-Tree.
2) To solve the effect which open environment imposes on some QoS, a web service selection algorithm based on interval and probability interval QoS are proposed. The interval QoS measurement can effectively assess the uncertainty by comparing the probability density in QoS interval. Although the accuracy can be guaranteed, this method can only apply for a few web services to be combined. The effect described by probability interval can be evaluated by using the difference between the mean of probability density and the upper, lower bounds of probability density. Thus, the composite web service with probability interval QoS global optimization can be evaluated with the maximum weighted sum of mean and the minimum difference, and this measurement is transformed into combinatorial optimization, and a genetic algorithm is developed based on the community detection. The population diversity can be maintained by the multi-community structure, and excellent schema combination accelerates the population's convergence. The experimental results show that these two methods contribute to reduce the influence of dynamic environment. The accuracy measured by interval QoS is slightly higher than that of probability interval QoS, however, the genetic algorithm can apply to service selection based on probability interval to search for global optimum. The experiment of the improved GA shows that the selection efficiency based on probability interval QoS is enhanced.
3) To improve the collaboration trust between web services during selection process, a novel reputation model called collaboration reputation is proposed. To describe this reputation model, a web service collaboration network is constructed. In WSCN, the false web service is eliminated by using the neighbor update mechanism, and the credibility of web service selection can be guaranteed. According to the collaboration network, any web service has two types of relationship, invoking and invoked relationship. Therefore, the collaboration reputation can be assessed by these relationships. It includes two metrics; one called invoking reputation is computed by the proper recommender, which is selected in WSCN's community, the other is assessed by the invoked web service. In addition, the web service selection based on WSCN is designed. With the collaboration reputation guaranteed, the selection efficiency and the solution's credibility are both increased. Experimental results confirm that WSCN ensures credibility of web service selection, our reputation model has better ability to organize services to make trustworthy service combination, moreover, the selection process can be effectively sped up by the collaboration relationship among web services.
4) To address the maintenance cost which large-scale of web service impose on, web service management platform based on cloud computing is proposed. This platform is consisted of four layers. The bottom layer is based on Hadoop Distributed File System, which functions as a foundation for supporting the upper layers. In information registration layer, HBase is assigned to manage the functional and non-functional properties extracted from web service advertisement. To accurately and quickly select the satisfied web service, the web service collaboration table and interface matching table are designed according to HBase. In addition, the ontology tree and QoS-Tree table are also designed for further enhancing the performance of functional and non-functional property retrieval. The core layer uses MapReduce technique, and the process of extraction, transformation, load and data mining algorithm based on MapReduce are proposed to satisfy the efficient web service management. To satisfy the user's complex web service selection, the searching optimal solution in all possible paths which depends on MapReduce is proposed. The results of the extensive experiment show that this framework is more suitable for large-scale web service management, and the proposed algorithm provides better performance.
引文
[1]UDDI Version 3.0. http://uddi.org/pubs/uddi-v3.00-published-20020719.htm.
[2]Web Services Description Language (WSDL). http://www.w3.org/TR/wsdl.
[3]OWL-S:Semantic Markup for Web Services. http://www.daml.org/services/owl-s/1.2/overview/
[4]Volker, Haarslev R M. Description of the Racer System and Its Applications. In Proceedings of International Workshop on Description Logics,2001, pp.1-3.
[5]Drew McDermott, Dejing D. Representing Disjunction and Quantifiers in RDF. In Proceedings of International Semantic Web Conference,2002, pp.250-263.
[6]Ludwig H. Web Services QoS:External SLAs and Internalpolicies or:How Do We Deliver What We Promise?. In Proc. of the International 1st Conference on Web Information Systems Engineering Workshops.2004. pp.115-120.
[7]Ran S. A Framework for Discovering Web Services with Desired Quality of Services Attributes. In Proc. of the Int'l Conf. on Web Services,2003, pp. 208-213.
[8]Dobson G, Lock R, Sommerville I. QoSOnt:a QoS Ontology for Service-Centric Systems.31st Euromicro Conference on Software Engineering and Advanced Applications,2005, pp.80-87.
[9]Kritikos K, Plexousakis D. Semantic QoS Metric Matching.4th European Conference on Web Services,2006, pp.265-274.
[10]Tondello G F, Siqueira F.The QoS-MO. Ontology for Semantic QoS Modeling. In Proc. of the. ACM Symposium on Applied Computing,2008, pp.2336-2340.
[11]Paolucci M, Kawamura T, Payne T R, et al. Semantic Matching of Web Services Capabilities. In:Proc. of International Semantic Web Conference,2002, pp.333-347.
[12]Li L, Horrocks I. A Software Framework for Matchmaking based on Semantic Web Technology. In:Proceedings of the 12th International Conference on World Wide Web,2003, pp.331-339.
[13]Skoutas D, Simitsis A, Sellis T K. A Ranking Mechanism for Semantic Web Service Discovery. In:IEEE International Conference on Services Computing Workshops,2007,pp.41-48.
[14]Klusch M, Fries B, Sycara K P. Automated Semantic Web Service Discovery with OWLS-MX. In:the 6th International Conference on Autonomous Agents and Multiagent Systems,2006, pp.915-922.
[15]Kaufer F, Klusch M. WSMO-MX:A Logic Programming Based Hybrid Service Matchmaker. In:the 4th IEEE European Conference on Web Services,2006, pp.161-170.
[16]张莹,黄厚宽,杨冬,等.基于Chord的带有QoS的语义Web服务发现方法研究.电子与信息学报,2009,31(3)：711-715.
[17]Stoica I, Morris R, Karger D, et al. Chord:A Scalable Peer-to-Peer Lookup Service for Internet Applications. In:ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication,2001, pp.149-160.
[18]Emekci F, Sahin O D, Agrawal D,et al. A Peer-to-Peer Framework for Web Service Discovery with Ranking. In:IEEE International Conference on Web Services,2004, pp.192-199.
[19]Ratnasamy S, Francis P, Handley M, et al. A Scalable Content-Addressable Network. In:Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication,2001,pp.161-172.
[20]Rowstron A I T, Druschel P. Pastry:Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In:IFIP/ACM International Conference on Distributed Systems Platforms,2001, pp.329-350.
[21]Ran S P. A model for Web Service Discovery with QoS. ACM SIGCOM Exchanges,2003,4(1):1-10.
[22]Chen H G, Yu T, Lin K J. QCWS:An Implement of QoS-capable Multimedia Web Service. Proceedings of the 5th International Symposium on Multimedia Software Engineering,2003,pp.38-45.
[23]Pathak J, Koul N, Caragea D, Honavar V. A Framework for Semantic Web Services Discovery.7th ACM International Workshop on Web Information and Data Management,2005, pp.45-50.
[24]Majithia S, Walker D W, Gray W A. A Framework for Automated Service Composition in Service-Oriented Architectures. In:Proc. of the European Semantic Web Symp.,2004, pp.269 283.
[25]Taylor I, Shields M, Wang I, et al. R:Distributed P2P Computing within Triana: A Galaxy Visualization Test Case. Proc. of International Parallel and Distributed Processing Symposium,2003, pp.16-27.
[26]IBM Alphaworks, BPWS4J, http://www.alphaworks.ibm.com/tech/bpws4j
[27]Mandell D J, Mcilraith S A. A Bottom-Up Approach to Automating Web Service Discovery, Customization, and Semantic Translation. In Proc. of 20th International World Wide Web Conference Workshop on E-Service and the Semantic Web,2003, pp.89-96.
[28]Chen L, Shadbolt N R, Goble C, Et al. Towards a Knowledge-based Approach to Semantic Service Composition. In Proc of 2nd International Semantic Web Conference,2003, pp.319-334.
[29]Cardoso J, Sheth A. Semantic e-Workflow Composition. Journal of Intelligent Information System,2003,12(3):121-135.
[30]Sirin E, Hendler J, Parsia B. Semi-Automatic Composition of Web Services Using Semantic Descriptions. In:Web Services:Modeling, Architecture and Infrastructure Workshop in Conjunction with ICEIS,2003, pp.17-24.
[31]Mcilraith S. Son T C. Adapting Golog for Composition of Semantic Web Services. In Proc. of the 8th International Conference on Knowledge Representation and Reasoning,2002, pp.482-493.
[32]Ponnekanti S R, Fox A. SWORD:A Developer Toolkit for Web Service Composition. In Proc. Of the 11th International World Wide Web Conference, 2002,786-810.
[33]Zeng L Z, Benatallah B, Dumas M, et al. Quality Driven Web Services Composition. Proceedings of the 12th International Conference on World Wide Web,2003, pp.411-421.
[34]Ardagna D, Pernici B. Adaptive Service Composition in Flexible Processes. IEEE Trans. Software Eng,2007:33(6),369-384.
[35]Canfora G, Penta M D, Esposito R, et al. A Lightweight Approach for QoS-aware Service Composition. Proceedings of the 2nd International Conference on Service oriented Computing,2004, pp.36-47.
[36]Canfora G, Dipenta M, Esposito R. An Approach for Qos-Aware Service Compositionbased on Genetic Algorithms.In Proc.of the 2005 Conference on Genetic and Evolutionary Computation.Washington,2005,1069-1075.
[37]张成文,苏森,陈俊亮,基于遗传算法的QoS感知的Web服务选择.计算机学报,2006,29(7)：1029-1037.
[38]Hu C H, Chen X H, Liang X M. Dynamic Services Selection Algorithm in Web Services Composition Supporting Cross-Enter-Prises Collaboration. Journal of Central South University of Technology,2009,16(2):269-274.
[39]王文彬,孙其博,赵新超,等.基于非均衡变异离散粒子群算法的QoS全局最优Web服务选择方法.电子学报,2010,38(12)：2774-2779.
[40]胡建强,李涓子,廖桂平.一种基于多维服务质量的局部最优服务选择模型.计算机学报.
[41]Lamparter S, Ankolekar A, Studer R, et al. Preference Based Selection of Highly Configurable Web Services. Proceedings of the 16th International World Wide Web Conference,2007, pp.1013-1022.
[42]苏森,李飞,杨放春.分布式环境中服务聚合的迭代选择算法.中国科学E：信息科学,2008,38(10)：1717-1732.
[43]Tavares R K, Wesphall C B. An Architeeture to Provide QoS in Web Service. Proc. of IEEE International Conferenece on Communications,2006, pp. 921-925.
[44]Menasee D A. QoS Issue in Web Service. Intemet Computing,6(6):72-75.
[45]Avizienis A, Laprie JC, Randell B, et al. Basic Concepts and Taxonomy of Dependable and Secure Computing. IEEE Trans.on Dependable and Secure Computing,2004,1(1):11 (?)33.
[46]Bai X Y, Dong W, Tsai W T, et al. WSDL-Based Automatic Test Case Generation for Web Services Testing. Proc. of the 2005 IEEE International Workshop on Service-Oriented System Engineering,2005, pp.215-220.
[47]Li Zhongjie, Zhu Jun, Zhang Liangjie. Towards a Practical and Effective Method for Web Services Test Case Generation. Automation of Software TestAST'09 ICSEWorkshop,2009, pp.106-114.
[48]Wang Y B, Bai X Y, Li J Z, et al. Ontology-Based Test Case Generation for TestingWeb Services. Proc. of the 8th International Symposium on Autonomous Decentralized Systems,2007, pp.43-50.
[49]姜瑛,辛国茂,单锦辉.一种Web服务的测试数据自动生成方法.计算机学报,2005,28(4)：568-577.
[50]Lee S F, Bai X Y, Chen Y N. Automatic Mutation Testing and Simulation on OWL-S SpecifiedWeb Service.41st Annual Simulation Symposium,2008, pp.149-156.
[51]Offutt J, Xu W. Generating Test Cases for Web Services Using Data Perturbation. ACM SIGSOFT Software Engineering Notes,2004,5(29):1-10.
[52]Dai Guilan, Bai Xiaoying, Zhao Chongchong. A Framework for Model Checking Web Service Compositions Based on BPEL4WS. e-Business Engineering,2007, pp.165-172.
[53]Liu C H, Chen S L, Li X Y. A WS-BPEL Based Structural Testing Approach for Web Service Compositions. Proc. of IEEE International Symposium on Service-Oriented System Engineering,2008, pp.135-141.
[54]Sirer E G, K Wang. An Access Control Language for Web Services. In Proceedings of the 7th ACM symposium on Access Control Models and Technologies.2002, pp.179-183.
[55]Mudhakar S, Arun I, Thomas M, et al. An Access Control System for Web Service Compositions, in Proc. International Conference on Web Service.2007, pp.1-8.
[56]Specification, O.S. Web services security:SOAP message security 1.1.2006; http://www.oasis-open.org/committees/download.php/16790/wss-v1.1-spec0os-SOA PMessageSecurity.pdf.
[57]Biswas D, Compensation in the World of Web Services Composition. in 1st International Workshop of Semantic Web Services and Web Process Composition.2005. pp.69-80.
[58]岳昆,王晓玲,周傲英.Web服务核心支撑技术研究综述.软件学报,2004.15(3)：pp.428-442.
[59]石静,丁长明,赵泽宇.Web服务合成研究综述.计算机科学,2004.31(6)：pp.54-58.
[60]Yanfeng, S., M. Xiujun, X. Kunqing et al. A Compensation Mechanism in GIS Web Service Composition. Proceedings of the Geoscience and Remote Sensing Symposium.2005, pp.4-4.
[61]Yu, T. and K.-J. Lin. A Broker-Based Framework for QoS-Aware Web Service Composition. Proc. of the Intl. Conf. on e-Technology, e-Commence and e-Service,2005, pp.231-235.
[62]Martin-Diaz, O., Ruiz-Cortes, A., Corchuelo, R., et al. A Framework for Classifying and Comparing Web Services Procurement Platforms. Proc.of 1st Int'l Web Services Quality Workshop,2003, pp.37-46.
[63]Ran S. A Model for Web Services Discovery with QoS. ACM SIGEcom Exchanges,2004,4(1):1-10.
[64]Youngkon L. QoS Management for SOA by Synchronizing Quality Context in UDDI. International Conference on Future Generation Communication and Networking Symposia,2008, pp.17-22.
[65]Beatriz F T.A Web Service Architecture Providing QoS Management. Web Congress, LA-Web.2006, pp.189-198.
[66]Serhani M, Rachida D, Abdelhakim H. et al. A Qos Broker Based Architecture for Efficient Web Services Selection. Proceedings of the IEEE International Conference on Web Services,2005, pp.113-120.
[67]Sravanthi K, Shonali K, Seng W L. Reputation= f(User Ranking, Compliance, Verity). IEEE International Conference on Web Services,2004, pp.200-207
[68]Demian A D Ananthanarayana V S. A QoS Model and Selection Mechanism for QoS-Aware Web Services. Proceedings of the International Conference on Data Management,2008,pp.138-145.
[69]Ali S., Rana O F, Al-Ali R. UDDIe:An Extended Registry for Web Services, in Proceedings of SAINT Workshops,2003, pp.85-89.
[70]Kunal V., Kaarthik S., Amit S. METEOR-S WSDI:A Scalable P2P Infrastructure of Registries for Semantic Publication and Discovery of Web services. Information Technology and Management,2005.6:(1), pp.18-31.
[71]Li F, Yang F C, and Shuang K, et al. Q-Peer:A Decentralized QoS Registry Architecture for Web Services. Proceedings of International Conference on Service-Oriented Computing,2007, pp.145-156.
[72]Gibelin N, Makpangou M. Efficient and Transparent Web-Services Selection. In: Proceedings of the 3th International Conference on Service Oriented Computing, 2005,pp.527-532.
[73]郭得科,任彦,陈洪辉,等.一种QoS有保障的Web服务分布式发现模型.软件学报,2006,17(11)：2324-2334.
[74]Lehung Vu, Manfred H, Karl A. Towards P2P-based Semantic Web Service Discovery with QoS. Proceeding of Workshop on Business Processes and Services,2006, pp.18-31.
[75]Wan Cheng, Wang Hongbing. Web Service Decision-Making Model Based on Uncertain-but-Bounded Attributes. In:4th SCC Workshop on Semantic Web for Web Service and Processes,2007, pp.81-86.
[76]Fu Xiaodong, Zou Ping, SHANG Zhenhong, et al. Web Service Selection with Uncertain QoS Information. In:Proc. of the 27th Chinese Control Conference, 2008, pp.271-275.
[77]Wan Cheng, Wang Hongbing. Uncertainty-aware QoS Description and Selection Model for Web Services. In:International Conference on Services Computing, 2007, pp.154-161.
[78]李祯,杨放春,苏森,基于模糊多属性决策理论的语义Web服务组合算法.软件学报,2009.20(3)：pp.583-596.
[79]Wang Ping. QoS-aware Web Services Selection With Intuitionistic Fuzzy Set under Consumer's Vague Perception. Expert Systems with Applications,2009, 36(3):4460-4466.
[80]Wang X, Vitvar T, Kerrigan M, et al. Synthetical Evaluation of Multiple Qualities for Service Selection. In:Proc. of 4th International Conference on Service Oriented Computing 2006:152 162.
[81]杨放春,苏森,李祯,混合QoS模型感知的语义Web服务组合策略,中国科学F辑：信息科学.2008.38(10)：1697-1716.
[82]Blaze M, Feigenbaum J, Lacy J. Decentralized Trust Management. Proc. of the 7th Symposium on Security and Privacy,1996, pp.164-173.
[83]Buskens, V. Social Networks and The Effect of Reputation on Cooperation. Proc. of 6th International Conference on Social Dilemmas, pp.1-18.
[84]Wu Guoquan, Wei Jun, Qiao Xiaoqiang, et al. A Bayesian Network Based Qos Assessment Model for Web Services. In:Proc. of International Conference on Service Computing,2007, pp.498-505.
[85]吴国全,魏峻,黄涛.基于非确定性推理的网构软件服务质量动态评估方法研究.软件学报,2008,19(5)：1173-1185.
[86]胡志刚,付毅,肖鹏,等.基于贝叶斯网络的网格QoS可信度评估方法.计算机工程,2009,35(07)：32-35.
[87]Hang Chungwei, Singh M P. Selecting Trustworthy Service in Service-Oriented Enviroments. The 12th AAMAS Workshop on Trust in Agent Societies,2009, pp.213-220.
[88]Manchala D W. Trust Metrics, Models and Protocols For Electronic Commerce Transactions. International Conference on Distributed Computing Systems,1998, pp.312-321.
[89]Surya N, Wanita S, Jonathon H, et al. A Fuzzy Trust Management Framework for Service Web. IEEE International Conference on Web Services,2010, pp.321-328.
[90]Surya N, Zaki M, Athman B. Reputation Propagation in Composite Services. In: Proc. of 7th International Conference on Web Services,2009, pp.295-302.
[91]胡春华,吴敏,刘国平.Web服务工作流中基于信任关系的QoS调度.计算机学报,2009,32(1)：42-53.
[92]潘静,徐锋,吕建.一个面向可信服务选取的基于声誉的推荐者发现方法.软件学报,2010.21(2)：pp.388-400.
[93]刘济波,朱培栋,胡春华.基于两层声誉演化模型的服务组合选取策略.中南大学学报(自然科学版),2009.40(3)：pp.157-161.
[94]Baresi L, Ghezzi C, Guinea S. Smart Monitors for Composed Services. Proceedings of 2nd International Conference on Service-Oriented Computing, 2004,15-19, pp.193-202.
[95]Microsoft Baseline Security Analyzer. [online] http:// www.microsoft.com/technet/security/tools/mbsahome.mspx.
[96]Wang Y, Vassileva J. A Review on Trust and Reputation for Web Service Selection. Proceedings of the 27th International Conference on Distributed Computing Systems Workshops.2007,pp.25-32.
[97]Vu Lehung, Manfred Hauswirth, Karl A. QoS-based Service Selection and Ranking with Trust and Reputation Management. Proceedings of OnTheMove Federated Conference.2005, pp.466-483.
[98]Stephen S, Yau Jinghuang, Yin Yin. Improving the Trustworthiness of Service QoS Information in Service-Based Systems. Proceedings of 7th Autonomic and Trusted Computing (ATC),2010, pp.208-218.
[99]Kalepu S, Krishnaswamy S, Loke S W. Verity:A QoS Metric for Selecting Web Services And Providers. In:Proc. of the 4th International Conference on Web Information Systems Engineering Workshop,2003, pp.131-139.
[100]Manikrao U S, Prabhakar T V. Dynamic Selection of Web Services with Recommonendation System. In:Proc. of International Conference on Next Generation Web Services Practices.2005, pp.22-26.
[101]Jurca R, Faltings B, Binder W. Reliable QoS Monitoring Based on Client Feedback. Proceedings of 16th International Conference on World Wide Web, 2007, pp.1003-1012.
[102]王怀民,史佩昌,丁博.软件服务的在线演化.计算机学报,2011.34(2)：pp.318-328.
[103]Papazoglou M P, The Challenges of Service Evolution. In Proc. of the 20th International Conference on Advanced Information Systems Engineering.2008, pp.1-15.
[104]曾晋,孙海龙,刘旭东,基于服务组合的可信软件动态演化机制.软件学报,2010.21(2)：p.261-276.
[105]汪小帆,李翔,陈关荣,复杂网络理论及其应用.2006,北京：清华大学出版社.
[106]何克清,马于涛,刘婧,软件网络.2008,北京：科学出版社.
[107]Watts D J, Strogatz S H. Collective Dynamics of'Small-World'Networks. Nature.1998,393:pp.440-442.
[108]Barabasi, Reka A. Emergence of Scaling in Random Networks. Science.1999. 286:p.509-512.
[109]Elnaffar S, Maamar Z, Yahyaoui H, et al. Reputation of Communities of Web Services Preliminary Investigation. Proc. of the 22'nd IEEE Int. Conf. on Advanced. Inf. Networking and App,2008, pp.1603-1608.
[110]Khosravifar B, Bentahar J, Thiran P, et al. An Approach to Incentive-based. Reputation for Communities of Web Services. Proc. of the 7th International Conference on Web Services,2009.pp.145-151.
[111]Kil Hyunyoung. Graph Theoretic Topological Analysis of Web Service Networks. Jour, of World Wide Web,2009:12(3), pp.321-343.
[112]Zhang Xizhe, Yin Ying, Zhang Mingwei et al. A Composite Web Services Discovery Technique Based on Community Mining. Proc. of the 4th Asia-Pacific Services Computing Conference,2009, pp.445-450.
[113]Ji Guang, Zhang Jie, Zhao Zhuofeng Et Al. Service Collaboration Network:A Novel Mechanism for Web Service Management. Proc. of the 12th Asia-Pacific Web Conference 2010, pp.85-91.
[114]Aversano L, Canfora G, Ciampi A. An algorithm for Web service discovery through their composition. In:Proc. of the IEEE Int'l Conf. on Web Services, 2004, pp.332-341.
[115]Constantinescu I, Binder W, Faltings B. Flexible and Efficient Matchmaking and Ranking in Service Directories. In:IEEE International Conference on Web Service,2005, pp.5-12.
[116]邝砾,邓水光,李莹,等.使用倒排索引优化面向组合的语义服务发现.软件学报,2007,18(8)：pp.191 1-1921.
[117]Tang C, Xu Z, Dwarkadas S. Peer-to-peer Information Retrieval using Self-organizing Semantic Overlay Networks. In Proceedings of pecial Interest Group on Data Communication,2003, pp.175-186.
[118]Hashemian S V, Mavaddat F. A Graph-Based Approach to Web Services Composition. In Proceedings of SAINT.2005, pp.183-189.
[119]Zhou A, Huang S, Wang X. BITS:A Binary Tree Based Web Service Composition System. Int. Journal of Web Services Research,2007.4(3):pp. 205-225.
[120]Tang H, Zhong F, Yang C. A Tree-Based Method of Web Service Composition. Proc. of the Int. Conf. on Web Services,2008, pp.768-770.
[121]Shiaa M M, Fladmark J O, THIELL B. An Incremental Graph-based Approach to Automatic Service Composition. Proc. of the Int. Conf. on Services Computing,2008, pp.148-165.
[122]Huang S, X Wang, A Zhou. Efficientsed On Syntactical Matching, in Proceedings of the 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service,2005, pp.
[123]Cheng Zeng, Xiao Guo, Weijie Ou, et al. Cloud Computing Service Composition and Search Based on Semantic. Proc. of 1 st Conference on Cloud computing,2009, pp.291-300.
[124]Srivastava U, Munagala K, Widom J, et al. Query Optimization over Web Services. In:Proc. of 32nd Very Large Data Bases,2006, pp.35-366.
[125]Kwon J, Park K, Lee D et al. PSR:Pre-computing Solutions in RDBMS for Fast Web Service Composition Search. Proc. of 5th International Conference on Web Service,2007, pp.808-815.
[126]Pathak J, Basu S, Lutz R, et al. Parallel Web Service Composition in MoSCoE: A Choreography-Based Approach. Proc. of the 4th European Conf. on Web Services,2006, pp.3-12.
[127]Hennig P, Balke W. Highly Scalable Web Service Composition using Binary Tree-based Parallelization, IEEE International Conference on Web Services, 2010, pp.123-130.
[128]刘志忠,王怀民,周斌.一种双层P2P结构的语义服务发现模型.软件学报,2007.18(8)：pp.1922-1932.
[129]Yahoo Available from:http://www.yahoo.com.
[130]DMOZ Available from:http://www.dmoz.org.
[131]Eyhab A M, Mahmoud Q H. Investigating Web Services on The World Wide Web. In:Proceeding of the 17th international conference on World Wide Web, 2008, pp.795-804.
[132]Prasanna G, Mayank B, Hector G M. Online Balancing of Range-Partitioned Data With Applications to Peer-to-Peer Systems. In:proc. of the 30th International Conference on Very Large Databases,2004, pp.444-455.
[133]王明文.基于概率区间的Bayes决策方法.系统工程理论与实践,1997.7(11)：pp.79-82.
[134]张尧庭,张能胜.专家系统中不确定性方法学.1994,广西师范大学出版社：南宁.
[135]Li R J, Lee E S. Ranking Fuzzy Numbers-A Comparison. In:Proc. North American Fuzzy Information Processing Society,1987, pp.169-204.
[136]刘书雷,刘云翔,张帆,一种服务聚合中QoS全局最优服务动态选择算法.软件学报,2007.18(3)：pp.646-656.
[137]Newman M E J, Girvan M. Finding and Evaluating Community Structure in Networks, Physical Review E,2004,69(22):1-15.
[138]郑金华,蔡自兴.自动区域划分的分区搜索狭义遗传算法.计算机研究与发展.37(4)：pp.397-400.
[139]Hemminger S. Network Emulation with NetEm. In:Proc. of Linux Conference, 2005.
[140]Eugster P, Guerraoui R, Handurukande S, Kermarrec AM, Kouznetsov P. Lightweight probabilistic broadcast. ACM Trans. On Computer Systems, 2003,21(4):341(?)374.
[141]Van Renesse R, Birman KP, Vogels W. Astrolabe:A Robust and Scalable Technology for Distributed System Monitoring, Management and Data Mining. ACM Trans, on Computer Systems,2003,21(2):164(?)206.
[142]Girvan M, Newman M E J, Community Structure in Social and Biological Networks. Proc. Natl. Acad. Sci.,2001,99:7821-7826.
[143]Newman M E J. Fast Algorithm for Detecting Community Structure in Network. Phy. Rev. E,2004.
[144]Clauset A, Newman M E J, Moore C, Finding Community Structure in Very Large Networks. Phys. Rev. E.,2004,70:066111.
[145]Seog-Chan Oh, Dongwon Lee. WSBen:A Web Services Discovery and Composition Benchmark Toolkit. International Journal of Web Services Research,2009.6(1):1-19.
[146]Ye Q, Wu B, Wang B. JSNVA:A Java Straight-line Drawing Framework for Network Visual Analysis.In:Proceedings of the 4th International Conference on Advanced Data Mining and Applications,2008, pp.667-674.
[147]Brin S, Page L. The Anatomy of A Largescale Hypertextual Web Search Engine. Computer Networks and ISDN Systems,1998,30(17):107-117.
[148]Seog-Chan Oh, Ju-Yeon Lee, Seon-Hwa Cheong, et al. WSPR*:Web-Service Planner Augmented with A* Algorithm. In:Proc. of 11th IEEE Conference on Commerce and Enterprise Computing,2009, pp.515-518.
[149]罗伊尔,数据挖掘基础教程.2009,北京：机械工业出版社.
[150]SAATY, T.L., The analytic hierarchy process.1980, New York:McGrawHill.
[151]Gao Z, W Gengfeng. Combining QoS-based Service Selection with Performance Prediction, in The 2nd IEEE International Conference on e-Business Engineering,2003, pp.611-614.
[152]Zhang J. A Short-Term Prediction for QoS of Web Service Based on Wavelet Neural Networks, in International Conference on Computational Intelligence and Communication Networks.2010, pp.254-258.
[153]西奥多里蒂斯,模式识别.2010,北京：电子工业出版社.
[2]Web Services Description Language (WSDL). http://www.w3.org/TR/wsdl.
[3]OWL-S:Semantic Markup for Web Services. http://www.daml.org/services/owl-s/1.2/overview/
[4]Volker, Haarslev R M. Description of the Racer System and Its Applications. In Proceedings of International Workshop on Description Logics,2001, pp.1-3.
[5]Drew McDermott, Dejing D. Representing Disjunction and Quantifiers in RDF. In Proceedings of International Semantic Web Conference,2002, pp.250-263.
[6]Ludwig H. Web Services QoS:External SLAs and Internalpolicies or:How Do We Deliver What We Promise?. In Proc. of the International 1st Conference on Web Information Systems Engineering Workshops.2004. pp.115-120.
[7]Ran S. A Framework for Discovering Web Services with Desired Quality of Services Attributes. In Proc. of the Int'l Conf. on Web Services,2003, pp. 208-213.
[8]Dobson G, Lock R, Sommerville I. QoSOnt:a QoS Ontology for Service-Centric Systems.31st Euromicro Conference on Software Engineering and Advanced Applications,2005, pp.80-87.
[9]Kritikos K, Plexousakis D. Semantic QoS Metric Matching.4th European Conference on Web Services,2006, pp.265-274.
[10]Tondello G F, Siqueira F.The QoS-MO. Ontology for Semantic QoS Modeling. In Proc. of the. ACM Symposium on Applied Computing,2008, pp.2336-2340.
[11]Paolucci M, Kawamura T, Payne T R, et al. Semantic Matching of Web Services Capabilities. In:Proc. of International Semantic Web Conference,2002, pp.333-347.
[12]Li L, Horrocks I. A Software Framework for Matchmaking based on Semantic Web Technology. In:Proceedings of the 12th International Conference on World Wide Web,2003, pp.331-339.
[13]Skoutas D, Simitsis A, Sellis T K. A Ranking Mechanism for Semantic Web Service Discovery. In:IEEE International Conference on Services Computing Workshops,2007,pp.41-48.
[14]Klusch M, Fries B, Sycara K P. Automated Semantic Web Service Discovery with OWLS-MX. In:the 6th International Conference on Autonomous Agents and Multiagent Systems,2006, pp.915-922.
[15]Kaufer F, Klusch M. WSMO-MX:A Logic Programming Based Hybrid Service Matchmaker. In:the 4th IEEE European Conference on Web Services,2006, pp.161-170.
[16]张莹,黄厚宽,杨冬,等.基于Chord的带有QoS的语义Web服务发现方法研究.电子与信息学报,2009,31(3)：711-715.
[17]Stoica I, Morris R, Karger D, et al. Chord:A Scalable Peer-to-Peer Lookup Service for Internet Applications. In:ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication,2001, pp.149-160.
[18]Emekci F, Sahin O D, Agrawal D,et al. A Peer-to-Peer Framework for Web Service Discovery with Ranking. In:IEEE International Conference on Web Services,2004, pp.192-199.
[19]Ratnasamy S, Francis P, Handley M, et al. A Scalable Content-Addressable Network. In:Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication,2001,pp.161-172.
[20]Rowstron A I T, Druschel P. Pastry:Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In:IFIP/ACM International Conference on Distributed Systems Platforms,2001, pp.329-350.
[21]Ran S P. A model for Web Service Discovery with QoS. ACM SIGCOM Exchanges,2003,4(1):1-10.
[22]Chen H G, Yu T, Lin K J. QCWS:An Implement of QoS-capable Multimedia Web Service. Proceedings of the 5th International Symposium on Multimedia Software Engineering,2003,pp.38-45.
[23]Pathak J, Koul N, Caragea D, Honavar V. A Framework for Semantic Web Services Discovery.7th ACM International Workshop on Web Information and Data Management,2005, pp.45-50.
[24]Majithia S, Walker D W, Gray W A. A Framework for Automated Service Composition in Service-Oriented Architectures. In:Proc. of the European Semantic Web Symp.,2004, pp.269 283.
[25]Taylor I, Shields M, Wang I, et al. R:Distributed P2P Computing within Triana: A Galaxy Visualization Test Case. Proc. of International Parallel and Distributed Processing Symposium,2003, pp.16-27.
[26]IBM Alphaworks, BPWS4J, http://www.alphaworks.ibm.com/tech/bpws4j
[27]Mandell D J, Mcilraith S A. A Bottom-Up Approach to Automating Web Service Discovery, Customization, and Semantic Translation. In Proc. of 20th International World Wide Web Conference Workshop on E-Service and the Semantic Web,2003, pp.89-96.
[28]Chen L, Shadbolt N R, Goble C, Et al. Towards a Knowledge-based Approach to Semantic Service Composition. In Proc of 2nd International Semantic Web Conference,2003, pp.319-334.
[29]Cardoso J, Sheth A. Semantic e-Workflow Composition. Journal of Intelligent Information System,2003,12(3):121-135.
[30]Sirin E, Hendler J, Parsia B. Semi-Automatic Composition of Web Services Using Semantic Descriptions. In:Web Services:Modeling, Architecture and Infrastructure Workshop in Conjunction with ICEIS,2003, pp.17-24.
[31]Mcilraith S. Son T C. Adapting Golog for Composition of Semantic Web Services. In Proc. of the 8th International Conference on Knowledge Representation and Reasoning,2002, pp.482-493.
[32]Ponnekanti S R, Fox A. SWORD:A Developer Toolkit for Web Service Composition. In Proc. Of the 11th International World Wide Web Conference, 2002,786-810.
[33]Zeng L Z, Benatallah B, Dumas M, et al. Quality Driven Web Services Composition. Proceedings of the 12th International Conference on World Wide Web,2003, pp.411-421.
[34]Ardagna D, Pernici B. Adaptive Service Composition in Flexible Processes. IEEE Trans. Software Eng,2007:33(6),369-384.
[35]Canfora G, Penta M D, Esposito R, et al. A Lightweight Approach for QoS-aware Service Composition. Proceedings of the 2nd International Conference on Service oriented Computing,2004, pp.36-47.
[36]Canfora G, Dipenta M, Esposito R. An Approach for Qos-Aware Service Compositionbased on Genetic Algorithms.In Proc.of the 2005 Conference on Genetic and Evolutionary Computation.Washington,2005,1069-1075.
[37]张成文,苏森,陈俊亮,基于遗传算法的QoS感知的Web服务选择.计算机学报,2006,29(7)：1029-1037.
[38]Hu C H, Chen X H, Liang X M. Dynamic Services Selection Algorithm in Web Services Composition Supporting Cross-Enter-Prises Collaboration. Journal of Central South University of Technology,2009,16(2):269-274.
[39]王文彬,孙其博,赵新超,等.基于非均衡变异离散粒子群算法的QoS全局最优Web服务选择方法.电子学报,2010,38(12)：2774-2779.
[40]胡建强,李涓子,廖桂平.一种基于多维服务质量的局部最优服务选择模型.计算机学报.
[41]Lamparter S, Ankolekar A, Studer R, et al. Preference Based Selection of Highly Configurable Web Services. Proceedings of the 16th International World Wide Web Conference,2007, pp.1013-1022.
[42]苏森,李飞,杨放春.分布式环境中服务聚合的迭代选择算法.中国科学E：信息科学,2008,38(10)：1717-1732.
[43]Tavares R K, Wesphall C B. An Architeeture to Provide QoS in Web Service. Proc. of IEEE International Conferenece on Communications,2006, pp. 921-925.
[44]Menasee D A. QoS Issue in Web Service. Intemet Computing,6(6):72-75.
[45]Avizienis A, Laprie JC, Randell B, et al. Basic Concepts and Taxonomy of Dependable and Secure Computing. IEEE Trans.on Dependable and Secure Computing,2004,1(1):11 (?)33.
[46]Bai X Y, Dong W, Tsai W T, et al. WSDL-Based Automatic Test Case Generation for Web Services Testing. Proc. of the 2005 IEEE International Workshop on Service-Oriented System Engineering,2005, pp.215-220.
[47]Li Zhongjie, Zhu Jun, Zhang Liangjie. Towards a Practical and Effective Method for Web Services Test Case Generation. Automation of Software TestAST'09 ICSEWorkshop,2009, pp.106-114.
[48]Wang Y B, Bai X Y, Li J Z, et al. Ontology-Based Test Case Generation for TestingWeb Services. Proc. of the 8th International Symposium on Autonomous Decentralized Systems,2007, pp.43-50.
[49]姜瑛,辛国茂,单锦辉.一种Web服务的测试数据自动生成方法.计算机学报,2005,28(4)：568-577.
[50]Lee S F, Bai X Y, Chen Y N. Automatic Mutation Testing and Simulation on OWL-S SpecifiedWeb Service.41st Annual Simulation Symposium,2008, pp.149-156.
[51]Offutt J, Xu W. Generating Test Cases for Web Services Using Data Perturbation. ACM SIGSOFT Software Engineering Notes,2004,5(29):1-10.
[52]Dai Guilan, Bai Xiaoying, Zhao Chongchong. A Framework for Model Checking Web Service Compositions Based on BPEL4WS. e-Business Engineering,2007, pp.165-172.
[53]Liu C H, Chen S L, Li X Y. A WS-BPEL Based Structural Testing Approach for Web Service Compositions. Proc. of IEEE International Symposium on Service-Oriented System Engineering,2008, pp.135-141.
[54]Sirer E G, K Wang. An Access Control Language for Web Services. In Proceedings of the 7th ACM symposium on Access Control Models and Technologies.2002, pp.179-183.
[55]Mudhakar S, Arun I, Thomas M, et al. An Access Control System for Web Service Compositions, in Proc. International Conference on Web Service.2007, pp.1-8.
[56]Specification, O.S. Web services security:SOAP message security 1.1.2006; http://www.oasis-open.org/committees/download.php/16790/wss-v1.1-spec0os-SOA PMessageSecurity.pdf.
[57]Biswas D, Compensation in the World of Web Services Composition. in 1st International Workshop of Semantic Web Services and Web Process Composition.2005. pp.69-80.
[58]岳昆,王晓玲,周傲英.Web服务核心支撑技术研究综述.软件学报,2004.15(3)：pp.428-442.
[59]石静,丁长明,赵泽宇.Web服务合成研究综述.计算机科学,2004.31(6)：pp.54-58.
[60]Yanfeng, S., M. Xiujun, X. Kunqing et al. A Compensation Mechanism in GIS Web Service Composition. Proceedings of the Geoscience and Remote Sensing Symposium.2005, pp.4-4.
[61]Yu, T. and K.-J. Lin. A Broker-Based Framework for QoS-Aware Web Service Composition. Proc. of the Intl. Conf. on e-Technology, e-Commence and e-Service,2005, pp.231-235.
[62]Martin-Diaz, O., Ruiz-Cortes, A., Corchuelo, R., et al. A Framework for Classifying and Comparing Web Services Procurement Platforms. Proc.of 1st Int'l Web Services Quality Workshop,2003, pp.37-46.
[63]Ran S. A Model for Web Services Discovery with QoS. ACM SIGEcom Exchanges,2004,4(1):1-10.
[64]Youngkon L. QoS Management for SOA by Synchronizing Quality Context in UDDI. International Conference on Future Generation Communication and Networking Symposia,2008, pp.17-22.
[65]Beatriz F T.A Web Service Architecture Providing QoS Management. Web Congress, LA-Web.2006, pp.189-198.
[66]Serhani M, Rachida D, Abdelhakim H. et al. A Qos Broker Based Architecture for Efficient Web Services Selection. Proceedings of the IEEE International Conference on Web Services,2005, pp.113-120.
[67]Sravanthi K, Shonali K, Seng W L. Reputation= f(User Ranking, Compliance, Verity). IEEE International Conference on Web Services,2004, pp.200-207
[68]Demian A D Ananthanarayana V S. A QoS Model and Selection Mechanism for QoS-Aware Web Services. Proceedings of the International Conference on Data Management,2008,pp.138-145.
[69]Ali S., Rana O F, Al-Ali R. UDDIe:An Extended Registry for Web Services, in Proceedings of SAINT Workshops,2003, pp.85-89.
[70]Kunal V., Kaarthik S., Amit S. METEOR-S WSDI:A Scalable P2P Infrastructure of Registries for Semantic Publication and Discovery of Web services. Information Technology and Management,2005.6:(1), pp.18-31.
[71]Li F, Yang F C, and Shuang K, et al. Q-Peer:A Decentralized QoS Registry Architecture for Web Services. Proceedings of International Conference on Service-Oriented Computing,2007, pp.145-156.
[72]Gibelin N, Makpangou M. Efficient and Transparent Web-Services Selection. In: Proceedings of the 3th International Conference on Service Oriented Computing, 2005,pp.527-532.
[73]郭得科,任彦,陈洪辉,等.一种QoS有保障的Web服务分布式发现模型.软件学报,2006,17(11)：2324-2334.
[74]Lehung Vu, Manfred H, Karl A. Towards P2P-based Semantic Web Service Discovery with QoS. Proceeding of Workshop on Business Processes and Services,2006, pp.18-31.
[75]Wan Cheng, Wang Hongbing. Web Service Decision-Making Model Based on Uncertain-but-Bounded Attributes. In:4th SCC Workshop on Semantic Web for Web Service and Processes,2007, pp.81-86.
[76]Fu Xiaodong, Zou Ping, SHANG Zhenhong, et al. Web Service Selection with Uncertain QoS Information. In:Proc. of the 27th Chinese Control Conference, 2008, pp.271-275.
[77]Wan Cheng, Wang Hongbing. Uncertainty-aware QoS Description and Selection Model for Web Services. In:International Conference on Services Computing, 2007, pp.154-161.
[78]李祯,杨放春,苏森,基于模糊多属性决策理论的语义Web服务组合算法.软件学报,2009.20(3)：pp.583-596.
[79]Wang Ping. QoS-aware Web Services Selection With Intuitionistic Fuzzy Set under Consumer's Vague Perception. Expert Systems with Applications,2009, 36(3):4460-4466.
[80]Wang X, Vitvar T, Kerrigan M, et al. Synthetical Evaluation of Multiple Qualities for Service Selection. In:Proc. of 4th International Conference on Service Oriented Computing 2006:152 162.
[81]杨放春,苏森,李祯,混合QoS模型感知的语义Web服务组合策略,中国科学F辑：信息科学.2008.38(10)：1697-1716.
[82]Blaze M, Feigenbaum J, Lacy J. Decentralized Trust Management. Proc. of the 7th Symposium on Security and Privacy,1996, pp.164-173.
[83]Buskens, V. Social Networks and The Effect of Reputation on Cooperation. Proc. of 6th International Conference on Social Dilemmas, pp.1-18.
[84]Wu Guoquan, Wei Jun, Qiao Xiaoqiang, et al. A Bayesian Network Based Qos Assessment Model for Web Services. In:Proc. of International Conference on Service Computing,2007, pp.498-505.
[85]吴国全,魏峻,黄涛.基于非确定性推理的网构软件服务质量动态评估方法研究.软件学报,2008,19(5)：1173-1185.
[86]胡志刚,付毅,肖鹏,等.基于贝叶斯网络的网格QoS可信度评估方法.计算机工程,2009,35(07)：32-35.
[87]Hang Chungwei, Singh M P. Selecting Trustworthy Service in Service-Oriented Enviroments. The 12th AAMAS Workshop on Trust in Agent Societies,2009, pp.213-220.
[88]Manchala D W. Trust Metrics, Models and Protocols For Electronic Commerce Transactions. International Conference on Distributed Computing Systems,1998, pp.312-321.
[89]Surya N, Wanita S, Jonathon H, et al. A Fuzzy Trust Management Framework for Service Web. IEEE International Conference on Web Services,2010, pp.321-328.
[90]Surya N, Zaki M, Athman B. Reputation Propagation in Composite Services. In: Proc. of 7th International Conference on Web Services,2009, pp.295-302.
[91]胡春华,吴敏,刘国平.Web服务工作流中基于信任关系的QoS调度.计算机学报,2009,32(1)：42-53.
[92]潘静,徐锋,吕建.一个面向可信服务选取的基于声誉的推荐者发现方法.软件学报,2010.21(2)：pp.388-400.
[93]刘济波,朱培栋,胡春华.基于两层声誉演化模型的服务组合选取策略.中南大学学报(自然科学版),2009.40(3)：pp.157-161.
[94]Baresi L, Ghezzi C, Guinea S. Smart Monitors for Composed Services. Proceedings of 2nd International Conference on Service-Oriented Computing, 2004,15-19, pp.193-202.
[95]Microsoft Baseline Security Analyzer. [online] http:// www.microsoft.com/technet/security/tools/mbsahome.mspx.
[96]Wang Y, Vassileva J. A Review on Trust and Reputation for Web Service Selection. Proceedings of the 27th International Conference on Distributed Computing Systems Workshops.2007,pp.25-32.
[97]Vu Lehung, Manfred Hauswirth, Karl A. QoS-based Service Selection and Ranking with Trust and Reputation Management. Proceedings of OnTheMove Federated Conference.2005, pp.466-483.
[98]Stephen S, Yau Jinghuang, Yin Yin. Improving the Trustworthiness of Service QoS Information in Service-Based Systems. Proceedings of 7th Autonomic and Trusted Computing (ATC),2010, pp.208-218.
[99]Kalepu S, Krishnaswamy S, Loke S W. Verity:A QoS Metric for Selecting Web Services And Providers. In:Proc. of the 4th International Conference on Web Information Systems Engineering Workshop,2003, pp.131-139.
[100]Manikrao U S, Prabhakar T V. Dynamic Selection of Web Services with Recommonendation System. In:Proc. of International Conference on Next Generation Web Services Practices.2005, pp.22-26.
[101]Jurca R, Faltings B, Binder W. Reliable QoS Monitoring Based on Client Feedback. Proceedings of 16th International Conference on World Wide Web, 2007, pp.1003-1012.
[102]王怀民,史佩昌,丁博.软件服务的在线演化.计算机学报,2011.34(2)：pp.318-328.
[103]Papazoglou M P, The Challenges of Service Evolution. In Proc. of the 20th International Conference on Advanced Information Systems Engineering.2008, pp.1-15.
[104]曾晋,孙海龙,刘旭东,基于服务组合的可信软件动态演化机制.软件学报,2010.21(2)：p.261-276.
[105]汪小帆,李翔,陈关荣,复杂网络理论及其应用.2006,北京：清华大学出版社.
[106]何克清,马于涛,刘婧,软件网络.2008,北京：科学出版社.
[107]Watts D J, Strogatz S H. Collective Dynamics of'Small-World'Networks. Nature.1998,393:pp.440-442.
[108]Barabasi, Reka A. Emergence of Scaling in Random Networks. Science.1999. 286:p.509-512.
[109]Elnaffar S, Maamar Z, Yahyaoui H, et al. Reputation of Communities of Web Services Preliminary Investigation. Proc. of the 22'nd IEEE Int. Conf. on Advanced. Inf. Networking and App,2008, pp.1603-1608.
[110]Khosravifar B, Bentahar J, Thiran P, et al. An Approach to Incentive-based. Reputation for Communities of Web Services. Proc. of the 7th International Conference on Web Services,2009.pp.145-151.
[111]Kil Hyunyoung. Graph Theoretic Topological Analysis of Web Service Networks. Jour, of World Wide Web,2009:12(3), pp.321-343.
[112]Zhang Xizhe, Yin Ying, Zhang Mingwei et al. A Composite Web Services Discovery Technique Based on Community Mining. Proc. of the 4th Asia-Pacific Services Computing Conference,2009, pp.445-450.
[113]Ji Guang, Zhang Jie, Zhao Zhuofeng Et Al. Service Collaboration Network:A Novel Mechanism for Web Service Management. Proc. of the 12th Asia-Pacific Web Conference 2010, pp.85-91.
[114]Aversano L, Canfora G, Ciampi A. An algorithm for Web service discovery through their composition. In:Proc. of the IEEE Int'l Conf. on Web Services, 2004, pp.332-341.
[115]Constantinescu I, Binder W, Faltings B. Flexible and Efficient Matchmaking and Ranking in Service Directories. In:IEEE International Conference on Web Service,2005, pp.5-12.
[116]邝砾,邓水光,李莹,等.使用倒排索引优化面向组合的语义服务发现.软件学报,2007,18(8)：pp.191 1-1921.
[117]Tang C, Xu Z, Dwarkadas S. Peer-to-peer Information Retrieval using Self-organizing Semantic Overlay Networks. In Proceedings of pecial Interest Group on Data Communication,2003, pp.175-186.
[118]Hashemian S V, Mavaddat F. A Graph-Based Approach to Web Services Composition. In Proceedings of SAINT.2005, pp.183-189.
[119]Zhou A, Huang S, Wang X. BITS:A Binary Tree Based Web Service Composition System. Int. Journal of Web Services Research,2007.4(3):pp. 205-225.
[120]Tang H, Zhong F, Yang C. A Tree-Based Method of Web Service Composition. Proc. of the Int. Conf. on Web Services,2008, pp.768-770.
[121]Shiaa M M, Fladmark J O, THIELL B. An Incremental Graph-based Approach to Automatic Service Composition. Proc. of the Int. Conf. on Services Computing,2008, pp.148-165.
[122]Huang S, X Wang, A Zhou. Efficientsed On Syntactical Matching, in Proceedings of the 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service,2005, pp.
[123]Cheng Zeng, Xiao Guo, Weijie Ou, et al. Cloud Computing Service Composition and Search Based on Semantic. Proc. of 1 st Conference on Cloud computing,2009, pp.291-300.
[124]Srivastava U, Munagala K, Widom J, et al. Query Optimization over Web Services. In:Proc. of 32nd Very Large Data Bases,2006, pp.35-366.
[125]Kwon J, Park K, Lee D et al. PSR:Pre-computing Solutions in RDBMS for Fast Web Service Composition Search. Proc. of 5th International Conference on Web Service,2007, pp.808-815.
[126]Pathak J, Basu S, Lutz R, et al. Parallel Web Service Composition in MoSCoE: A Choreography-Based Approach. Proc. of the 4th European Conf. on Web Services,2006, pp.3-12.
[127]Hennig P, Balke W. Highly Scalable Web Service Composition using Binary Tree-based Parallelization, IEEE International Conference on Web Services, 2010, pp.123-130.
[128]刘志忠,王怀民,周斌.一种双层P2P结构的语义服务发现模型.软件学报,2007.18(8)：pp.1922-1932.
[129]Yahoo Available from:http://www.yahoo.com.
[130]DMOZ Available from:http://www.dmoz.org.
[131]Eyhab A M, Mahmoud Q H. Investigating Web Services on The World Wide Web. In:Proceeding of the 17th international conference on World Wide Web, 2008, pp.795-804.
[132]Prasanna G, Mayank B, Hector G M. Online Balancing of Range-Partitioned Data With Applications to Peer-to-Peer Systems. In:proc. of the 30th International Conference on Very Large Databases,2004, pp.444-455.
[133]王明文.基于概率区间的Bayes决策方法.系统工程理论与实践,1997.7(11)：pp.79-82.
[134]张尧庭,张能胜.专家系统中不确定性方法学.1994,广西师范大学出版社：南宁.
[135]Li R J, Lee E S. Ranking Fuzzy Numbers-A Comparison. In:Proc. North American Fuzzy Information Processing Society,1987, pp.169-204.
[136]刘书雷,刘云翔,张帆,一种服务聚合中QoS全局最优服务动态选择算法.软件学报,2007.18(3)：pp.646-656.
[137]Newman M E J, Girvan M. Finding and Evaluating Community Structure in Networks, Physical Review E,2004,69(22):1-15.
[138]郑金华,蔡自兴.自动区域划分的分区搜索狭义遗传算法.计算机研究与发展.37(4)：pp.397-400.
[139]Hemminger S. Network Emulation with NetEm. In:Proc. of Linux Conference, 2005.
[140]Eugster P, Guerraoui R, Handurukande S, Kermarrec AM, Kouznetsov P. Lightweight probabilistic broadcast. ACM Trans. On Computer Systems, 2003,21(4):341(?)374.
[141]Van Renesse R, Birman KP, Vogels W. Astrolabe:A Robust and Scalable Technology for Distributed System Monitoring, Management and Data Mining. ACM Trans, on Computer Systems,2003,21(2):164(?)206.
[142]Girvan M, Newman M E J, Community Structure in Social and Biological Networks. Proc. Natl. Acad. Sci.,2001,99:7821-7826.
[143]Newman M E J. Fast Algorithm for Detecting Community Structure in Network. Phy. Rev. E,2004.
[144]Clauset A, Newman M E J, Moore C, Finding Community Structure in Very Large Networks. Phys. Rev. E.,2004,70:066111.
[145]Seog-Chan Oh, Dongwon Lee. WSBen:A Web Services Discovery and Composition Benchmark Toolkit. International Journal of Web Services Research,2009.6(1):1-19.
[146]Ye Q, Wu B, Wang B. JSNVA:A Java Straight-line Drawing Framework for Network Visual Analysis.In:Proceedings of the 4th International Conference on Advanced Data Mining and Applications,2008, pp.667-674.
[147]Brin S, Page L. The Anatomy of A Largescale Hypertextual Web Search Engine. Computer Networks and ISDN Systems,1998,30(17):107-117.
[148]Seog-Chan Oh, Ju-Yeon Lee, Seon-Hwa Cheong, et al. WSPR*:Web-Service Planner Augmented with A* Algorithm. In:Proc. of 11th IEEE Conference on Commerce and Enterprise Computing,2009, pp.515-518.
[149]罗伊尔,数据挖掘基础教程.2009,北京：机械工业出版社.
[150]SAATY, T.L., The analytic hierarchy process.1980, New York:McGrawHill.
[151]Gao Z, W Gengfeng. Combining QoS-based Service Selection with Performance Prediction, in The 2nd IEEE International Conference on e-Business Engineering,2003, pp.611-614.
[152]Zhang J. A Short-Term Prediction for QoS of Web Service Based on Wavelet Neural Networks, in International Conference on Computational Intelligence and Communication Networks.2010, pp.254-258.
[153]西奥多里蒂斯,模式识别.2010,北京：电子工业出版社.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |