A Review on Framework and Quality of Service Based Web Services Discovery

Selection of Web services (WSs) is one of the most important steps in the application of different types of WSs such as WS composition systems and the Universal Description, Discovery, and Integration (UDDI) registries. The more available these WSs on the Internet are, the wider the number of these services whose functions match the various service requests is. Selecting WSs with higher quality largely depends on the quality of service (QoS) since it plays a significant role in selecting such services. In achieving this selection of the best WSs, the potential WSs are ranked according to the user’s necessities on service quality. In many cases, the value of QoS ontology is realized by its support for nonfunctional features of WSs. This ontology is also capable of providing solutions to the interoperability of QoS description. Moreover, based on the QoS ontology, it becomes more possible to develop a framework of semantic WS discovery. The framework enhances the automatic discovery of WSs and can improve the users’ efficiency in finding the best web services. Thus, Web Services are software functionalities publish and accessible through the Internet. Different protocols and web mechanism have been defined to access these Services

Modeling and Selection of Software Service Variants

Providers and consumers have to deal with variants, meaning alternative instances of a service?s design, implementation, deployment, or operation, when developing or delivering software services. This work presents service feature modeling to deal with associated challenges, comprising a language to represent software service variants and a set of methods for modeling and subsequent variant selection. This work?s evaluation includes a POC implementation and two real-life use cases

Towards an Effective QoS Prediction of Web Services using Context-Aware Dynamic Bayesian Network Model

The functionally equivalent web services (WSs) with different quality of service (QoS) leads to WS discovery models to identify the optimal WS. Due to the unpredictable network connections and user environment, the predicted values of the QoS are likely to fluctuate. The proposed Context-Aware Bayesian Network (CABN) system overcomes these limitations by incorporating the contextual factors in user, server, and environmental perspective. In this paper, three components are introduced for personalized QoS prediction. First, the CABN incorporates the pre-clustering model and reduces the searching space for QoS prediction. Second, the CABN confronts with the multi-constraint problem while considering the multi-dimensional QoS parameters of similar QoS data in WS discovery. Third, the CABN sends the normalized QoS value of records in similar as well as neighbor clusters as inputs to the Dynamic Bayesian Network and improves the prediction accuracy. The experimental results prove that the proposed CABN achieves better WS-Discovery than the existing work within a reasonable time

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

Full Solution Indexing and Efficient Compressed Graph Representation for Web Service Composition

Service-oriented computing enhances business scalability and flexibility; providers who expect to benefit from it may bring explosive growth of web services. Searching an optimal composition solution with both functional and non-functional requirements is a computationally demanding problem: the time and space requirements may be infeasible due to the high number of available services. In this thesis, we study QoS-aware service composition problems which satisfy functional requirements as well as non-functional requirements. We use optimization algorithms to enhance accuracy of our searching algorithms. In the first approach, we propose a database-based approach to search a service composition solution. Current in-memory methods are limited by expensive and volatile physical memory, to deal with this problem, we want to use the large space available in relational database on persistence disk. In our database-based approach, all possible service combinations are generated beforehand and stored in a relational database. When a user request comes, SQL queries are composed to search in the database and K best solutions are returned. We test the performance of the proposed approach with a service challenge data set; experiment results demonstrate that this approach can always successfully find top-K valid solutions.We offer three main contributions in this approach. First, we overcome the disadvantages of in-memory composition algorithms, such as volatile and expensive, and provide a solution suitable to cloud environments. Second, we fetch top-K solutions in case the optimal solution is not available as backup solutions to the user. Third, compared with other pre-computing composition methods, we use a single SQL query: there is no need to eliminate spurious services iteratively. Then, we propose the application of a skyline operator to reduce the search space and improve the scalability. Skyline analysis returns all of the elements that are not dominated by another element. We use skyline analysis to find a set of candidate services referred to as "skyline services", therefore, less competitive services are reduced. This allows us to find a solution for a large composition problem with less storage and increased speed. In reality, different users may have same requests, we are motivated to pick some popular requests and generate paths for fast delivery. These paths are stored in a separate table of the relational database. When a user request comes, we first search to find a nearly ready-made solution. Only as a last resort do we search the table with whole paths to find a solution. Finally, to deal with the problem that the search space may explore, we apply a compressed data structure to represent the service composition graph. The goal is to allow algorithms running in in-memory over larger graphs. In this approach, we use compact K2-trees to represent the service composition graph. When a user request comes, we search the K2-tree for a satisfactory solution. We use an array to store values in the last level of the compact tree, which represents relationships between services and concepts. In our algorithms, we find services' inputs (resp. outputs) by locating elements in this array directly, therefore, decompressing the graph is unnecessary. To the best of our knowledge, our work is the first attempt to consider compact structure in solving web service composition problems. Experiment results demonstrate that this approach takes less space and has good scalability when handling a large number of web services. We provide different approaches to search a solution for the user. If the user want to find an optimal solution with fewer services, he may use the database-based approach to search for a solution. If the user want to get a solution in a short time, he may choose the in-memory approach

QoS Based Service Selection and Provisioning in Cloud Computing

Cloud computing has become a disruptive technology which has seen significant growth among consumers of various sizes. Consumers can now have access to seemingly unlimited computing resources over the Internet without making significant investment in computing infrastructure. Consequently, this trend has seen a rise in the number of cloud computing providers. Most of these providers offer various services to consumers, which are commonly classified into three main types of service provisioning models such as, Infrastructure as a Service (IaaS), Platform as a Service (PaaS) and Software as a Service (SaaS). Cloud computing providers offer multiple services to consumers using one or more of models. However, the large number of services offered by cloud providers introduces a new set of problems for the consumers. Consumers have to choose from a wide range of services and providers such that they meet consumers’ requirements. The problem is further complicated as a large number of consumers do not necessarily have adequate knowledge of cloud services’ concepts and terminologies. To add to the complexity, there is no standard benchmark for cloud services. Therefore cloud providers can package the same cloud services in different ways for consumers. Furthermore, there are no standard service level agreements defined for cloud services selection. Each cloud provider has different service level agreements which make consumer selection process more cumbersome. This research aims to bridge this gap by proposing and developing new methods and techniques that take into account different cloud services and providers as well as quality of services attributes that make it easier for consumers to rank and select cloud services which are tailored to their requirements. This thesis makes various contributions to the current state of knowledge in the cloud service selection and provisioning area. It proposes a new model in order to systematically represent the quality of service (QoS) attributes of cloud services that cover both technical and non-technical aspects of cloud computing. The new model succinctly represents QoS attributes which cloud consumers can easily use and understand when selecting cloud services. The thesis also proposes a new framework for cloud service selection which improves and simplifies the cloud service selection process. It takes into account the level of user’s knowledge of cloud computing technologies. The major benefit is to simplify the selection process for ‘Beginner’ cloud service consumers (who have little knowledge of cloud computing) by presenting the main QoS attributes to them with brief explanations. The other benefit is to give an Intermediate/Expert cloud service consumers an opportunity to go through more details of QoS sub-parameters. Unlike existing approaches, the ii framework developed in this thesis also ensures the credibility of the service selection by utilizing information from three different sources, including, information from cloud service providers’ websites, online monitoring tools and users’ reviews of cloud services. Furthermore, the framework integrates Service Level Agreement (SLA) which is an integral part of cloud services as it is important for the consumer to be able to view it as part of their decision making process. The framework is validated by developing a prototype tool using Python, MongoDB and Amazon AWS EC2 server. The tool is then evaluated using various real life scenarios to rank cloud service providers and also by comparing it against existing tools. The results show that the proposed tool outperforms existing tools using a set of criteria such as operability, mode of data selection and number of cloud providers among others for ranking and selecting cloud services

Modeling and Selection of Software Service Variants

Providers and consumers have to deal with variants of software services, which are alternative instances of a services design, implementation, deployment, or operation. This work develops the service feature modeling language to represent software service variants and a suite of methods to select variants for development or delivery. An evaluation describes the systems implemented to make use of service feature modeling and its application to two real-world use cases

Scalable Automatic Service Composition using Genetic Algorithms

A composition of simple web services, each dedicated to performing a specific sub- task involved, proves to be a more competitive solution than an equivalent atomic web service for a complex requirement comprised of several sub-tasks. Composite services have been extensively researched and perfected in many aspects for over two decades, owing to benefits such as component re-usability, broader options for composition requesters, and the liberty to specialize for component providers. However, most studies in this field must acknowledge that each web service has a limited context in which it can successfully perform its tasks, the boundaries defined by the internal constraints imposed on the service by its providers. The restricted context-spaces of all such component services define the contextual boundaries of the composite service as a whole when used in a composition, making internal constraints an essential factor in composite service functionality. Due to their limited exposure, no systems have yet been proposed on the large-scale solution repository to cater to the specific verification of internal constraints imposed on components of a composite service. In this thesis, we propose a scalable automatic service composition capable of not only automatically constructing context-aware composite web services with internal constraints positioned for optimal resource utilization but also validating the generated compositions on a large-scale solution repository using the General Intensional Programming System (GIPSY) as a time- and cost-efficient simulation/execution environment

Quality-of-Service-Aware Service Selection in Mobile Environments

The last decade is characterized by the rise of mobile technologies (UMTS, LTE, WLAN, Bluetooth, SMS, etc.) and devices (notebooks, tablets, mobile phones, smart watches, etc.). In this rise, mobiles phones have played a crucial role because they paved the way for mobile pervasion among the public. In addition, this development has also led to a rapid growth of the mobile service/application market (Statista 2017b). As a consequence, users of mobile devices nowadays find themselves in a mobile environment, with (almost) unlimited access to information and services from anywhere through the Internet, and can connect to other people at any time (cf. Deng et al. 2016; Newman 2015). Additionally, modern mobile devices offer the opportunity to select the services or information that best fit to a user’s current context. In this regard, mobile information services support users in retrieving context and non-context information, such as about the current traffic situation, public transport options, and flight connections, as well as about real-world entities, such as sights, museums, and restaurants (cf. Deng et al. 2016; Heinrich and Lewerenz 2015; Ventola 2014). An example of the application of mobile information services is several users planning a joint city day trip. Here, the users could utilize information retrieved about real-world entities for their planning. Such a trip constitutes a process with multiple participating users and may encompass actions such as visiting a museum and having lunch. For each action, mobile information services (e.g., Yelp, TripAdvisor, Google Places) can help locate available alternatives that differ only in attributes such as price, average length of stay (i.e., duration), or recommendations published by previous visitors. In addition, context information (e.g., business hours, distance) can be used to more effectively support the users in their decisions. Moreover, because multiple users are participating in the same trip, some users want to or must conduct certain actions together. However, decision-makers (e.g., mobile users) attempting to determine the optimal solution for such processes – meaning the best alternative for each action and each participating user – are confronted with several challenges, as shown by means of the city trip example: First, each user most likely has his or her own preferences and requirements regarding attributes such as price and duration, which all must be considered. Furthermore, for each action of the day trip, a huge number of alternatives probably exist. Thus, users might face difficulties selecting the optimal alternatives because of an information overload problem (Zhang et al. 2009). Second, taking multiple users into account may require the coordination of their actions because of potential dependencies among different users’ tours, which, for example, is the case when users prefer to conduct certain actions together. This turns the almost sophisticated decision problem at hand into a problem of high complexity. The problem complexity is increased further when considering context information, because this causes dependencies among different actions of a user that must be taken into account. For instance, the distance to cover by a user to reach a certain restaurant depends on the location of the previously visited museum. In conclusion, it might be impossible for a user to determine an optimal city trip tour for all users, making decision support by an information system necessary. Because the available alternatives for each action of the process can be denoted as (information) service objects (cf. Dannewitz et al. 2008; Heinrich and Lewerenz 2015; Hinkelmann et al. 2013), the decision problem at hand is a Quality-of-Service (QoS)-aware service selection problem. This thesis proposes novel concepts and optimization approaches for QoS-aware service selection regarding processes with multiple users and context information, focusing on scenarios in mobile environments. In this respect, the developed multi user context-aware service selection approaches are able to deal with dependencies among different users’ service compositions, which result from the consideration of multiple users, as well as dependencies within a user’s service composition, which result from the consideration of context information. Consequently, these approaches provide suitable support for decision-makers, such as mobile users

IDEAS-1997-2021-Final-Programs

This document records the final program for each of the 26 meetings of the International Database and Engineering Application Symposium from 1997 through 2021. These meetings were organized in various locations on three continents. Most of the papers published during these years are in the digital libraries of IEEE(1997-2007) or ACM(2008-2021)