Directory Support for Large-Scale, Automated Service Composition

2005 ◽  
pp. 57-66 ◽  
Author(s):  
Walter Binder ◽  
Ion Constantinescu ◽  
Boi Faltings
Keyword(s):  
Service Composition ◽  
Large Scale

Client-Centric Cloud Service Composition

2017 ◽  
pp. 144-166
Author(s):  
Vivek Gaur ◽  
Praveen Dhyani ◽  
Om Prakash Rishi
Keyword(s):  
Service Composition ◽  
Large Scale ◽  
Business Processes ◽  
Service Providers ◽  
Service Selection ◽  
Cloud Service ◽  
Quality Parameters ◽  
End User ◽  
Cloud Service Composition ◽  
Tabu Search Methods

Recent computing world has seen rapid growth of the number of middle and large scale enterprises that deploy business processes sharing variety of services available over cloud environment. Due to the advantage of reduced cost and increased availability, the cloud technology has been gaining unbound popularity. However, because of existence of multiple cloud service providers on one hand and varying user requirements on the other hand, the task of appropriate service composition becomes challenging. The conception of this chapter is to consider the fact that different quality parameters related to various services might bear varied importance for different user. This chapter introduces a framework for QoS-based Cloud service selection to satisfy the end user needs. A hybrid algorithm based on genetic algorithm (GA) and Tabu Search methods has been developed, and its efficacy is analysed. Finally, this chapter includes the experimental analysis to present the performance of the algorithm.

Issues on the Compatibility of Web Service Contracts

2013 ◽  
pp. 154-188 ◽  
Author(s):  
Surya Nepal ◽  
John Zic
Keyword(s):  
Web Service ◽  
Service Composition ◽  
Large Scale ◽  
Service Oriented Architecture ◽  
Distributed Applications ◽  
Compatibility Conditions ◽  
Service Contract ◽  
Service Contracts ◽  
Service Oriented ◽  
Application Developers

In the Service Oriented Architecture (SOA) model, a service is characterized by its exchange of asynchronous messages, and a service contract is a desirable composition of a variety of messages. Though this model is simple, implementing large-scale, cross-organizational distributed applications may be difficult to achieve in general, as there is no guarantee that service composition will be possible because of incompatibilities of Web service contracts. We categorize compatibility issues in Web service contracts into two broad categories: (a) between contracts of different services (which we define as a composability problem), and (b) a service contract and its implementation (which we define as a conformance problem). This chapter examines and addresses these problems, first by identifying and specifying contract compatibility conditions, and second, through the use of compatibility checking tools that enable application developers to perform checks at design time.

Rapid Development of Adaptable Situation-Aware Service-based Systems

2010 ◽  
pp. 104-139 ◽  
Author(s):  
S.S. Yau ◽  
S. Mukhopadhyay ◽  
H. Davulcu ◽  
D. Huang ◽  
R. Bharadwaj ◽  
...  
Keyword(s):  
Distributed Control ◽  
Homeland Security ◽  
Situation Awareness ◽  
Service Composition ◽  
Large Scale ◽  
Rapid Development ◽  
Control Flow ◽  
Agent Platform ◽  
Service Oriented ◽  
Adaptive Workflows

Service-based systems have many applications, such as collaborative research and development, e-business, health care, military applications and homeland security. In these systems, it is necessary to provide users the capability of composing appropriate services into workflows offering higher-level functionality based on declaratively specified goals. In a large-scale and dynamic service-oriented computing environment, it is desirable that the service composition is automated and situation-aware so that robust and adaptive workflows can be generated. However, existing languages for web services are not expressive enough to model services with situation awareness (SAW) and side effects. This chapter presents an approach to rapid development of adaptable situation-aware service-based systems. This approach is based on the a-logic and a-calculus, and a declarative model for SAW. This approach consists of four major components: (1) analyzing SAW requirements using our declarative model for SAW, (2) translating the model representation to a-logic specifications and specifying a control flow graph in a-logic as the goal for situation-aware service composition., (3) automated synthesis of a-calculus terms that define situation-aware workflow agents for situation-aware service composition, and (4) compilation of a-calculus terms to executable components on an agent platform. An example of applying our framework in developing a distributed control system for intelligently and reliably managing a power grid is given.

scholarly journals MR-IDPSO: a novel algorithm for large-scale dynamic service composition

2015 ◽  
Vol 20 (6) ◽  
pp. 602-612 ◽  
Author(s):  
Yanping Zhang ◽  
Zihui Jing ◽  
Yiwen Zhang
Keyword(s):  
Service Composition ◽  
Large Scale ◽  
Dynamic Service Composition ◽  
Novel Algorithm

scholarly journals Experimental Analysis for Semantic based Large Scale Service Composition using Deep Learning

2019 ◽  
Vol 8 (10) ◽  
pp. 4280-4283
Keyword(s):  
Deep Learning ◽  
Web Services ◽  
Web Service ◽  
Service Composition ◽  
Web Application ◽  
Large Scale ◽  
Learning Algorithm ◽  
Computational Cost ◽  
Web Service Composition ◽  
User Requirement

In Service Oriented Architecture (SOA) web services plays important role. Web services are web application components that can be published, found, and used on the Web. Also machine-to-machine communication over a network can be achieved through web services. Cloud computing and distributed computing brings lot of web services into WWW. Web service composition is the process of combing two or more web services to together to satisfy the user requirements. Tremendous increase in the number of services and the complexity in user requirement specification make web service composition as challenging task. The automated service composition is a technique in which Web Service Composition can be done automatically with minimal or no human intervention. In this paper we propose a approach of web service composition methods for large scale environment by considering the QoS Parameters. We have used stacked autoencoders to learn features of web services. Recurrent Neural Network (RNN) leverages uses the learned features to predict the new composition. Experiment results show the efficiency and scalability. Use of deep learning algorithm in web service composition, leads to high success rate and less computational cost.

scholarly journals Genetic Programming for QoS-Aware Data-Intensive Web Service Composition and Execution

2021 ◽  
Author(s):  
◽  
Yang Yu
Keyword(s):  
Mathematical Model ◽  
Web Services ◽  
Genetic Programming ◽  
Web Service ◽  
Service Composition ◽  
Large Scale ◽  
Web Service Composition ◽  
Experimental Results ◽  
Multi Objective ◽  
Data Intensive

<p>Web service composition has become a promising technique to build powerful enterprise applications by making use of distributed services with different functions. In the age of big data, more and more web services are created to deal with a large amount of data, which are called data-intensive services. Due to the explosion in the volume of data, providing efficient approaches to composing data-intensive services will become more and more important in the field of service-oriented computing. Meanwhile, as numerous web services have been emerging to offer identical or similar functionality on the Internet, web service composition is usually performed with end-to-end Quality of Service (QoS) properties which are adopted to describe the non-functional properties (e.g., response time, execution cost, reliability, etc.) of a web service. In addition, the executions of composite web services are typically coordinated by a centralized workflow engine. As a result, the centralized execution paradigm suffers from inefficient communication and a single point of failure. This is particularly problematic in the context of data-intensive processes. To that end, more decentralized and flexible execution paradigms are required for the execution of data-intensive applications.  From a computational point of view, the problems of QoS-aware data-intensive web service composition and execution can be characterised as complex, large-scale, constrained and multi-objective optimization problems. Therefore, genetic programming (GP) based solutions are presented in this thesis to address the problems. A series of simulation experiments are provided to demonstrate the performance of the proposed approaches, and the empirical observations are also described in this thesis.  Firstly, we propose a hybrid approach that integrates the local search procedure of tabu search into the global search process of GP to solving the problem of QoS-aware data-intensive web service composition. A mathematical model is developed for considering the mass data transmission across different component services in a data-intensive service composition. The experimental results show that our proposed approach can provide better performance than the standard GP approach and two traditional optimization methods.  Next, a many-objective evolutionary approach is proposed for tackling the QoS-aware data-intensive service composition problem having more than three competing quality objectives. In this approach, the original search space of the problem is reduced before a recently developed many-objective optimization algorithm, NSGA-III, is adopted to solve the many-objective optimization problem. The experimental results demonstrate the effectiveness of our approach, as well as its superiority than existing single-objective and multi-objective approaches.  Finally, a GP-based approach to partitioning a composite data-intensive service for decentralized execution is put forth in this thesis. Similar to the first problem, a mathematical model is developed for estimating the communication overhead inside a partition and across the partitions. The data and control dependencies in the original composite web service can be properly preserved in the deployment topology generated by our approach. Compared with two existing heuristic algorithms, the proposed approach exhibits better scalability and it is more suitable for large-scale partitioning problems.</p>

Sign in / Sign up

Export Citation Format

Share Document