A Service Design Oriented Web Services Composite Platform

In order to realize flexible, adaptable, extensible, efficient, and user-friendly service composition, we propose a service design oriented Web Service composite platform （SDOWSCP） and a service composition mechanism called composed-service-requestor-orient ed service composition （OBSDOSC）. SDOWSCP imports ontology into UDDI to define and annotate services in a flexible and intuitive manner and employs a concept of bond as a solution to the process heterogeneity. OBSDOSC is proposed in order to do some efforts to overcome some defects which current design tools usually have such as not user friendly and too professional. This paper proposes a pattern which describes the basic features of semi-automatic composite mode, discusses the whole lifetime of composed service and highlights how to lessen the descriptive heterogeneity and process heterogeneity and how to facilitate the design of composing a service.

A Service Composition Approach Based on Sequence Mining for Migrating E-learning Legacy System to SOA

With the fast development of business logic and information technology, today＇s best solutions are tomorrow＇s legacy systems. In China, the situation in the education domain follows the same path. Currently, there exists a number of e-learning legacy assets with accumulated practical business experience, such as program resource, usage behaviour data resource, and so on. In order to use these legacy assets adequately and efficiently, we should not only utilize the explicit assets but also discover the hidden assets. The usage behaviour data resource is the set of practical operation sequences requested by all users. The hidden patterns in this data resource will provide users＇ practical experiences, which can benefit the service composition in service-oriented architecture （SOA） migration. Namely, these discovered patterns will be the candidate composite services （coarse-grained） in SOA systems. Although data mining techniques have been used for software engineering tasks, little is known about how they can be used for service composition of migrating an e-learning legacy system （MELS） to SOA. In this paper, we propose a service composition approach based on sequence mining techniques for MELS. Composite services found by this approach will be the complementation of business logic analysis results of MELS. The core of this approach is to develop an appropriate sequence mining algorithm for mining related data collected from an e-learning legacy system. According to the features of execution trace data on usage behaviour from this e-learning legacy system and needs of further pattern analysis, we propose a sequential mining algorithm to mine this kind of data of tile legacy system. For validation, this approach has been applied to the corresponding real data, which was collected from the e-learning legacy system; meanwhile, some investigation questionnaires were set up to collect satisfaction data. The investigation result is 90% the same with the result obtained through our approach.

Neighborhood Search Based Improved Bat Algorithm for Web Service Composition

Web services are provided as reusable software components in the services-oriented architecture.More complicated composite services can be combined from these components to satisfy the user requirements represented as a workflow with specified Quality of Service(QoS)limitations.The workflow consists of tasks where many services can be considered for each task.Searching for optimal services combination and optimizing the overall QoS limitations is a Non-deterministic Polynomial(NP)-hard problem.This work focuses on the Web Service Composition(WSC)problem and proposes a new service composition algorithm based on the micro-bats behavior while hunting the prey.The proposed algorithm determines the optimal combination of the web services to satisfy the complex user needs.It also addresses the Bat Algorithm(BA)shortcomings,such as the tradeoff among exploration and exploitation searching mechanisms,local optima,and convergence rate.The proposed enhancement includes a developed cooperative and adaptive population initialization mechanism.An elitist mechanism is utilized to address the BA convergence rate.The tradeoff between exploration and exploitation is handled through a neighborhood search mechanism.Several benchmark datasets are selected to evaluate the proposed bat algorithm’s performance.The simulation results are estimated using the average fitness value,the standard deviation of the fitness value,and an average of the execution time and compared with four bat-inspired algorithms.It is observed from the simulation results that introduced enhancement obtains significant results.

Hybridizing Artificial Bee Colony with Bat Algorithm for Web Service Composition

In the Internet of Things(IoT),the users have complex needs,and the Web Service Composition(WSC)was introduced to address these needs.The WSC’s main objective is to search for the optimal combination of web services in response to the user needs and the level of Quality of Services(QoS)constraints.The challenge of this problem is the huge number of web services that achieve similar functionality with different levels of QoS constraints.In this paper,we introduce an extension of our previous works on the Artificial Bee Colony(ABC)and Bat Algorithm(BA).A new hybrid algorithm was proposed between the ABC and BA to achieve a better tradeoff between local exploitation and global search.The bat agent is used to improve the solution of exhausted bees after a threshold(limits),and also an Elitist Strategy(ES)is added to BA to increase the convergence rate.The performance and convergence behavior of the proposed hybrid algorithm was tested using extensive comparative experiments with current state-ofthe-art nature-inspired algorithms on 12 benchmark datasets using three evaluation criteria(average fitness values,best fitness values,and execution time)that were measured for 30 different runs.These datasets are created from real-world datasets and artificially to form different scale sizes of WSC datasets.The results show that the proposed algorithm enhances the search performance and convergence rate on finding the near-optimal web services combination compared to competitors.TheWilcoxon signed-rank significant test is usedwhere the proposed algorithm results significantly differ fromother algorithms on 100%of datasets.

Hybrid Chameleon and Honey Badger Optimization Algorithm for QoS-Based Cloud Service Composition Problem

Cloud computing facilitates the great potentiality of storing and managing remote access to services in terms of software as a service(SaaS).Several organizations have moved towards outsourcing over the cloud to reduce the burden on local resources.In this context,the metaheuristic optimization method is determined to be highly suitable for selecting appropriate services that comply with the requirements of the client’s requests,as the services stored over the cloud are too complex and scalable.To achieve better service composition,the parameters of Quality of Service(QoS)related to each service considered to be the best resource need to be selected and optimized for attaining potential services over the cloud.Thus,the cloud service composition needs to concentrate on the selection and integration of services over the cloud to satisfy the client’s requests.In this paper,a Hybrid Chameleon and Honey Badger Optimization Algorithm(HCHBOA)-based cloud service composition scheme is presented for achieving efficient services with satisfying the requirements ofQoS over the cloud.This proposed HCHBOA integrated the merits of the Chameleon Search Algorithm(CSA)and Honey Badger Optimization Algorithm(HBOA)for balancing the tradeoff between the rate of exploration and exploitation.It specifically used HBOA for tuning the parameters of CSA automatically so that CSA could adapt its performance depending on its incorporated tuning factors.The experimental results of the proposed HCHBOA with experimental datasets exhibited its predominance by improving the response time by 21.38%,availability by 20.93%and reliability by 19.31%with a minimized execution time of 23.18%,compared to the baseline cloud service composition schemes used for investigation.

Artificial Bee Colony with Cuckoo Search for Solving Service Composition

In recent years,cloud computing has provided a Software As A Service(SaaS)platform where the software can be reused and applied to fulfill compli-cated user demands according to specific Quality of Services(QoS)constraints.The user requirements are formulated as a workflow consisting of a set of tasks.However,many services may satisfy the functionality of each task;thus,searching for the composition of the optimal service while maximizing the QoS is formulated as an NP-hard problem.This work will introduce a hybrid Artificial Bee Colony(ABC)with a Cuckoo Search(CS)algorithm to untangle service composition problem.The ABC is a well-known metaheuristic algorithm that can be applied when dealing with different NP-hard problems with an outstanding record of performance.However,the ABC suffers from a slow convergence problem.Therefore,the CS is used to overcome the ABC’s limitations by allowing the abandoned bees to enhance their search and override the local optimum.The proposed hybrid algorithm has been tested on 19 datasets and then compared with two standard algorithms(ABC and CS)and three state-of-the-art swarm-based composition algorithms.In addition,extensive parameter study experiments were conducted to set up the proposed algorithm’s parameters.The results indicate that the proposed algorithm outperforms the standard algorithms in the three comparison criteria(bestfitness value,averagefitness value,and average execution time)overall datasets in 30 different runs.Furthermore,the proposed algorithm also exhibits better performance than the state–of–the–art algorithms in the three comparison criteria over 30 different runs.

Immune Algorithm for Selecting Optimum Services in Web Services Composition

For the problem of dynamic optimization in Web services composition, this paper presents a novel approach for selecting optimum Web services, which is based on the longest path method of weighted multistage graph. We propose and implement an Immune Algorithm for global optimization to construct composed Web services. Results of the experimentation illustrates that the algorithm in this paper has a powerful capability and can greatly improve the efficiency and veracity in service selection.

Distributed Information Flow Verification for Secure Service Composition in Smart Sensor Network

Accelerate processor, efficient software and pervasive connections provide sensor nodes with more powerful computation and storage ability, which can offer various services to user. Based on these atomic services, different sensor nodes can cooperate and compose with each other to complete more complicated tasks for user. However, because of the regional characteristic of sensor nodes, merging data with different sensitivities become a primary requirement to the composite services, and information flow security should be intensively considered during service composition. In order to mitigate the great cost caused by the complexity of modeling and the heavy load of single-node verification to the energy-limited sensor node, in this paper, we propose a new distributed verification framework to enforce information flow security on composite services of smart sensor network. We analyze the information flows in composite services and specify security constraints for each service participant. Then we propose an algorithm over the distributed verification framework involving each sensor node to participate in the composite service verification based on the security constraints. The experimental results indicate that our approach can reduce the cost of verification and provide a better load balance.

An Ontology-Based Service Matching Strategy in Grid Environments

An efficient ontology-based service scarching scheme is put forward in this paper by introducing semantic information into grid systems. The ideas of ontology and OWL (Web ontology language) are applied to establish a uniform abstract concept model and standardization for grid services. We propose a general framework of ontology-based service discovery sub-system, which includes ontology storage module, context-based domain selection module and specific service matching module. Implementation policies are also presented in this paper. Key words ontology - grid - service matching - scmantic - service composition CLC number TP 393 Foundation item: Supported by High Technology Research and Development Program of China (2003AA414210) and National Natural Science Foundation of China (60173051)Biography: YIN Nan (1979-), male, Master student, research di rection: Web service, grid, distributed system.

A Formal Model for BPEL4WS Description of Web Service Composition

Communicating Sequential Processes （CSP） is a kind of process algebra, which is suitable for modeling and verifying Web service composition. This paper describes how to model Web service composition with CSP. A set of rules for translating composition constructor of Business Process Execution Language for Web Services （BPEL4WS） to CSP notations is defined. According to the rules that have been defined, the corresponding translation algorithm is designed and illustrated with examples . The methods for model checking, model verification and model simulation are also introduced.

A Testing Method for Web Services Composition Based on Data-Flow

This paper proposes a method of data-flow testing for Web services composition. Firstly, to facilitate data flow analysis and constraints collecting, the existing model representation of business process execution language （BPEL） is modified in company with the analysis of data dependency and an exact representation of dead path elimination （DPE） is proposed, which over-comes the difficulties brought to dataflow analysis. Then defining and using information based on data flow rules is collected by parsing BPEL and Web services description language （WSDL） documents and the def-use annotated control flow graph is created. Based on this model, data-flow anomalies which indicate potential errors can be discovered by traversing the paths of graph, and all-du-paths used in dynamic data flow testing for Web services composition are automatically generated, then testers can design the test cases according to the collected constraints for each path selected.

RESEARCH ON REUSE-BASED WEB SERVICES COMPOSITION

Objective To solve the three principal problems for reusing the software components, i.e., existence, discovery and availability principles, web services provided a new solution for reusing and assembling web software or components under distributed environment with a series of XML-based protocols. Methods A 4+1 meta-model between atomic services, such as Sequence, Parallelism, Alternation, Substitute and Iteration, and a kind of service composition description language in composition process are investigated. Furthermore, an architecture-based service composition model with Ontology Engine is proposed, which is based on the software architecture life-cycle model and provides a mechanism for services composition with dynamic management and deployment. Results The results of the prototype system development show that the service-composed application not only reused the web service components, but also reused the data resources located in distributed databases. Conclusion The method of reused-based web services composition observably decreases the period and cost of development and greatly improves the programming efficiency.

Bilateral Collaborative Optimization for Cloud Manufacturing Service

Manufacturing service composition of the supply side and scheduling of the demand side are two important components of Cloud Manufacturing,which directly affect the quality of Cloud Manufacturing services.However,the previous studies on the two components are carried out independently and thus ignoring the internal relations and mutual constraints.Considering the two components on both sides of the supply and the demand of Cloud Manufacturing services at the same time,a Bilateral Collaborative Optimization Model of Cloud Manufacturing(BCOM-CMfg)is constructed in this paper.In BCOM-CMfg,to solve the manufacturing service scheduling problem on the supply side,a new efficient manufacturing service scheduling strategy is proposed.Then,as the input of the service composition problem on the demand side,the scheduling strategy is used to build the BCOM-CMfg.Furthermore,the Cooperation Level(CPL)between services is added as an evaluation index in BCOM-CMfg,which reveals the importance of the relationship between services.To improve the quality of manufacturing services more comprehensively.Finally,a Self-adaptive Multi-objective Pigeon-inspired Optimization algorithm(S-MOPIO)is proposed to solve the BCOM-CMfg.Simulation results show that the BCOM-CMfg model has advantages in reliability and cost and S-MOPIO can solve BCOM-CMfg effectively.

Fishery Web Service Composition Method Based on Ontology

Various fishery information systems have been developed in different times and on different platforms. Wet） service application composition is crucial in the sharing and integration of fishery data and information. In the present paper, a heuristic web service composition method based on fishery ontology is presented, and the proposed web services are described. Ontology reasoning capability was applied to generate a service composition graph. The heuristic function was introduced to reduce the searching space. The experimental results show that the algorithm used considers the services semantic similarity and adiusts web service composition plan by dynamically relying on the empirical data.

A colored Petri net-based model for web service composition

In this paper, a model based colored Petri net （CPN） to provide semantic support for web service composition is proposed, and the reliability and maintainability of composite services are improved. The composite constructs in the model are sequence, concurrent, choice, loop and replace. The web service is formally defined by a CPN. A closed composing algebra is defined to obtain a framework which enables declarative composition of web services. Availability, confidentiality, and integrity of composite service are analyzed within the framework of the model based CPN.

Service composition based on discrete particle swarm optimization in military organization cloud cooperation

This paper addresses the problem of service composition in military organization cloud cooperation（MOCC）. Military service providers（MSP） cooperate together to provide military resources for military service users（MSU）. A group of atom services, each of which has its level of quality of service（QoS）, can be combined together into a certain structure to form a composite service. Since there are a large number of atom services having the same function, the atom service is selected to participate in the composite service so as to fulfill users＇ will. In this paper a method based on discrete particle swarm optimization（DPSO） is proposed to tackle this problem. The method aims at selecting atom services from service repositories to constitute the composite service, satisfying the MSU＇s requirement on QoS. Since the QoS criteria include location-aware criteria and location-independent criteria, this method aims to get the composite service with the highest location-aware criteria and the best-match location-independent criteria. Simulations show that the DPSO has a better performance compared with the standard particle swarm optimization（PSO） and genetic algorithm（GA）.

Review of Semantic Web Service Composition Based on OWL-S

By analyzing of the existing Web services,an ontology based on OWL is presented,which has rich semantic information,and the service description language OWL-S based on OWL is put forward. OWL-S through IOPE can describe services,can also combine the service,but the method of combination service is not automatic. So a method is presented by using Situation Calculus for automatic service composition based on the OWL-S model. Finally through the example analysis,the method of automatic service combination was validated.

Composition of Web Services of Multi-Population Adaptive Genetic Algorithm Based on Cosine Improvement

Web quality of service (QoS) awareness requires not only the selection of specific services to complete specific tasks, but also the comprehensive quality of service of the whole web service composition. How to select the web service composition with the highest comprehensive QoS is a NP hard problem. In this paper, an improved multi population genetic algorithm is proposed. Cosine adaptive operator is added to the algorithm to avoid premature algorithm caused by improper genetic operator and the disadvantage of destroying excellent individuals in later period. Experimental results show that compared with the common genetic algorithm and multi population genetic algorithm, this algorithm has the advantages of shorter time consumption and higher accuracy, and effectively avoids the loss of effective genes in the population.

A Distributed Service Composition Method Based on Service Association

In this paper, a Web service composition architecture based on structured P2P network is proposed. Semantics is used to achieve service accurately matching and user personality customization. Through Web service virtual mapping（WVM） association the fast computing of distributed service composition based on the service function is also implemented. The Web service composition architecture and distributed service composition algorithm proposed in this paper solve a series of existent problems in ser- vice discovery and composition in distributed environment, and provide a service composition result meeting user personality requirement. At the same time, they improve the efficiency of service composition calculation.

Service Composition Instantiation Based on Cross-Modified Artificial Bee Colony Algorithm

Internet of things(IoT) imposes new challenges on service composition as it is difficult to manage a quick instantiation of a complex services from a growing number of dynamic candidate services. A cross-modified Artificial Bee Colony Algorithm(CMABC) is proposed to achieve the optimal solution services in an acceptable time and high accuracy. Firstly, web service instantiation model was established. What is more, to overcome the problem of discrete and chaotic solution space, the global optimal solution was used to accelerate convergence rate by imitating the cross operation of Genetic algorithm(GA). The simulation experiment result shows that CMABC exhibited faster convergence speed and better convergence accuracy than some other intelligent optimization algorithms.