Web 服务选择中信誉度评估方法

在开放的Web服务环境中,由于无法保证用户使用服务后给出的反馈等级是真实可靠的,导致服务的信誉度评估结果与实际值存在较大偏差,进而服务选择失败率较高.为了克服上述问题,提出了一种用于Web服务选择的信誉度评估方法.该方法的主要思想是,通过反馈核查、校正和检测这3个信誉度评估模块对服务的信誉度进行评估.仿真结果表明,所提出的方法不仅有效提高了信誉度评估的客观性,还显著减小了服务选择的偏离度.     

Multifactor hierarchical fuzzy trust evaluation on peer-to-peer networks

Decentralized Peer-to-Peer (P2P) networks offer not only opportunities but also threats. Due to the autonomy, self-interest and heterogeneousness of peers, the interaction outcomes are uncertain. One way to minimize the threats in such an open environment is exploiting the reputation method to evaluate the trustworthiness and predict the future behaviors of peers. While most of the existing reputation-based trust models focus on preventing network from the malicious peers, peers’ capabilities to fulfill the tasks are mostly ignored. In this paper, we present a novel trust model MHFTrust which quantifies and compares the trustworthiness of peers based on hierarchical fuzzy system. Six capability factors are identified to describe the peers’ trust on the capability, and one security factor, named “Malicious behavior” is used to evaluate the peers’ trust on security. Our trust model consisted of local-trust computation based on fuzzy techniques and global reputation aggregation, which integrates feedback from other peers to produce a global reputation for each peer. Credibility and weight of feedback are introduced to facilitate the computation of global reputation. It is shown in simulation that our trust model greatly improves the efficiency of P2P system, while the number of inauthentic files on the network is significantly decreased.     

PeerTrust: supporting reputation-based trust for peer-to-peer electronic communities

Peer-to-peer (P2P) online communities are commonly perceived as an environment offering both opportunities and threats. One way to minimize threats in such communities is to use community-based reputations to help estimate the trustworthiness of peers. We present PeerTrust - a reputation-based trust supporting framework, which includes a coherent adaptive trust model for quantifying and comparing the trustworthiness of peers based on a transaction-based feedback system, and a decentralized implementation of such a model over a structured P2P network. PeerTrust model has two main features. First, we introduce three basic trust parameters and two adaptive factors in computing trustworthiness of peers, namely, feedback a peer receives from other peers, the total number of transactions a peer performs, the credibility of the feedback sources, transaction context factor, and the community context factor. Second, we define a general trust metric to combine these parameters. Other contributions of the paper include strategies used for implementing the trust model in a decentralized P2P environment, evaluation mechanisms to validate the effectiveness and cost of PeerTrust model, and a set of experiments that show the feasibility and benefit of our approach.     

Cooperativeness prediction in P2P networks

Peer-to-peer systems are open communities, in which not only is there no overarching control, but neither is there any hierarchy of control among the system components. In such open communities where peers can join and leave freely and behave autonomously, selecting appropriate peers to cooperate with is a challenging problem, since the candidate peers may be unreliable or dishonest. Reputation systems have been proposed to boost trust and enhance collaboration among peers. However, conventional computational reputation systems tend to generate trust based on ad hoc aggregation techniques thus produce reputation values with ambiguous meanings. In this paper we propose a probabilistic computational approach to model and generate reputation. By explicitly separating the reputation between providing services and giving recommendations, our solution represents the estimate of service quality for a specific transaction as a probability conditioned upon each retrieved recommendation, thus taking the innate behaviours of reporters into account. A Kalman filter is applied to learn further the service reputation from the estimate. The proposed approach works well even when there is sparse feedback from the reporting peers giving output with well-defined semantics and useful meanings.     

一种基于信任的Web服务发现方法

在面向服务的环境下,由于Web服务本身的动态性和网络环境的不确定性,致使用户很难获得可信的高质量服务。当前基于反馈信息的信任评估方法没有考虑恶意评估对服务可信程度的影响,本文通过加入客观评价对此进行了修正,并提出一种从服务的能力、稳定性和声誉三方面来建立的Web服务信任模型,提升了信任评估的准确度。在此基础上提出一种可信的Web服务发现框架,通过服务交易历史信息获取比较客观的信任属性,同时结合非功能属性进行服务的综合评估,利用熵值法来确定其中各非功能属性的权重,从而发现满足用户需求的可信服务。仿真结果表明,该方法是可行和有效的。     

一种多维集成直觉模糊信息的信任评价方法

信任是保证在线服务质量的前提。针对电子商务环境存在的复杂性、模糊性和不确定性等因素,引入直觉模糊理论,提出了一种多维集成直觉模糊信息的信任评价方法,给出了两类信任反馈属性集成直觉模糊信息的方法,通过直觉模糊熵确定属性权重,并利用直觉加权算数平均算子求出实体的综合直觉模糊数,从而全面、客观和细腻地反映信任的模糊性和不确定性。计算实例和仿真实验表明,基于多维集成直觉模糊信息的信任评估方法是可行的,通过对风险偏好因子的灵敏度分析,发现服务请求者风险偏好不同,则评估的服务提供商的信任得分也不同;同时也验证了该方法可以有效地抑制恶意节点的攻击,为电子商务环境下信任评价的研究提供了新思路。     

A classification-based review recommender

Many online stores encourage their users to submit product or service reviews in order to guide future purchasing decisions. These reviews are often listed alongside product recommendations but, to date, limited attention has been paid as to how best to present these reviews to the end-user. In this paper, we describe a supervised classification approach that is designed to identify and recommend the most helpful product reviews. Using the TripAdvisor service as a case study, we compare the performance of several classification techniques using a range of features derived from hotel reviews. We then describe how these classifiers can be used as the basis for a practical recommender that automatically suggests the most-helpful contrasting reviews to end-users. We present an empirical evaluation which shows that our approach achieves a statistically significant improvement over alternative review ranking schemes.     

Behavior-based reputation management in P2P file-sharing networks

Trust research has become a key issue in the last few years as a novel and valid solution to ensure the security and application in peer-to-peer (P2P) file-sharing networks. The accurate measure of trust and reputation is a hard problem, most of the existing trust mechanisms adopt the historical behavior feedback to compute trust and reputation. Thus exploring the appropriate transaction behavior becomes a fundamental challenge. In P2P system, each peer plays two roles: server and client with responsibility for providing resource service and trust recommending respectively. Considering the resource service behavior and trust recommending behavior of each peer, in this paper, we propose a new trust model adopting the technology to calculate eigenvectors of trust rating and recommending matrices. In our model, we define recommended reputation value to evaluate the resource service behavior, and recommending reputation value to evaluate the trust recommendation behavior. Our algorithm would make these two reputation values established an interrelated relation of reinforcing mutually. The normal peers provide authentic file uploading services, as well as give correct trust recommendation, so they can form a trusted and cooperative transaction community via the mutual reinforcement of recommended and recommending reputation values. In this way, the transaction behaviors of those malicious peers are isolated and confined effectively. Extensive experimental results also confirm the efficiency of our trust model against the threats of exaggeration, collusion, disguise, sybil and single-behavior.     

基于用户经验反馈的Web Services可信度评测体系构建

服务之间的可信度是Web Services推广和计价中必须考虑的一个问题。提出服务可信度的影响因素包括QoS可信度和用户对服务执行结果的满意程度。通过用户经验反馈,针对不同领域获取用户对相应服务的可信度评价量化值,并计算QoS的实际满足率,以此建立服务的可信度评测体系。针对QoS欺骗问题,通过定期QoS统计分析,及时进行QoS修正,保持服务的高可信度。通过在模拟系统中的试用,此可信度评测体系在持续欺骗服务实体和暂时性QoS失真情况下均较低为合理。     

双ratings的声誉模型

针对现有对等网络系统中的声誉模型不能很好地处理虚假反馈和合谋的问题,结合公平思想,提出了一种新的基于双ratings的声誉模型.采用两个度量来评价节点:服务信任和回馈信任.服务信任表示服务节点提供服务的可靠性;回馈信任表示评价节点评价的可靠性.该模型根据节点历史交易情况,通过比较评价节点的评价值以及比较评价节点的回馈信任,识别虚假反馈和合谋,并给出了具体量化的服务信任和回馈信任数学表达形式.实验结果表明了模型的可行性和算法的有效性.     

Online reputation systems: Design and strategic practices

This paper provides a comprehensive framework for evaluating the effects of feedback systems, and the potential problems with feedback systems, on seller incentives to provide high quality products under the case of asymmetric information. In particular, a baseline auction system without a feedback-based reputation system is first modeled and it is shown that the market for the sale of high quality products may not be sustainable. We then show how the institution of a feedback system can lead to sustainable market outcomes. Next, we demonstrate how three practices – the changing of identifications by dishonest sellers, shilling, and failure to leave feedback – can negate the usefulness of the feedback system in maintaining the market. Finally, we describe some actions that may be taken to overcome these problems. These results highlight the important role market managers play in ameliorating these market failure problems and ensuring the effective functioning of a market.     

An evidence-based scheme for web service selection

Existing studies on the web service selection problem focus mainly on the functional QoS properties of the service rather than the consumer satisfaction and trust aspects. While a good QoS enhances the reputation of a service, different consumers invariably hold differing views of the service contents. Some service reputation approaches primarily consider the consumer’s prior experience of the service via opinion feedback system, may neglect the effect of social trust transition in the recommendations of others. As a result, the problem of reaching consensus on the level of consumer trust regarding service becomes one of key issues in service selection. This study proposes a trust-based service selection model to estimate the degree of consumer trust in a particular service based on the consumers’ direct experience and indirect recommendation of the service. In the proposed approach, the degree of consumer trust is correctly estimated by extending Dempster–Shafer evidence reasoning theory to the reputation computation using consumers’ direct experience and incorporating Jøsang’s belief model for solving the trust transition problem in the indirect recommendation of the service. The proposed model effectively enables deception detection by means of existing bodies of evidence, and therefore excludes the fraudulent evidence of malicious evaluators from the selection process. In addition, a quality index is proposed to help third party (TTP) examine the body of evidence and make the outranking result more reliable. Importantly, the quality index is based not only on the confidence degree of the evidence, but also on the support degree, and therefore discovers the effects of intentional negative assessments. The validity of the proposed approach is demonstrated numerically by means of two service selection examples.     

A reputation assessment model for trustful service recommendation

Nowadays, software systems are mainly Web front-based, Cloud-deployed and accessible by a wide audience over the Internet. These online systems commonly rely on Service-oriented Architecture principles, where they are built as orchestrations of RESTful (and in some rare cases as SOAP-based) services. Integrating new services in an existing orchestration is a challenging and risky task because trustworthiness of these services is not guaranteed throughout their lifetime. Reputation of services is a good indicator about the overall quality of services, because it reflects consumer satisfaction regarding the service-offered functionality and quality. Thus, reputation of services could be considered in the selection and recommendation of trustworthy services. In this paper, we present a framework for the management of web service reputation to conduct a better service recommendation. We present a reputation assessment model that aggregates fair user feedback ratings. The model includes a mechanism that prevents the introduction of malicious feedback ratings, by penalizing detected specious users. In addition, this framework includes a bootstrapping technique for estimating reputation of newcomer services based on neighbor similarity and initial advertised QoS. A set of experiments has been conducted to evaluate the effectiveness of the proposed framework. The results of these experiments highlighted the potential of our framework. These are presented at the end of the paper.     

一种P2P文件共享网络高精度自适应声誉机制

P2P文件共享网络的信任评价机制正面临着各种恶意攻击,例如聚集反馈、合谋欺骗和虚假交易,严重影响了整个系统的性能.为了保护P2P文件共享网络,提出了一种高精度自适应声誉机制,简称AARep机制(accurate and adaptive reputation mechanism).经过分析发现,在信任评价系统中,除了对...     

Trust management towards service-oriented applications

In service-oriented computing (SOC) environments, service clients interact with service providers for services or transactions. From the point view of service clients, the trust status of a service provider is a critical issue to consider, particularly when the service provider is unknown to them. Typically, the trust evaluation is based on the feedback on the service quality provided by service clients. In this paper, we first present a trust management framework that is event-driven and rule-based. In this framework, trust computation is based on formulae. But rules are defined to determine which formula to use and what arguments to use, according to the event occurred during the transaction or service. In addition, we propose some trust evaluation metrics and a formula for trust computation. The formula is designed to be adaptable to different application domains by setting suitable arguments. Particularly, the proposed model addresses the incremental characteristics of trust establishment process. Furthermore, we propose a fuzzy logic based approach for determining reputation ranks that particularly differentiates new service providers and old (long-existing) ones. This is further incentive to new service providers and penalize poor quality services from service providers. Finally, a set of empirical studies has been conducted to study the properties of the proposed approaches, and the method to control the trust changes in both trust increment and decrement cases. The proposed framework is adaptable for different domains and complex trust evaluation systems.

User‐centric trust and reputation model for personal and trusted service selection

Improving quality of services (QoS) through applying trust and reputation management technology is increasingly popular in the literature and industry. Most existing trust and reputation systems calculate a general trust value or vector based on the gathered feedback without regard to trust's locality and subjectivity; therefore, they cannot effectively support a personal selection with consumer preferences. Our goal is to build a trust and reputation mechanism for facilitating a trustworthy and personal service selection in a service‐oriented Web, where service peers can act as a service provider and/or a service consumer. A user‐centric trust and reputation mechanism distinguishing the different trust context and content to enable a personal service selection with regard to trust preference in a service‐oriented Web is represented in detail. It is widely recognized that reputation‐based trust methods must face the challenge of malicious behaviors. To deal with the malicious feedback behaviors, we introduce a “bidirectional'' feedback mechanism based on QoS experience similarity in our trust and reputation framework. The test run demonstrates that our method can significantly increase the success rate of service transactions and is effective in resisting various malicious behaviors of service peers, when it is compared to other similar methods. © 2011 Wiley Periodicals, Inc.     

Combining VIKOR with GRA techniques to evaluate service quality of airports under fuzzy environment

The aim of this paper was to present an effective approach for evaluating service quality of Northeast-Asian international airports by conducting customer surveys. In general, evaluation of service quality is a complex multicriteria decision-making (MCDM) problem; therefore, a complex decision process is often involved in which multiple requirements and fuzzy conditions have to be taken into consideration simultaneously. By combining concepts of VIKOR and grey relational analysis (GRA), a new fuzzy MCDM method was proposed to deal with the evaluation of service quality problems in the international airports. This model was solved by an effective algorithm, which incorporated the decision-maker’s attitude and/or preference for customers’ assessments on weights and performance ratings of each criterion. An empirical study for evaluating service quality of seven major Northeast-Asian international airports was put forth to illustrate an application of the proposed model. The study results showed that this approach is an effective means for tackling MCDM problems involving subjective assessments of qualitative attributes in a fuzzy environment.     

Reputation mechanism for e-commerce in virtual reality environments

The interest in 3D technology and virtual reality (VR) is growing both from academia and industry, promoting the quick development of virtual marketplaces (VMs) (i.e. e-commerce systems in VR environments). VMs have inherited trust problems, e.g. sellers may advertise a perfect deal but doesn’t deliver the promised service or product at the end. In view of this, we propose a five-sense feedback oriented reputation mechanism (supported by 3D technology and VR) particularly for VMs. The user study confirms that users prefer VMs with our reputation mechanism over those with traditional ones. In our reputation mechanism, five-sense feedback is objective and buyers can use it directly in their reputation evaluation of target sellers. However, for the scenarios where buyers only provide subjective ratings, we apply the approach of subjectivity alignment for reputation computation (SARC), where ratings provided by one buyer can then be aligned (converted) for another buyer according to the two buyers’ subjectivity. Evaluation results indicate that SARC can more accurately model sellers’ reputation than the state-of-the-art approaches.     

QoS in Wireless LAN: A comparison between feedback-based and earliest due-date approaches

The Hybrid Coordination Function is a very powerful mechanism to provide differentiated services in IEEE 802.11 WLANs. In recent years, its adoption in conjunction with centralized scheduling algorithms has lead to many interesting solutions to support services with very sharp delay constraints. Notably, two main approaches have been proposed to face real-time service provisioning, i.e., using the well known earliest due date scheme or feedback control theory. Unfortunately, it is still missing a deep comparison among them. To bridge this gap, we propose herein a novel feedback-based mechanism for infrastructure WLANs and compare it with respect to the most important delay-EDD algorithm, in complex scenarios with video, voice, and best effort flows. Simulation results, obtained using ns-2, demonstrate that (i) both algorithms are able to guarantee upper bounded packet delays, (ii) a more efficient bandwidth usage and a higher network throughput is achieved using the feedback based approach. In particular, it has been shown that the feedback based approach allows a throughput gain ranging from 10% to 20% with respect to delay-EDD.     

CRP: context-based reputation propagation in services composition

For a number of services with similar functionality reputation has been regarded as one of the most important methods to identify good ones from bad ones. However, a composite service, which is composed of multiple component services, obtains only one score (or feedback) after every invocation. In order to compute the reputation of each component service, it is necessary for the composite service to distribute this score to its component services. How to achieve a fair distribution is a challenging issue, as each component service may perform differently in contributing to the success or failure of the composite service. Although several efforts have been made for this problem, they do not consider the context of composition, which makes the distribution unfair. Therefore, in this paper, we propose a fair score distribution framework which combines the context of component services and their runtime performance. We distinguish two aspects contexts of a component service: structure-related importance and community-related replaceability, and adopt graph theory and dominating relationship technique to compute them, respectively. Experimental results show that our approach can achieve a more reasonable and fair score distribution than other existing methods.