Web Service Composition Techniques Research Articles

Evolutionary Computing based Web Service Composition Technique for Scheduling of Workload under Cloud Environment

Objectives: The objective of this model is to design a technique to schedule the workload for the computation of web services in the heterogeneous cloud environment. As the Web Service Composition (WSC) for the execution of scientific workload in a heterogeneous cloud computing environment is a challenging task. Modern workload requires dynamic resource provisioning technique as there exist parallelization among sub-tasks and different task demands different Quality of Service (QoS) requirement. Methods: This study presents an Evolutionary Computing based Web Service Composition (EC-WSC) technique to execute a large-scale scientific workload in a heterogeneous cloud environment. A multi-objective metric for improving energy efficiency and resource utilization is modelled. Then, an improved searching mechanism for the dragonfly evolutionary computing algorithm is modelled. Findings: Experiment outcomes show EC-WSC model attains superior performance in execution time performance analysis and energy efficiency performance analysis when compared with existing resource provisioning models of workload service composition such as Deadline and Budget-Aware Workflow Scheduling (DBAWS)(1), Evolutionary Computing Multi-objective optimization for Hybrid Clouds (EC-MOH)(2), Web Service Composition (WSC)(3), and Evolutionary Multi-Objective Optimization for clouds (EMOC)(4) in terms of heterogeneous computing, workload size, multi-objective optimization, QoS metric, and optimization strategy. Our model EC-WSC has proved to be more efficient in terms of energy efficiency by a reduction of 52.13% and also reduction in execution time by 71% when compared with the WSC(3) existing Web Service Composition model. Novelty: Existing resource provisioning predominantly focused on reducing computation cost and time; however, induces task execution latency and energy overhead. However, EC-WSC is modelled to utilize resources more efficiently and meet task QoS requirements by assuring energy minimization constraints. Keywords: Cloud Computing; Heterogeneous Computing Environment; Multiobjective optimization problem; Resource Provisioning; Workload Scheduling

Web Service Composition for Executing Workflows: Open Issues, Challenges, Survey and Future Directions

Cloud computing has nowadays become a dominant technology to reduce the computation cost by elastically providing resources to users on a pay-per-use basis. More and more data intensive business and scientific web service applications represented by workflows have been moved or are in active transition to cloud platforms. Therefore, efficient web service compositing for executing workflow are in high demand. This paper conduct extensive survey of various existing web service composition technique for executing workflow. From survey it is identified very limited work is done for minimizing workflow execution processing time with minimal energy dissipation considering task deadline requirement under heterogeneous cloud computational environment. This paper identifies open issues and future challenges and presented possible solution in building efficient web service composition for executing workflows under heterogeneous cloud computational environment

Grenade-Cauchy operator integrated artificial bee colony optimisation for QoS-based reliable web service composition

Majority of the dynamic web service composition techniques in the literature addresses the problem of web service composition through the perspectives of quality of service (QoS) or transactional characteristics. Grenade with Cauchy operator integrated artificial bee colony optimisation (GCO-ABC) algorithm is proposed as an attempt of developing a dynamic service composition involved computation methodology that depends on the integration of transactional and QoS-based properties of web services. GCO-ABC algorithm is applied on the work flow sequence of web service composition developed as a constrained directed acyclic graph for determining the near optimal solution with efficacy and it is also predominant in comparison to the traditional ant colony optimisation algorithm (ACOM) and its variant improved ant colony optimisation algorithm (IACOM). The determined results investigated through empirical and simulation means infer that the proposed scheme is not only efficient but also capable of approximating the searching solutions into a much more optimal candidate solution.

Improved Cosine Similarity-based Artificial Bee Colony Optimization scheme for reactive and dynamic service composition

Reliable and dynamic composition of web services is considered as essential for ensuring continuous services to the users since they are responsible for integrating varsity of applications in spite of their independency. The significant development in web services domain in the last two decades enable the option of devising novel service composition and service selection schemes for optimal performance and success rate of dynamic web service composition. Majority of the research works proposed for dynamic composition of web services was confirmed to be formulated using the characteristics of Quality of Service (QoS) or Transactional features of workflow. Improved Cosine Similarity-based Artificial Bee Colony Optimization Scheme for Web Service Composition (ICS-ABCO-WSC) is proposed for integrating the characteristics of QoS and transactional features for determining optimal candidate service solution from the workflow modeled graph generated during reactive service composition. ICS-ABCO-WSC is proved to enhance the rate of exploitation and exploration by incorporating opposition learning in employee bee phase and, combinatorial search strategical equations and enhance rate factor in the employee and onlooker bee phase respectively. The success rate and optimality index derived using experimental investigation of ICS-ABCO scheme is proved to be 26% and 32% excellent to compared baseline graph-modeled web service composition techniques. This improvement is realized in ICS-ABCO-WSC due to its potential of enhancing the precision and acceleration rate of converging solution achieved in Artificial Bee Colony Optimization technique.

Energy-Efficient Composition of Configurable Internet of Things Services

Along with the adaptation of Internet of Things (IoT) to support various industrial applications, the cooperation and coordination of smart things is a promising strategy for satisfying requirements that are beyond the capacity of any single smart thing. To address this challenge, a two-tier IoT service framework is proposed, where the functionalities provided by smart things are encapsulated into IoT services, which are categorized into service classes. The service network is constructed by considering the invocation possibility between service classes, and service class chains are generated using traditional Web service composition techniques, where the functional specification of certain requirements is considered. Considering factors, such as spatial and temporal-constraints, energy efficiency, and the configurability of IoT services, selecting IoT services for the instantiation of service classes contained in chains is reduced to a multiobjective and multiconstrained optimization problem. Heuristic algorithms, such as the genetic algorithm (GA), ant colony optimization (ACO) and particle swarm optimization (PSO), are adopted to search for optimal IoT service compositions. An experimental evaluation shows that PSO performs better than the GA and ACO in searching for approximately optimal IoT service compositions and reduces the energy consumption, thus prolonging the network lifetime.

Fruit Fly Optimization Algorithm for Network-Aware Web Service Composition in the Cloud

Service Oriented Computing (SOC) provides a framework for the realization of loosely coupled service oriented applications. Web services are central to the concept of SOC. Currently, research into how web services can be composed to yield QoS optimal composite service has gathered significant attention. However, the number and spread of web services across the cloud data centers has increased, thereby increasing the impact of the network on composite service performance experienced by the user. Recently, QoS-based web service composition techniques focus on optimizing web service QoS attributes such as cost, response time, execution time, etc. In doing so, existing approaches do not separate QoS of the network from web service QoS during service composition. In this paper, we propose a network-aware service composition approach which separates QoS of the network from QoS of web services in the Cloud. Consequently, our approach searches for composite services that are not only QoS-optimal but also have optimal QoS of the network. Our approach consists of a network model which estimates the QoS of the network in the form of network latency between services on the cloud. It also consists of a service composition technique based on fruit fly optimization algorithm which leverages the network model to search for low latency compositions without compromising service QoS levels. The approach is discussed and the results of evaluation are presented. The results indicate that the proposed approach is competitive in finding QoS optimal and low latency solutions when compared to recent techniques.

ORCHESTRATION OF WEB SERVICES BASED ON TQOS USING USER AND WEB SERVICES AGENT

A Web service is a collection of open protocols and standards for exchanging data between applications and system. Web services are platform independent and in today’s internet, web services play a vital role, single service is not sufficient to respond to user’s goal. To achieve the specific goal of the user, we need to combine one or more web services through the web service composition technique. Now a day’s tools and environment that facilitates the composition of atomic web services into more complex web process is required. Here, to orchestrate the web service, first atomic web service among group of services is selected that must fulfil the user’s requirement, transactional and Quality of Service (QoS) characteristics. Traditionally QoS based web service composition does not consider the transactional constraints during orchestration process. Therefore this paper deals with the issue of selecting and composing web services using user agent and web services agent not only according to their user requirement but also to their transactional and QoS (TQoS) properties.

Web Services Composition Methods and Techniques: A Review

Web Services Composition Methods and Techniques: A Review

Research on Context-aware Web Service Composition based on the Fluent Calculus

With the exponential growth in available web services and diversity of user needs, automatic web service selection and composition techniques have attracted the attention of many researchers. This paper presents a fluent calculus-based, context-aware web service composition model. The model uses an artificial intelligence (AI) planning-based web service composition technique, which translates web service composition problems into AI planning problems, and then achieves target goals by acquisition and reasoning using existing environmental knowledge. We first construct a model for service, service context, and service composition on the basis of the fluent calculus theory. Then, we extend the basic axioms of the fluent calculus (initial state and state update axioms) to describe context information, an approach that endows context-aware ability to the fluent calculus-based web service composition. Furthermore, we implement a fluent calculus-based, context-aware web service composition model using a fluent calculus executor or FLUX in a digital tourism service scenario. The experimental results show that the proposed model has context-aware capability and exhibits better performance in service composition.

Security conscious AI‐planning‐based composition of semantic web services

PurposeAutomated composition of semantic web services has become one of the recent critical issues in today's web environment. Despite the importance of artificial intelligence (AI)‐planning techniques for web service composition, previous works in that area do not address security issues, which is the focus of this paper. The purpose of this paper is to propose an approach to achieve security conscious composition of semantic web services.Design/methodology/approachThe proposed approach called security conscious composition of semantic web services (SCAIMO) is based on the prior work, i.e. AIMO. The AIMO is an effective approach for web service discovery and composition based on AI‐planning, web service modeling ontology (WSMO), and description logic (DL). In this paper, definitions of secure matchmaking and web service composition are formalized based on DLs. Moreover, security capabilities and constraint types in the proposed SCAIMO framework are presented.FindingsThis paper proposes a secure task matchmaker which is responsible for matching security conscious tasks with operators and methods based on WSMO and DL to support the proposed SCAIMO framework. In addition, the paper implements and evaluates the SCAIMO using a test case and the result shows that the approach can provide an applicable solution.Originality/valueThe key contribution of this paper encompasses the new framework to support security capabilities and constraints during composition of semantic web services as well as the new secure task matchmaker.

Selective Querying for Adapting Web Service Compositions Using the Value of Changed Information

Web service composition (WSC) techniques assume that the parameters used to model the environment remain static and accurate throughout the composition's execution. However, WSCs often operate in environments where the parameters of its component services are volatile. To remain optimal, WSCs must adapt to these changes. Adaptation requires up-to-date knowledge about the revised parameters of each of the services. One way of obtaining this knowledge is to query services for their revised parameters. Querying services for their parameters is time-consuming and expensive. We must therefore carefully manage how queries are conducted. Specifically, an adaptive WSC must know when to query for revised information, and from which service(s) to obtain information. We present a method to selectively query services using the value of changed information (VOC). VOC measures the value of the change that revised information may potentially introduce to the composition. We reduce the complexity of computing the VOC, first by anticipating values of the service parameters that do not change the WSC, and second by using parameter expiration times obtained from predefined service-level agreements. Using two scenarios, we illustrate our approach and demonstrate the computational savings theoretically and experimentally.

Semantic Web Service Composition

The research community of Web, presently is working to generate its next generation i.e. SemanticWeb. They are moving towards automation of the retrieval and processing of web contents. The systemsbased on the semantic web require performing various processes like discovery, selection, composition, orchestration, monitoring etc. on services provided by it for satisfying client needs. In this paper, we will be concentrating on semantic web service composition techniques. The work deals with exploring different type of composition techniques, categorization of them, and comparing them based on some of their properties like process, reasoners & languages involved, interface etc.

Context optimization of AI planning for semantic Web services composition

Web services composition techniques are gaining momentum as the opportunity to establish reusable and versatile inter-operability applications. Many researchers propose their composition approach based on planning techniques. We propose our context aware planning method which comprises global planning and local optimization based on context information. The major technical contributions of this paper are: (1) We propose an ontology-based framework for the context-aware composition of Web services. Context model, which are structured based on OWL-S, captures the Service-related, Environment-related, and User-related context and can be used in an unambiguous, machine interpretable form. (2) We propose context-aware plan architecture and thus is more scalability and flexibility for the planning process, and thereby improving the efficiency and precision. (3) We propose a hybrid approach to build a plan corresponding to a context-aware service composition, based on global planning and local optimization, considering both the usability and adoption. We test our approach on a simple, yet realistic example, and the preliminary results demonstrate that our implementation provides a practical solution.

Classification of the state-of-the-art dynamic web services composition techniques

Dynamic web service composition can serve applications or users on an on-demand basis. With dynamic composition, the application's capabilities can be extended at runtime so that theoretically an unlimited number of new services can be created from a limited set of service components, thus making applications no longer restricted to the original set of operations specified and envisioned at design and/or compile time. Moreover, dynamic composition is the only means to adapt the behaviour of running components in highly available applications such as, banking and telecommunication systems where services cannot be brought offline to upgrade or remove obsolete services. In this paper, we present a novel classification of the current state-of-the-art dynamic web services composition techniques with attention to the capabilities and limitations of the underlying approaches. The proposed taxonomy of these techniques is derived based on a comprehensive survey of what has been done so far in dynamic web service composition. Finally, we summarise our findings and present a vision for future research work in this area.

동적 웹 서비스 조합을 위한 시멘틱 웹 서비스 발견 및 실행 기법

최근에 동적으로, 즉 요구가 있는 즉시 서비스들을 조합하는 동적 웹 서비스 조합은 가장 큰 관심사 중 하나이다. 지금까지 동적 웹 서비스조합에 관한 많은 연구들이 수행되어졌는데 주로 사람이 개입된 반자동 대화식 조합 기법들이 제안되었다. 또한 이들 연구에서 탐색 알고리즘 및 워크플로우 설계 기법들이 부분적으로는 기술되어 있으나. 웹 서비스 조합 자동화를 위한 전반적인 워크플로우 처리과정을 기술한 연구는 아직 없다. 본 논문은 웹 서비스 조합 자동화 기법에 초점을 맞추고 있다. 주된 아이디어는 시멘틱 웹을 실현하기 위한 웹 온톨로지와 비즈니스분야에서 성공적으로 활용되고 있는 워크플로우 기법들을 적용하여 웹 서비스 조합 자동화 시스템을 구현하는 것이다. 본 연구에서는 웹 서비스발견을 위해 매칭 알고리즘이 제안되고, 웹 서비스들 간 상호연결을 지원하기 위해 매칭 알고리즘에 온톨로지 개념이 적용된다. 그리고 웹 서비스 조합 자동화를 지원하기 위한 워크플로우 실행계획이 기술된다. 마지막으로 실 데이터 실험을 통해 제안 시스템의 우수성을 보인다. Recently, one of the most challenging problems is to compose web services dynamically, that is, on demand. A number of researchers have been considerably interested in the dynamic web services composition. However, while most of them focused on the semi-automatic web services composition with a human controller, very little attention was devoted to the full automation of this process. This paper primarily focuses on the automatic web services composition techniques. The main idea is to implement an automatic web services composition system using web ontologies to realize the semantic web and workflow technologies to play a major role in E-businesses. In this paper, we propose a matching algorithm for web service discovery and present an approach based on the use of ontologies to facilitate the interoperability of web services. Finally, we describe a workflow execution plan to support the automatic web services composition, and an experimental study that shows the high performance of our system.