Review of threats on trust and reputation models

2014 ◽  
Vol 114 (3) ◽  
pp. 472-483 ◽  
Author(s):  
Po-Ling Sun ◽  
Cheng-Yuan Ku
Keyword(s):  
Web Services ◽  
Defense Mechanisms ◽  
Service Providers ◽  
Service Selection ◽  
Reputation Management ◽  
Security Threats ◽  
Great Loss ◽  
Content Type ◽  
Trust And Reputation ◽  
Web Service Selection

Purpose – As the number of available services increases on the web, it becomes greatly vital in service-oriented computing to discover a trustworthy service for a service composition so as to best-fit business requirements. However, some dishonest service providers may advertise more than what they can offer and cause a great loss to users. In the last few years, trust and reputation management over web service selection mechanism becomes an emerging way of dealing with security deficiencies which are inherent in web services environment. The purpose of this paper is to review the security threats carefully and expect that the results serve as a reference guide for designing the robust trust and reputation management mechanisms. Design/methodology/approach – Based on the published literature, the paper reviews and categorizes the most critical and important security threats that apply to trust and reputation models. Findings – A detailed review and a dedicated taxonomy table are derived. As emphasized earlier, they could serve as the most important guideline for design of trust and reputation mechanisms. Originality/value – The papers work contributes to: first, understand in details what kind of security threats may cause damage to trust and reputation management mechanisms for web services selection; and second, categorize these complex security threats and then assist in planning the defense mechanisms.

QoS-Based Extensible Selection Framework for Web Service

2012 ◽  
Vol 433-440 ◽  
pp. 1762-1765
Author(s):  
Li Qun Cui ◽  
Cui Cui Li
Keyword(s):  
Web Services ◽  
Web Service ◽  
Functional Properties ◽  
Service Providers ◽  
Rapid Development ◽  
Service Selection ◽  
Functional Requirements ◽  
Web Service Selection ◽  
Selection Framework

With the rapid development of Web services technology, more and more Web services emerged in the network. Service consumer attached importance to the functional properties of services, also more and more emphasis on non-functional properties, namely Quality of Service. The Ultimate goal is meet consumer the demand of QoS. Therefore, service providers paid more and more attention to quality of services to meets the needs of users. This takes into account the options to meet the functional requirements and the QoS requirements, and designed a Web service selection framework. At the same time, QoS attributes can be added or deleted the number, so it is an extendible framework. The results show that the framework could select the appropriate service for users.

QoS aware web service selection using orthogonal array learning on fruit fly optimization approach

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Manik Chandra ◽  
Rajdeep Niyogi
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Selection ◽  
Fruit Fly ◽  
Optimization Approach ◽  
Content Type ◽  
Fruit Fly Optimization ◽  
Bee Colony ◽  
Web Service Selection ◽  
Time Latency

Purpose This paper aims to solve the web service selection problem using an efficient meta-heuristic algorithm. The problem of selecting a set of web services from a large-scale service environment (web service repository) while maintaining Quality-of-Service (QoS), is referred to as web service selection (WSS). With the explosive growth of internet services, managing and selecting the proper services (or say web service) has become a pertinent research issue. Design/methodology/approach In this paper, to address WSS problem, the authors propose a new modified fruit fly optimization approach, called orthogonal array-based learning in fruit fly optimizer (OL-FOA). In OL-FOA, they adopt a chaotic map to initialize the population; they add the adaptive DE/best/2mutation operator to improve the exploration capability of the fruit fly approach; and finally, to improve the efficiency of the search process (by reducing the search space), the authors use the orthogonal learning mechanism. Findings To test the efficiency of the proposed approach, a test suite of 2500 web services is chosen from the public repository. To establish the competitiveness of the proposed approach, it compared against four other meta-heuristic approaches (including classical as well as state-of-the-art), namely, fruit fly optimization (FOA), differential evolution (DE), modified artificial bee colony algorithm (mABC) and global-best ABC (GABC). The empirical results show that the proposed approach outperforms its counterparts in terms of response time, latency, availability and reliability. Originality/value In this paper, the authors have developed a population-based novel approach (OL-FOA) for the QoS aware web services selection (WSS). To justify the results, the authors compared against four other meta-heuristic approaches (including classical as well as state-of-the-art), namely, fruit fly optimization (FOA), differential evolution (DE), modified artificial bee colony algorithm (mABC) and global-best ABC (GABC) over the four QoS parameter response time, latency, availability and reliability. The authors found that the approach outperforms overall competitive approaches. To satisfy all objective simultaneously, the authors would like to extend this approach in the frame of multi-objective WSS optimization problem. Further, this is declared that this paper is not submitted to any other journal or under review.

scholarly journals A Cluster-Based Browsing Model For QoS-Aware Web Service Selection

2021 ◽  
Author(s):  
Kian Farsandaj
Keyword(s):  
Web Services ◽  
Web Service ◽  
Clustering Algorithm ◽  
Service Selection ◽  
Functional Requirements ◽  
Analysis Techniques ◽  
Symbolic Data ◽  
Web Service Selection ◽  
The Web

In the last decade, selecting suitable web services based on users’ requirements has become one of the major subjects in the web service domain. Any research works have been done - either based on functional requirements, or focusing more on Quality of Service (QoS) - based selection. We believe that searching is not the only way to implement the selection. Selection could also be done by browsing, or by a combination of searching and browsing. In this thesis, we propose a browsing method based on the Scatter/Gather model, which helps users gain a better understanding of the QoS value distribution of the web services and locate their desired services. Because the Scatter/Gather model uses cluster analysis techniques and web service QoS data is best represented as a vector of intervals, or more generically a vector of symbolic data, we apply for symbolic clustering algorithm and implement different variations of the Scatter/Gather model. Through our experiments on both synthetic and real datasets, we identify the most efficient ( based on the processing time) and effective implementations.

Social Web Services Management

2016 ◽  
pp. 204-220
Author(s):  
Zakaria Maamar ◽  
Noura Faci ◽  
Ejub Kajan ◽  
Emir Ugljanin
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Use ◽  
Service Selection ◽  
High Availability ◽  
Social Web ◽  
Web Service Selection ◽  
Ongoing Work ◽  
The Web ◽  
Selection Of

As part of our ongoing work on social-intensive Web services, also referred to as social Web services, different types of networks that connect them together are developed. These networks include collaboration, substitution, and competition, and permit the addressing of specific issues related to Web service use such as composition, discovery, and high-availability. “Social” is embraced because of the similarities of situations that Web services run into at run time with situations that people experience daily. Indeed, Web services compete, collaborate, and substitute. This is typical to what people do. This chapter sheds light on some criteria that support Web service selection of a certain network to sign up over another. These criteria are driven by the security means that each network deploys to ensure the safety and privacy of its members from potential attacks. When a Web service signs up in a network, it becomes exposed to both the authority of the network and the existing members in the network as well. These two can check and alter the Web service's credentials, which may jeopardize its reputation and correctness levels.

A semantic web services discovery approach based on a mobile agent using metadata

2017 ◽  
Vol 10 (1) ◽  
pp. 12-29 ◽  
Author(s):  
Nadia Ben Seghir ◽  
Okba Kazar ◽  
Khaled Rezeg ◽  
Samir Bourekkache
Keyword(s):  
Web Services ◽  
Semantic Web ◽  
Web Service ◽  
Mobile Agent ◽  
Service Providers ◽  
User Profile ◽  
Search Space ◽  
Semantic Web Services ◽  
Content Type ◽  
The Web

Purpose The success of web services involved the adoption of this technology by different service providers through the web, which increased the number of web services, as a result making their discovery a tedious task. The UDDI standard has been proposed for web service publication and discovery. However, it lacks sufficient semantic description in the content of web services, which makes it difficult to find and compose suitable web services during the analysis, search, and matching processes. In addition, few works on semantic web services discovery take into account the user’s profile. The purpose of this paper is to optimize the web services discovery by reducing the search space and increasing the number of relevant services. Design/methodology/approach The authors propose a new approach for the semantic web services discovery based on the mobile agent, user profile and metadata catalog. In the approach, each user can be described by a profile which is represented in two dimensions: personal dimension and preferences dimension. The description of web service is based on two levels: metadata catalog and WSDL. Findings First, the semantic web services discovery reduces the number of relevant services through the application of matching algorithm “semantic match”. The result of this first matching restricts the search space at the level of UDDI registry, which allows the users to have good results for the “functional match”. Second, the use of mobile agents as a communication entity reduces the traffic on the network and the quantity of exchanged information. Finally, the integration of user profile in the service discovery process facilitates the expression of the user needs and makes intelligible the selected service. Originality/value To the best knowledge of the authors, this is the first attempt at implementing the mobile agent technology with the semantic web service technology.

Quality-of-Service Based Web Service Composition and Execution Framework

2014 ◽  
pp. 74-93
Author(s):  
Bassam Al Shargabi ◽  
Osama Al-haj Hassan ◽  
Alia Sabri ◽  
Asim El Sheikh
Keyword(s):  
Quality Of Service ◽  
Web Services ◽  
Web Service ◽  
Service Composition ◽  
Service Selection ◽  
Web Service Composition ◽  
Web Service Selection ◽  
Selection Decisions ◽  
Uddi Registry

Software is gradually becoming more built by composing web services to support enterprise applications integration; thus, making the process of composing web services a significant topic. The Quality of Service (QoS) in web service composition plays a crucial role. As such, it is important to guarantee, monitor, and enforce QoS and ability to handle failures during execution. Therefore, an urgent need exists for a dynamic Web Service Composition and Execution (WSCE) framework based on QoS constraints. A WSCE broker is designed to maintain the following function: intelligent web service selection decisions based on local QoS for individual web service or global QoS based selection for composed web services, execution tracking, and adaptation. A QoS certifier controlled by the UDDI registry is proposed to verify the claimed QoS attributes. The authors evaluate the composition plan along with performance time analysis.

Predicting change impact in Web service ecosystems

2014 ◽  
Vol 10 (3) ◽  
pp. 275-290 ◽  
Author(s):  
Hoa Khanh Dam
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Providers ◽  
Content Type ◽  
History Of ◽  
Change Impact ◽  
Service Ecosystem ◽  
Traditional Approaches ◽  
Business Requirements ◽  
The Impact

Purpose – The paper aims to address the issue of Web service providers facing a major issue of estimating the potential effects of changing a Web service to other services, especially in large ecosystems of Web services which have become more common nowadays. Web service providers make constant changes to their Web services to meet the ever-changing business requirements. Design/methodology/approach – The paper proposes an approach to predict change impact by mining a version history of a Web service ecosystem. The proposed approach extracts patterns of Web services that have been changed together from the version history by using association rule data mining techniques. The approach then uses this knowledge of co-changed patterns for predicting the impact of future changes based on the assumption that Web services which have been changed together frequently in the past will likely be changed together in future. Findings – An empirical validation based on the Amazon’s ecosystem of 46 Web services indicates the effectiveness of the proposed approach. After an initial change, the proposed approach can correctly predict up to 25 per cent of further Web services to be changed with the precision of up to 82 per cent. Originality/value – Traditional approaches to predict change impact in Web services tend to rely on having a dependency graph between Web services. However, in practice, building and maintaining inter-service dependencies that capture the precise semantics and behaviours of the Web services are challenging and costly. The proposed approach offers a novel alternative which only requires mining the existing version history of Web services.

RESEARCH ON TRUST PREDICTION MODEL FOR SELECTING WEB SERVICES BASED ON MULTIPLE DECISION FACTORS

2011 ◽  
Vol 21 (08) ◽  
pp. 1075-1096 ◽  
Author(s):  
XIAOYONG LI ◽  
FENG ZHOU ◽  
XUDONG YANG
Keyword(s):  
Web Services ◽  
Prediction Model ◽  
Service Providers ◽  
Service Selection ◽  
Weighted Averaging ◽  
Widespread Application ◽  
Trust Value ◽  
Decision Factors ◽  
Trust Prediction ◽  
Proposed Model

With the widespread application of web services, trust-based service selection has become a significant requirement from a requester's point of view, and trust prediction mechanism has become a determining factor for any given service's success. But the dynamic nature of trust creates the biggest challenge in measuring a trust value and make trust predictions. In this paper, a new trust prediction model is proposed based on multiple decision factors. Firstly, the proposed model integrates multiple complementary decision factors to reflect complexity and uncertainty of trust relationship. In addition to including traditional experience-based trust factor and feedback-based trust factor, this model innovatively integrates QoS-based trust factor into global trust evaluation, which makes the model have a better rationality and a higher practicability than the existing approaches. Meanwhile, the proposed model applies the theory of OWA (Ordered Weighted Averaging) operator to assign the classification weights to these decision factors, which makes the model exhibit a strong adaptability in handling various dynamic behaviors of service providers. Simulation results show that, compared to the existing approaches, the proposed model has remarkable enhancements in the accuracy of trust prediction.

A structural-semantic web service selection approach to improve retrievability of web services

2016 ◽  
Vol 20 (6) ◽  
pp. 1319-1344 ◽  
Author(s):  
Martin Garriga ◽  
Alan De Renzis ◽  
Ignacio Lizarralde ◽  
Andres Flores ◽  
Cristian Mateos ◽  
...  
Keyword(s):  
Web Services ◽  
Semantic Web ◽  
Web Service ◽  
Service Selection ◽  
Semantic Web Service ◽  
Web Service Selection ◽  
Selection Approach

scholarly journals An Efficient Qos-Based Ranking Model for Web Service Selection with Consideration \of User's Requirement

2021 ◽  
Author(s):  
Anita Mohebi
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Discovery ◽  
High Efficiency ◽  
Service Selection ◽  
Application Development ◽  
Web Service Selection ◽  
Business Application ◽  
Service Oriented

The power of Web services to address the incompatibility issue of standalone systems, has led them to play a major role in business application development. Adopting an efficient and effective method to locate and select desired services among thousands of available candidates is an important task in the service-oriented computing. As part of a Web service discovery system, the ranking process enables users to locate their desired services more effectively. Many of the existing approaches ignore the role of user's requirements which is an important factor in the ranking process. In this thesis we enhance a vector-based ranking method by considering user's requirements. The vector-based model is chosen because of its simplicity and high efficiency. We evaluate all Web services in terms of their similarity degrees to the optimal or the best available values of each quality attribute, and penalize the services that fail to meet the user's requirements. Through our extensive experiments using real datasets, we compare the improved algorithm with other approaches to evaluate it in terms of efficiency (the execution time to return the result) and quality of the results (accuracy). Cherie Ding

Sign in / Sign up

Export Citation Format

Share Document