Grid service discovery with rough sets

Copyright [2008] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.The computational grid is evolving as a service-oriented computing infrastructure that facilitates resource sharing and large-scale problem solving over the Internet. Service discovery becomes an issue of vital importance in utilising grid facilities. This paper presents ROSSE, a Rough sets based search engine for grid service discovery. Building on Rough sets theory, ROSSE is novel in its capability to deal with uncertainty of properties when matching services. In this way, ROSSE can discover the services that are most relevant to a service query from a functional point of view. Since functionally matched services may have distinct non-functional properties related to Quality of Service (QoS), ROSSE introduces a QoS model to further filter matched services with their QoS values to maximise user satisfaction in service discovery. ROSSE is evaluated in terms of its accuracy and efficiency in discovery of computing services

Web Service Discovery Based on Past User Experience

Web service technology provides a way for simplifying interoperability among different organizations. A piece of functionality available as a web service can be involved in a new business process. Given the steadily growing number of available web services, it is hard for developers to find services appropriate for their needs. The main research efforts in this area are oriented on developing a mechanism for semantic web service description and matching. In this paper, we present an alternative approach for supporting users in web service discovery. Our system implements the implicit culture approach for recommending web services to developers based on the history of decisions made by other developers with similar needs. We explain the main ideas underlying our approach and report on experimental results

QoS based Web Service Selection and Multi-Criteria Decision Making Methods

With the continuing proliferation of web services offering similar efficacies, around the globe, it has become a challenge for a user to select the best web service. In literature, this challenge is exhibited as a 0-1 knapsack problem of multiple dimensions and multiple choices, known as an NP-hard problem. Multi-Criteria Decision Making (MCDM) method is one of the ways which suits this problem and helps the users to select the best service based on his/her preferences. In this regard, this paper assists the researchers in two conducts: Firstly, to witness the performance of different MCDM methods for large number of alternatives and attributes. Secondly, to perceive the possible deviation in the ranking obtained from these methods. For carrying out the experimental evaluation, in this paper, five different well-known MCDM methods have been implemented and compared over two different scenarios of 50 as well as 100 web services, where their ranking is defined on an account of several Quality of Service (QoS) parameters. Additionally, a Spearman’s Rank Correlation Coefficient has been calculated for different pairs of MCDM methods in order to provide a clear depiction of MCDM methods showing the least deviation in their ranking. The experimental results comfort web service users in conquering an appropriate decision on the selection of suitable service

INVESTIGATION OF THE ROLE OF SERVICE LEVEL AGREEMENTS IN WEB SERVICE QUALITY

Context/Background: Use of Service Level Agreements (SLAs) is crucial to provide the value added services to consumers to achieve their requirements successfully. SLAs also ensure the expected Quality of Service to consumers. Aim: This study investigates how efficient structural representation and management of SLAs can help to ensure the Quality of Service (QoS) in Web services during Web service composition. Method: Existing specifications and structures for SLAs for Web services do not fully formalize and provide support for different automatic and dynamic behavioral aspects needed for QoS calculation. This study addresses the issues on how to formalize and document the structures of SLAs for better service utilization and improved QoS results. The Service Oriented Architecture (SOA) is extended in this study with addition of an SLAAgent, which helps to automate the QoS calculation using Fuzzy Inference Systems, service discovery, service selection, SLA monitoring and management during service composition with the help of structured SLA documents. Results: The proposed framework improves the ways of how to structure, manage and monitor SLAs during Web service composition to achieve the better Quality of Service effectively and efficiently. Conclusions: To deal with different types of computational requirements the automation of SLAs is a challenge during Web service composition. This study shows the significance of the SLAs for better QoS during composition of services in SOA

Methods and algorithms for service selection and recommendation (preference and aggregation based)

In order for service users to get the best service that meets their requirements, they prefer to personalize their non-functional attributes, such as reliability and price. However, the personalization makes it challenging because service providers have to deal with conflicting non-functional attributes when selecting services for users. In addition, users may sometimes want to explicitly specify their trade-offs among non-functional attributes to make their preferences known to service providers. Typically, users\u27 service search requests with conflicting non-functional attributes may result in a ranked list of services that partially meet their needs. When this happens, it is natural for users to submit other similar requests, with varying preferences on non-functional attributes, in an attempt to find services that fully meet their needs. This situation produces a challenge for the users to choose an optimal service based on their preferences, from the multiple ranked lists that partially satisfy their request. Existing memory-based collaborative filtering (CF) service recommendation methods that employ this recommendation technique usually depend on non-functional attribute values obtained at service invocation to compute the similarity between users or items, and also to predict missing non-functional attributes. However, this approach is not sufficient because the non-functional attribute values of invoked services may not necessarily satisfy their personalized preferences. The main contributions of this work are threefold. First, a novel service selection method, which is based on fuzzy logic, that considers users\u27 personalized preferences and their trade-offs on non-functional attributes during service selection is presented. Second, a method that aggregates multiple ranked lists of services into a single aggregated ranked list, where top ranked services are selected for the user is also presented. Two algorithms were proposed: 1) Rank Aggregation for Complete Lists (RACoL), that aggregates complete ranked lists and 2) Rank Aggregation for Incomplete Lists (RAIL) to aggregate incomplete ranked lists. Finally, a CF-based service recommendation method that considers users\u27 personalized preference on non-functional attributes if proposed. Examples using real-world services are presented to evaluate the proposed methods and experiments are carried out to validate their performance --Abstract, page iii

Interval Neutrosophic Sets and Logic: Theory and Applications in Computing

A neutrosophic set is a part of neutrosophy that studies the origin, nature, and scope of neutralities, as well as their interactions with different ideational spectra. The neutrosophic set is a powerful general formal framework that has been recently proposed. However, the neutrosophic set needs to be specified from a technical point of view. Here, we define the set-theoretic operators on an instance of a neutrosophic set, and call it an Interval Neutrosophic Set (INS). We prove various properties of INS, which are connected to operations and relations over INS. We also introduce a new logic system based on interval neutrosophic sets. We study the interval neutrosophic propositional calculus and interval neutrosophic predicate calculus. We also create a neutrosophic logic inference system based on interval neutrosophic logic. Under the framework of the interval neutrosophic set, we propose a data model based on the special case of the interval neutrosophic sets called Neutrosophic Data Model. This data model is the extension of fuzzy data model and paraconsistent data model. We generalize the set-theoretic operators and relation-theoretic operators of fuzzy relations and paraconsistent relations to neutrosophic relations. We propose the generalized SQL query constructs and tuple-relational calculus for Neutrosophic Data Model. We also design an architecture of Semantic Web Services agent based on the interval neutrosophic logic and do the simulation study