一种面向QoS的Web服务组测试方法TF

Web服务及SOA技术的出现为Web应用架构提供了一个新的范式.未来会有大量功能相同或相近的Web服务,如何从中优选出符合用户需要的Web服务已成为一个正在研究的问题.在研究了现有的Web服务组中Web服务优选方法基础上,针对其仅局限于功能优选的不足,提出了一种面向QoS的Web服务组中Web服务优选方法.在定义Web服务QoS向量特征分量、QoS向量、最大相似度、QoS测试预言、QoS向量特征分量测试预言等参数基础上,基于层次聚类思想实现QoS向量聚类,依据最大相似度控制聚类层次,之后利用QoS测试预言、QoS向量特征分量测试预言及决策树实现优选.实验结果表明该方法是有效的,克服了以前的方法仅限于功能优选的局限性.     

一种支持一致性QoS适度模糊匹配方法

针对目前有关Web服务QoS的研究很少考虑到QoS非功能服务现状,在Web服务模糊匹配框架的基础上,从消费者需求的角度出发,通过引入模糊逻辑,提出了一种一致性QoS适度的模糊匹配方法.该方法将消费者的意见进行模糊相似聚类计算,使消费者达到对某个QoS属性值的一致性认识,然后通过实验对这种方法进行验证.实验表明,该方法在模糊匹配过程中采用了相对客观的QoS值,能够有效的提高Web服务的查准率.     

一种Web服务QoS可信性评价模型

随着Web服务数量的增加,根据Web服务的非功能属性(QoS)度量Web服务质量成为研究热点之一.目前对Web服务QoS的研究主要集中在QoS信息管理、QoS度量方法及基于QoS驱动的服务选取上,但对于QoS评价的可信性研究较少.本文在目前QoS研究的基础上提出一个Web服务QoS可信性评价模型,并给出了两种Web服务QoS可信性评价方法.最后,描述了可信性评价的实验过程及效率分析.     

基于聚类的QoS语义Web服务发现研究

如何动态地选择出适合用户需求的Web服务正在引起相关研究者的关注.为了提高Web服务查找的效率,提出了一种支持QoS的语义Web服务发现框架.首先根据Web服务本体分别计算服务描述、输入、输出、前提条件和结果这五个层面的语义相似性,然后利用聚类技术,将相似度高的服务聚为一类,过滤掉与服务请求完全不同类别的服务,形成候选服务集,最后进行QoS比较,得到一个服务排序,为请求者选择QoS综合值最高的服务.仿真实验验证了该方法的可行性和有效性.     

基于用户反馈QoS的动态Web服务发现方法

由于传统的基于关键字和简单分类的Web服务发现机制缺少服务质量(QoS)考虑,因此不能很好满足用户的需求。针对该问题,提出一种基于QoS的Web服务发现模型,通过引入QoS代理机制,对终端用户使用Web服务后反馈的QoS信息进行量化和度量处理,以支持基于QoS的Web服务发现;在此基础上,根据Web服务的动态性特点和不同用户的QoS需求,给出了基于用户反馈的QoS数据度量方法,并提出一种基于QoS的Web服务发现算法。实验结果表明,提出的Web服务发现方法能够较好地满足用户的需求。     

一种新的预测用户浏览模式的度量方法

在Web环境中,度量用户的浏览模式对Web站点结构的改进是有益的。挖掘和度量Web日志能够识别用户的访问模式模型,Web站点管理者能够应用这些模型研究用户的访问偏爱度,由此改进站点的体系结构以及分析这些改进带来的影响。因此,提出用户群偏爱度这样一个新概念,并使用了基于用户群的模糊聚类算法（UGFC）,然后根据聚类结果,即具有相似访问习惯的用户群体,度量用户群偏爱度,再基于用户群偏爱度,利用混合阶Markov模型（HOMM）进行预测。实验表明,这种新的度量预测方法（UGFC-HOMM）比传统Markov模型（TMM）预测更准确,并且实验用精确率、覆盖率和运行时间这3个度量评价值对预测性能进行评估。     

基于语义的Web服务发现算法

传统的Web服务发现只是简单的基于关键字的语法匹配,查询得到的服务往往不是用户想要的.在基于接口的Web服务发现的基础上,改进了Web服务描述模型,增加了服务质量(QoS),提出了分步过滤匹配算法.先通过服务类别过滤器进行语义过滤筛选,去除不相关的Web服务,然后通过服务相似度度量候选服务和请求服务之间的相似程度.候选服务和请求服务之间的相似度是通过服务功能相似度和服务质量相似度两个方面进行综合评估的.最后,通过实验证明了该匹配算法的可行性和有效性.     

加权的自适应相似度度量

聚类分析是数据挖掘中一种非常重要的技术.聚类算法中的关键问题是相异度或相似度的度量,聚类结果直接依赖于相异度或相似度度量,尤其对于谱聚类方法更是如此.谱聚类算法是近期兴起的一种基于相似度矩阵的聚类算法.相比于传统的划分型聚类算法,谱聚类算法不受限于球状聚类簇,能够发现不规则形状的聚类簇.在已有的谱聚类算法中,高斯核相似度是最常用的相似度度量准则.基于高斯核相似度度量及其扩展形式,提出了一种加权的自适应的相似度度量,此相似度可以用于谱聚类以及其他基于相似度矩阵的聚类算法.新的相似度度量不仅能够描述多密度聚类簇中数据点间的相似度,而且可以降低离群点(噪声点)与其他数据点间的相似度.实验结果显示新的相似度度量可以更好地描述不同类型的数据集中数据点间的相似度,进而得到更好的聚类结果.     

QoS computing method for Web services composition based on topological seouence reduction

考虑有向无环图(DAG)描述的组合服务模型,提出了一种新的组合服务QoS度量方法——基于拓扑序列归约的Web服务QoS度量方法(QCMTSR).其借鉴迭代归约度量方法中的基本结构及Q6计算公式,定义了DAG图中的两类基本结构,串归约结构和并归约结构,并给出了两种基本结构的QoS属性计算公式;通过逐步归约DAG图拓扑序列中的每个节点,直至最后一个节点的QoS属性值就是组合服务的各QoS属性的度量结果.从理论上证明了QCMTSR算法适用于所有DAG描述的组合服务,并实验证明QCMTSR算法对可靠性和可用性能够更准确的度量.     

快速语义Web服务发现方法

针对现有的基于本体描述的语义Web服务发现方法发现效率较为低下的问题,提出一种新的服务发现方法.该方法在基于本体距离计算语义Web服务综合相似度的基础上,利用数据挖掘中的聚类算法AGNES对语义Web服务集合进行聚类预处理,形成若干服务簇,然后应用相应服务发现算法根据相似度阈值定位于某一服务簇内进行查找匹配,从而可减少搜索空间.理论与仿真实验结果表明,该方法既可保证服务发现的准确率,又可明显提高服务发现的效率.     

Multi-group QoS consensus for web services

QoS has been considered as a significant factor for web service marketing and selection. The interpretation of QoS value from web service consumers and providers would be very different. However, a large group of web service participants with different backgrounds may have difficulties in reaching consensus on the values of multi-dimensional web service QoS, so they may have to be clustered in multi-groups in order to improve effectiveness and efficiency. The similarity of clustered fuzzy QoS dispositions as well as their preference order over these attributes should be analyzed to form a multi-groups consensus framework. A soft multi-groups clustering approach could be adopted to prevent opinions from being excluded unintentionally. The group boundaries and similarity thresholds which are used for clustering and analyzing fuzzy QoS opinions can be moderated dynamically according to the feedback from the internal learning mechanism and the web service consumers. As a result, a model for marketing web services based on multi-group consumers' QoS consensus, the FMG-QCMA (Fuzzy Multi-Groups based QoS Consensus Moderation Approach), is proposed to meet the above requirements. The proposed FMG-QCMA is also evaluated through a case study to demonstrate its effectiveness and efficiency in relation to an existing framework, QCMA (QoS Consensus Moderation Approach).     

基于QoS的Web服务动态组合模型

提出一种基于QoS的Web服务动态组合模型,可以根据用户对服务质量的请求,动态地选择最适合的Web服务进行绑定.与原有模型相比,扩展了服务代理的功能.其提供的绑定功能可用于保存服务调用的上下文和历史信息,以便提高下次访问的效率.另外,支持对子服务的划分,可以将大粒度的服务请求划分成子服务,并对服务的调用次序进行更合理地安排和优化.性能分析结果表明,该模型极大地提高了效率.     

A trustworthy QoS-based collaborative filtering approach for web service discovery

Many network services which process a large quantity of data and knowledge are available in the distributed network environment, and provide applications to users based on Service-Oriented Architecture (SOA) and Web services technology. Therefore, a useful web service discovery approach for data and knowledge discovery process in the complex network environment is a very significant issue. Using the traditional keyword-based search method, users find it difficult to choose the best web services from those with similar functionalities. In addition, in an untrustworthy real world environment, the QoS-based service discovery approach cannot verify the correctness of the web services’ Quality of Service (QoS) values, since such values guaranteed by a service provider are different from the real ones. This work proposes a trustworthy two-phase web service discovery mechanism based on QoS and collaborative filtering, which discovers and recommends the needed web services effectively for users in the distributed environment, and also solves the problem of services with incorrect QoS information. In the experiment, the theoretical analysis and simulation experiment results show that the proposed method can accurately recommend the needed services to users, and improve the recommendation quality.     

Consumer-centric QoS-aware selection of web services

There exist many web services which exhibit similar functional characteristics. It is imperative to provide service consumers with facilities for selecting required web services according to their non-functional characteristics or quality of service (QoS). However, the selection process is greatly complicated by the distinct views of service providers and consumers on the services QoS. For instance, they may have distinct views of the service reliability—wherein a consumer considers that a service is reliable if its success rate is higher than 99%, while a provider may consider its service as reliable if its success rate is higher than 90%. The aim of this paper is to resolve such conflicts and to ensure consensus on the QoS characteristics in the selection of web services. It proposes a QoS Consensus Moderation Approach (QCMA) in order to perform QoS consensus and to alleviate the differences on QoS characteristics in the selection of web services. The proposed approach is implemented as a prototype tool and is tested on a case study of a hotel booking web service. Experimental results show that the proposed approach greatly improves the service selection process in a dynamic and uncertain environment of web services.     

Probabilistic approach for QoS-aware recommender system for trustworthy web service selection

We present a QoS-aware recommender approach based on probabilistic models to assist the selection of web services in open, distributed, and service-oriented environments. This approach allows consumers to maintain a trust model for each service provider they interact with, leading to the prediction of the most trustworthy service a consumer can interact with among a plethora of similar services. In this paper, we associate the trust in a service to its performance denoted by QoS ratings instigated by the amalgamation of various QoS metrics. Since the quality of a service is contingent, which renders its trustworthiness uncertain, we adopt a probabilistic approach for the prediction of the quality of a service based on the evaluation of past experiences (ratings) of each of its consumers. We represent the QoS ratings of services using different statistical distributions, namely multinomial Dirichlet, multinomial generalized Dirichlet, and multinomial Beta-Liouville. We leverage various machine learning techniques to compute the probabilities of each web service to belong to different quality classes. For instance, we use the Bayesian inference method to estimate the parameters of the aforementioned distributions, which presents a multidimensional probabilistic embodiment of the quality of the corresponding web services. We also employ a Bayesian network classifier with a Beta-Liouville prior to enable the classification of the QoS of composite services given the QoS of its constituents. We extend our approach to function in an online setting using the Voting EM algorithm that enables the estimation of the probabilities of the QoS after each interaction with a web service. Our experimental results demonstrate the effectiveness of the proposed approaches in modeling, classifying and incrementally learning the QoS ratings.     

一种基于组合赋权法的Web服务选择策略*

针对Web服务选择中服务请求偏好权重表达的模糊性及服务质量(QoS)属性值间存在的相互制约关系等问题,提出一种基于组合赋权法的Web服务选择策略。首先利用模糊层次分析法(FAHP)和主成分分析法(PCA)分别计算主观QoS权重和客观QoS权重;然后综合主、客观QoS权重利用组合赋权法(CWA)计算服务请求的综合QoS权重;最后提出一种综合评价函数,以保障所选择的服务在满足服务请求偏好的基础上,能更准确地反映候选Web服务总体QoS水平。实例分析表明该方法是有效的。     

动态Web服务合成中的服务选择算法研究

为了提高服务合成效率并更好的适应动态变化的应用环境,提出了基于流程修改的服务合成方案,使得复合服务的执行与服务发现过程并行化。提出了基于QoS属性的服务选择算法,该算法能够实现服务执行时选择服务,在考虑综合QoS信息及时间因素的基础上,通过不断更新用户需求来进行服务选择,提高了服务合成效率。实验结果表明,该选择算法可以获得满足用户需求且最优的服务,很好的保证了服务的可靠执行。     

一种考虑QoS数据可信性的服务选择方法

随着Internet上功能相似的Web服务的逐渐增多,在运行时刻基于服务质量(QoS)对Web服务进行查找和选择已成为研究热点.现有的基于QoS的服务选择方法通常假定服务提供者和使用者给出的QoS数据都是真实可信的,然而这一假设在实际中往往很难保证.为此,提出了一种考虑QoS数据可信性的服务选择方法.方法从QoS数据来源的角度对质量属性进行分类和计算:对于数据来自服务提供者的质量属性,使用以往运行数据统计,对提供者的QoS数据进行修正;对于数据来自服务使用者的质量属性,通过计算用户间以往反馈的相似程度权衡不同QoS反馈数据的可信程度.对此给出了实现框架,并通过一组模拟实验说明该方法能够有效地削弱不可信的QoS数据对服务选择的影响,增强了Web服务选择结果的准确性.     

基于QoS和多级索引的Web服务发布订阅

发布订阅机制有利于实现对大规模Web服务的主动管理,提出了基于QoS的Web服务发布订阅模型和系统架构,设计了基于QoS和多级索引的Web服务匹配算法。Web服务的QoS属性和订阅的属性约束所形成相应的匹配关系构成模型的关键;将发布的Web服务及其QoS和服务订阅一起生成过滤矩阵,通过属性约束覆盖可以减少重复匹配;按QoS属性类型对发布的Web服务建立多级索引,生成属性到服务的映射,可以实现服务订阅的快速匹配。实验结果表明,该Web服务发布订阅系统比传统方法有较大提升,能够适应于大规模分布式Web服务管理。     

Multi-valued collaborative QoS prediction for cloud service via time series analysis

Aiming at the diversity of user features, the uncertainty and the variation characteristics of quality of service (QoS), by exploiting the continuous monitoring data of cloud services, this paper proposes a multi-valued collaborative approach to predict the unknown QoS values via time series analysis for potential users. In this approach, the multi-valued QoS evaluations consisting of single-value data and time series data from consumers are transformed into cloud models, and the differences between potential users and other consumers in every period are measured based on these cloud models. Against the deficiency of existing methods of similarity measurement between cloud models, this paper presents a new vector comparison method combining the orientation similarity and dimension similarity to improve the precision of similarity calculation. The fuzzy analytic hierarchy process method is used to help potential users determine the objective weight of every period, and the neighboring users are selected for the potential user according to their comprehensive similarities of QoS evaluations in multiple periods. By incorporating the multi-valued QoS evaluations with the objective weights among multiple periods, the predicted results can remain consistent with the periodic variations of QoS. Finally, the experiments based on a real-world dataset demonstrate that this approach can provide high accuracy of collaborative QoS prediction for multi-valued evaluations in the cloud computing paradigm.