For current service-oriented applications, individual web service usually cannot meet the requirements arising from real world applications, so it is necessary to combine the functionalities of different web services ...For current service-oriented applications, individual web service usually cannot meet the requirements arising from real world applications, so it is necessary to combine the functionalities of different web services to obtain a composite service in response to users＇ service requests. In order to address the problem of web service composition, this paper proposes an efficient approach to composing basic services in case no any individual service can fully satisfy users＇ requests. Compared with the general strategies adopted in most previously proposed approaches where only the best composition solution is produced, the QoS-aware service composition approach is given and top k solutions in the framework are provided, rather than focusing on obtaining the best composition solution, since the presented approach allows more candidates that are likely to meet the requirements of the users. The approach is based on a succinct binary tree data structure, and a system,named ATC （Approach to Top-k Composite services retrieval） system is implemented. In ATC, Qos is taken into account for composite service, and a heuristic-based search method is proposed to retrieve top k composite service. Some extensive experiments are designed and two web service benchmarks are used for performance study. The experimental results snow that the proposed approach can assure high precision and efficiency for composite service search.展开更多
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 mechanis...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.展开更多
In order to enable quality-aware web services selection in the process of service composition,this paper first describes the non-functional requirements of service consumers and the quality of elementary service or co...In order to enable quality-aware web services selection in the process of service composition,this paper first describes the non-functional requirements of service consumers and the quality of elementary service or composite service as a quality vector,and then models the QoS（quality of service）-aware composition as a multiple criteria optimization problem in extending directed graph.A novel simulated annealing algorithm for QoS-aware web services composition is presented.A normalizing for composite service QoS values is made,and a secondary iterative optimization is used in the algorithm.Experimental results show that the simulated annealing algorithm can satisfy the multiple criteria and global QoS requirements of service consumers.The algorithm produces near optimum solution with much less computation cost.展开更多
In Internet of Vehicles(IoV),the security-threat information of various traffic elements can be exploited by hackers to attack vehicles,resulting in accidents,privacy leakage.Consequently,it is necessary to establish ...In Internet of Vehicles(IoV),the security-threat information of various traffic elements can be exploited by hackers to attack vehicles,resulting in accidents,privacy leakage.Consequently,it is necessary to establish security-threat assessment architectures to evaluate risks of traffic elements by managing and sharing securitythreat information.Unfortunately,most assessment architectures process data in a centralized manner,causing delays in query services.To address this issue,in this paper,a Hierarchical Blockchain-enabled Security threat Assessment Architecture(HBSAA)is proposed,utilizing edge chains and global chains to share data.In addition,data virtualization technology is introduced to manage multi-source heterogeneous data,and a metadata association model based on attribute graph is designed to deal with complex data relationships.In order to provide high-speed query service,the ant colony optimization of key nodes is designed,and the HBSAA prototype is also developed and the performance is tested.Experimental results on the large-scale vulnerabilities data gathered from NVD demonstrate that the HBSAA not only shields data heterogeneity,but also reduces service response time.展开更多
In order to formally reason and verify web services composition described by web services choreography specification WS-CDL,a typed formal model named typed Abstract WS-CDL（web services choreography description langu...In order to formally reason and verify web services composition described by web services choreography specification WS-CDL,a typed formal model named typed Abstract WS-CDL（web services choreography description language）for WS-CDL specifications is proposed.In typed Abstract WS-CDL,the syntax of type and session,typing rules and operational semantics are formalized;the collaborations of web services are formally described by sessions;the operational semantics of a session can help to formally reason the execution of the choreography;the typing rules can help to formally check the data type consistency of exchanged information between web services and capture run-time errors due to type mismatches.Particularly,the concepts of type assumption set extension and type assumption set compatibility are proposed,and the merging algorithm of type assumption sets is defined so as to eliminate type assumption conflict.Based on the formal model,typed mapping rules for mapping web services choreography to orchestration is also defined.With the typed mapping rules,orchestration stubs and their type assumption sets can be generated from a given choreography; thus, web services composition can be verified at choreography and orchestration levels,respectively.The model is proved to have properties of type safety,and how the model can help to reason and verify web services composition is illustrated through a case study.展开更多
Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services sele...Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services selection)to resolve dynamic Web services selection with QoS global optimal path,was proposed.The essence of the algorithm was that the problem of dynamic Web services selection with QoS global optimal path was transformed into a multi-objective services composition optimization problem with QoS constraints.The operations of the cross and mutation in genetic algorithm were brought into PSOA(particle swarm optimization algorithm),forming an improved algorithm(IPSOA)to solve the QoS global optimal problem.Theoretical analysis and experimental results indicate that the algorithm can better satisfy the time convergence requirement for Web services composition supporting cross-enterprises collaboration than the traditional algorithms.展开更多
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 ...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.展开更多
A novel layered method was proposed to solve the problem of Web services composition.In this method,services composition problem was formally transformed into the optimal matching problem of every layer,then optimal m...A novel layered method was proposed to solve the problem of Web services composition.In this method,services composition problem was formally transformed into the optimal matching problem of every layer,then optimal matching problem was modeled based on the hypergraph theory,and solved by computing the minimal transversals of the hypergraph.Meanwhile,two optimization algorithms were designed to discard some useless states at the intermediary steps of the composition algorithm.The effectiveness of the composition method was tested by a set of experiments,in addition,an example regarding the travel services composition was also given.The experimental results show that this method not only can automatically generate composition tree whose leaf nodes correspond to services composition solutions,but also has better performance on execution time and solution quality by adopting two proposed optimization algorithms.展开更多
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 lan...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.展开更多
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...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.展开更多
Composite service provision in mobile ad hoc networks encounters great challenges and its success rate is not satisfactory because the nodes' locations are dynamic and the nodes maybe unavailable at any time.Compo...Composite service provision in mobile ad hoc networks encounters great challenges and its success rate is not satisfactory because the nodes' locations are dynamic and the nodes maybe unavailable at any time.Composite service is built through the service composition.In mobile ad hoc networks,the factors influencing the success rate of service composition are mainly the number of nodes and the time spent for the composition.The node's failure probability is proportional to the length of time the node exist in the networks.In order to improve the success rate of service composition,we take several measures.First,we split the service requirement into several segments and cluster the nodes,so that the nodes' waiting time for service composition can be reduced.Second,we propose a new node model of "one node contains multiple services" in mobile ad hoc networks.Using this type of nodes model,the number of nodes required for service composition can be reduced.These means can increase the success rate of service composition.展开更多
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...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.展开更多
This paper presents a review of the ensemble learning models proposed for web services classification,selection,and composition.Web service is an evo-lutionary research area,and ensemble learning has become a hot spot...This paper presents a review of the ensemble learning models proposed for web services classification,selection,and composition.Web service is an evo-lutionary research area,and ensemble learning has become a hot spot to assess web services’earlier mentioned aspects.The proposed research aims to review the state of art approaches performed on the interesting web services area.The literature on the research topic is examined using the preferred reporting items for systematic reviews and meta-analyses(PRISMA)as a research method.The study reveals an increasing trend of using ensemble learning in the chosen papers within the last ten years.Naïve Bayes(NB),Support Vector Machine’(SVM),and other classifiers were identified as widely explored in selected studies.Core analysis of web services classification suggests that web services’performance aspects can be investigated in future works.This paper also identified performance measuring metrics,including accuracy,precision,recall,and f-measure,widely used in the literature.展开更多
The composition of the web service is a common technique to attain the best results of complex web tasks.The selection of appropriate web services,linking those services in the action flow and attaining the actual fun...The composition of the web service is a common technique to attain the best results of complex web tasks.The selection of appropriate web services,linking those services in the action flow and attaining the actual functionality of the task are the important factors to be considered.Even though different frameworks and methods have been proposed to dynamically compose web services,each method has its advantage and disadvantage over the other.Most of the methods give much importance to the Quality of Service(QoS)but fail to achieve the actual functionality after composition.This paper proposes a functionalityoriented composition technique for composing web services.Moreover,this method helps reach the extreme functionality of each web service in the composition towards customer satisfaction.Apart from considering the overall QoS of every single service,the non-functional parameters associated with these services are also considered for achieving the expected functionality.Each of these nonfunctional parameters has a vital role in the functional performance of the web service.The web services that satisfy the non-functional requirements are chosen to form the composition to attain the best performance.The list of services in the proposed composition method is different from the conventional one,which is composed based on the overall QoS.The non-functional parametric values,the QoS of each web service and the overall QoS after composition are evaluated for the proposed method and experimentally analyzed to prove their advantage over the others.展开更多
Recent advancements in cloud computing(CC)technologies signified that several distinct web services are presently developed and exist at the cloud data centre.Currently,web service composition gains maximum attention ...Recent advancements in cloud computing(CC)technologies signified that several distinct web services are presently developed and exist at the cloud data centre.Currently,web service composition gains maximum attention among researchers due to its significance in real-time applications.Quality of Service(QoS)aware service composition concerned regarding the election of candidate services with the maximization of the whole QoS.But these models have failed to handle the uncertainties of QoS.The resulting QoS of composite service identified by the clients become unstable and subject to risks of failing composition by end-users.On the other hand,trip planning is an essential technique in supporting digital map services.It aims to determine a set of location based services(LBS)which cover all client intended activities quantified in the query.But the available web service composition solutions do not consider the complicated spatio-temporal features.For resolving this issue,this study develops a new hybridization of the firefly optimization algorithm with fuzzy logic based web service composition model(F3L-WSCM)in a cloud environment for location awareness.The presented F3L-WSCM model involves a discovery module which enables the client to provide a query related to trip planning such as flight booking,hotels,car rentals,etc.At the next stage,the firefly algorithm is applied to generate composition plans to minimize the number of composition plans.Followed by,the fuzzy subtractive clustering(FSC)will select the best composition plan from the available composite plans.Besides,the presented F3L-WSCM model involves four input QoS parameters namely service cost,service availability,service response time,and user rating.An extensive experimental analysis takes place on CloudSim tool and exhibit the superior performance of the presented F3L-WSCM model in terms of accuracy,execution time,and efficiency.展开更多
In any organization where SOA has been implemented, all of the web services are registered in UDDI and users’ needs are served by using appropriate web services. So in this paper, we will try to discover a service fr...In any organization where SOA has been implemented, all of the web services are registered in UDDI and users’ needs are served by using appropriate web services. So in this paper, we will try to discover a service from repository first that can provide the required output to the user. The process becomes difficult when a single service is not able to fulfill a user’s need and we need a combination of services to answer complex needs of users. In our paper, we will suggest a simpler approach for dynamic service composition using a graph based methodology. This will be a design time service composition. This approach uses the functional and non-functional parameters of the services to select the most suitable services for composition as per user’s need. This approach involves “service classification” on the basis of functional parameters, “service discovery” on the basis of user’s need and then “service composition” using the selected services on the basis of non-functional parameters like response time, cost, security and availability. Another challenge in SOA implementation is that, once the composition has performed, some services may become faulty at runtime and may stop the entire process of serving a user’s need. So, we will also describe a way of “dynamic service reconfiguration” in our approach that will enable us to identify and replace a faulty service that is violating the SLA or is not accessible anymore. This service reconfiguration is done without redoing or reconfiguring the entire composition. In the end, to simulate the proposed approach, we will represent a prototype application built on php 5.4 using My SQL database at backend.展开更多
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...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.展开更多
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 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.展开更多
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)constrai...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.展开更多
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 reduc...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.展开更多
文摘For current service-oriented applications, individual web service usually cannot meet the requirements arising from real world applications, so it is necessary to combine the functionalities of different web services to obtain a composite service in response to users＇ service requests. In order to address the problem of web service composition, this paper proposes an efficient approach to composing basic services in case no any individual service can fully satisfy users＇ requests. Compared with the general strategies adopted in most previously proposed approaches where only the best composition solution is produced, the QoS-aware service composition approach is given and top k solutions in the framework are provided, rather than focusing on obtaining the best composition solution, since the presented approach allows more candidates that are likely to meet the requirements of the users. The approach is based on a succinct binary tree data structure, and a system,named ATC （Approach to Top-k Composite services retrieval） system is implemented. In ATC, Qos is taken into account for composite service, and a heuristic-based search method is proposed to retrieve top k composite service. Some extensive experiments are designed and two web service benchmarks are used for performance study. The experimental results snow that the proposed approach can assure high precision and efficiency for composite service search.
基金Supported by the National Key Technologies Re-search and Development Programming in the 10th Five-Year(2004BA721A05)
文摘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.
基金The National Natural Science Foundation of China(No.60773217)Free Exploration Project(985 Project of Renmin University of China)(No.21361231)
文摘In order to enable quality-aware web services selection in the process of service composition,this paper first describes the non-functional requirements of service consumers and the quality of elementary service or composite service as a quality vector,and then models the QoS（quality of service）-aware composition as a multiple criteria optimization problem in extending directed graph.A novel simulated annealing algorithm for QoS-aware web services composition is presented.A normalizing for composite service QoS values is made,and a secondary iterative optimization is used in the algorithm.Experimental results show that the simulated annealing algorithm can satisfy the multiple criteria and global QoS requirements of service consumers.The algorithm produces near optimum solution with much less computation cost.
基金supported in part by the Science and Technology Project Program of Sichuan under Grant 2022YFG0022in part by the Science and Technology Research Program of Chongqing Municipal Education Commission under Grant KJZD-K202000602+1 种基金in part by the General Program of Natural Science Foundation of Chongqing under Grant cstc2020jcyj-msxmX1021in part by the Chongqing Natural Science Foundation of China under Grant cstc2020jcyj-msxmX0343.
文摘In Internet of Vehicles(IoV),the security-threat information of various traffic elements can be exploited by hackers to attack vehicles,resulting in accidents,privacy leakage.Consequently,it is necessary to establish security-threat assessment architectures to evaluate risks of traffic elements by managing and sharing securitythreat information.Unfortunately,most assessment architectures process data in a centralized manner,causing delays in query services.To address this issue,in this paper,a Hierarchical Blockchain-enabled Security threat Assessment Architecture(HBSAA)is proposed,utilizing edge chains and global chains to share data.In addition,data virtualization technology is introduced to manage multi-source heterogeneous data,and a metadata association model based on attribute graph is designed to deal with complex data relationships.In order to provide high-speed query service,the ant colony optimization of key nodes is designed,and the HBSAA prototype is also developed and the performance is tested.Experimental results on the large-scale vulnerabilities data gathered from NVD demonstrate that the HBSAA not only shields data heterogeneity,but also reduces service response time.
基金The National Natural Science Foundation of China(No.60403027,60773191,70771043)the National High Technology Research and Development Program of China(863 Program)(No.2007AA01Z403)
文摘In order to formally reason and verify web services composition described by web services choreography specification WS-CDL,a typed formal model named typed Abstract WS-CDL（web services choreography description language）for WS-CDL specifications is proposed.In typed Abstract WS-CDL,the syntax of type and session,typing rules and operational semantics are formalized;the collaborations of web services are formally described by sessions;the operational semantics of a session can help to formally reason the execution of the choreography;the typing rules can help to formally check the data type consistency of exchanged information between web services and capture run-time errors due to type mismatches.Particularly,the concepts of type assumption set extension and type assumption set compatibility are proposed,and the merging algorithm of type assumption sets is defined so as to eliminate type assumption conflict.Based on the formal model,typed mapping rules for mapping web services choreography to orchestration is also defined.With the typed mapping rules,orchestration stubs and their type assumption sets can be generated from a given choreography; thus, web services composition can be verified at choreography and orchestration levels,respectively.The model is proved to have properties of type safety,and how the model can help to reason and verify web services composition is illustrated through a case study.
基金Project(70631004)supported by the Key Project of the National Natural Science Foundation of ChinaProject(20080440988)supported by the Postdoctoral Science Foundation of China+1 种基金Project(09JJ4030)supported by the Natural Science Foundation of Hunan Province,ChinaProject supported by the Postdoctoral Science Foundation of Central South University,China
文摘Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services selection)to resolve dynamic Web services selection with QoS global optimal path,was proposed.The essence of the algorithm was that the problem of dynamic Web services selection with QoS global optimal path was transformed into a multi-objective services composition optimization problem with QoS constraints.The operations of the cross and mutation in genetic algorithm were brought into PSOA(particle swarm optimization algorithm),forming an improved algorithm(IPSOA)to solve the QoS global optimal problem.Theoretical analysis and experimental results indicate that the algorithm can better satisfy the time convergence requirement for Web services composition supporting cross-enterprises collaboration than the traditional algorithms.
基金Supported by the National Key Technologies Re-search and Development Programinthe 10th Five-Year Plan of China(2004BA721A05)
文摘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.
基金Project(2010CB328101) supported by the National Basic Research Program of ChinaProject(2009AA01Z401) supported by the National High Technology Research and Development Program of China+4 种基金Projects(60803032,90818023) supported by the National Natural Science Foundation of ChinaProjects(09510701300,09JC1414200,09DZ1120403) supported by the Shanghai Science and Technology Commission,China"Shu Guang" Project(10SG23) supported by Shanghai Municipal Education Commission and Shanghai Education Development Foundation,ChinaProject(09QA1405800) supported by Shanghai Science and Technology Commission Rising-Star Program,ChinaProject(NCET-10-0598) supported by Program for New Century Excellent Talents in Chinese University
文摘A novel layered method was proposed to solve the problem of Web services composition.In this method,services composition problem was formally transformed into the optimal matching problem of every layer,then optimal matching problem was modeled based on the hypergraph theory,and solved by computing the minimal transversals of the hypergraph.Meanwhile,two optimization algorithms were designed to discard some useless states at the intermediary steps of the composition algorithm.The effectiveness of the composition method was tested by a set of experiments,in addition,an example regarding the travel services composition was also given.The experimental results show that this method not only can automatically generate composition tree whose leaf nodes correspond to services composition solutions,but also has better performance on execution time and solution quality by adopting two proposed optimization algorithms.
基金the National Natural Science Foundation of China(60425206, 60503033)National Basic Research Program of China (973 Program, 2002CB312000)Opening Foundation of State Key Laboratory of Software Engineering in Wuhan University
文摘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.
文摘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.
基金ACKNOWLEDGEMENT This research is supported by the National Grand Fundamental Research 973 Program of China under Grant No. 2011CB302506, 2012CB315802 National Key Technology Research and Development Program of China （Grant No. 2012BAH94F02）+3 种基金 National High-tech R＆D Program of China （863 Program） under Grant No. 2013AA102301 National Natural Science Foundation of China under Grant No. 61132001, 61171102） Program for New Century Excellent Talents in University （Grant No. NCET-11-0592） Project of New Generation Broad band Wireless Networks under Grant No. 2011ZX03002-002-01. The technology development and experiment of innovative networks architecture （CNGI-12- 03-007）.
文摘Composite service provision in mobile ad hoc networks encounters great challenges and its success rate is not satisfactory because the nodes' locations are dynamic and the nodes maybe unavailable at any time.Composite service is built through the service composition.In mobile ad hoc networks,the factors influencing the success rate of service composition are mainly the number of nodes and the time spent for the composition.The node's failure probability is proportional to the length of time the node exist in the networks.In order to improve the success rate of service composition,we take several measures.First,we split the service requirement into several segments and cluster the nodes,so that the nodes' waiting time for service composition can be reduced.Second,we propose a new node model of "one node contains multiple services" in mobile ad hoc networks.Using this type of nodes model,the number of nodes required for service composition can be reduced.These means can increase the success rate of service composition.
文摘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.
基金This research was supported by the BK21 FOUR(Fostering Outstanding Universities for Research)the Ministry of Education(MOE,Korea)and National Research Foundation of Korea(NRF).
文摘This paper presents a review of the ensemble learning models proposed for web services classification,selection,and composition.Web service is an evo-lutionary research area,and ensemble learning has become a hot spot to assess web services’earlier mentioned aspects.The proposed research aims to review the state of art approaches performed on the interesting web services area.The literature on the research topic is examined using the preferred reporting items for systematic reviews and meta-analyses(PRISMA)as a research method.The study reveals an increasing trend of using ensemble learning in the chosen papers within the last ten years.Naïve Bayes(NB),Support Vector Machine’(SVM),and other classifiers were identified as widely explored in selected studies.Core analysis of web services classification suggests that web services’performance aspects can be investigated in future works.This paper also identified performance measuring metrics,including accuracy,precision,recall,and f-measure,widely used in the literature.
文摘The composition of the web service is a common technique to attain the best results of complex web tasks.The selection of appropriate web services,linking those services in the action flow and attaining the actual functionality of the task are the important factors to be considered.Even though different frameworks and methods have been proposed to dynamically compose web services,each method has its advantage and disadvantage over the other.Most of the methods give much importance to the Quality of Service(QoS)but fail to achieve the actual functionality after composition.This paper proposes a functionalityoriented composition technique for composing web services.Moreover,this method helps reach the extreme functionality of each web service in the composition towards customer satisfaction.Apart from considering the overall QoS of every single service,the non-functional parameters associated with these services are also considered for achieving the expected functionality.Each of these nonfunctional parameters has a vital role in the functional performance of the web service.The web services that satisfy the non-functional requirements are chosen to form the composition to attain the best performance.The list of services in the proposed composition method is different from the conventional one,which is composed based on the overall QoS.The non-functional parametric values,the QoS of each web service and the overall QoS after composition are evaluated for the proposed method and experimentally analyzed to prove their advantage over the others.
文摘Recent advancements in cloud computing(CC)technologies signified that several distinct web services are presently developed and exist at the cloud data centre.Currently,web service composition gains maximum attention among researchers due to its significance in real-time applications.Quality of Service(QoS)aware service composition concerned regarding the election of candidate services with the maximization of the whole QoS.But these models have failed to handle the uncertainties of QoS.The resulting QoS of composite service identified by the clients become unstable and subject to risks of failing composition by end-users.On the other hand,trip planning is an essential technique in supporting digital map services.It aims to determine a set of location based services(LBS)which cover all client intended activities quantified in the query.But the available web service composition solutions do not consider the complicated spatio-temporal features.For resolving this issue,this study develops a new hybridization of the firefly optimization algorithm with fuzzy logic based web service composition model(F3L-WSCM)in a cloud environment for location awareness.The presented F3L-WSCM model involves a discovery module which enables the client to provide a query related to trip planning such as flight booking,hotels,car rentals,etc.At the next stage,the firefly algorithm is applied to generate composition plans to minimize the number of composition plans.Followed by,the fuzzy subtractive clustering(FSC)will select the best composition plan from the available composite plans.Besides,the presented F3L-WSCM model involves four input QoS parameters namely service cost,service availability,service response time,and user rating.An extensive experimental analysis takes place on CloudSim tool and exhibit the superior performance of the presented F3L-WSCM model in terms of accuracy,execution time,and efficiency.
文摘In any organization where SOA has been implemented, all of the web services are registered in UDDI and users’ needs are served by using appropriate web services. So in this paper, we will try to discover a service from repository first that can provide the required output to the user. The process becomes difficult when a single service is not able to fulfill a user’s need and we need a combination of services to answer complex needs of users. In our paper, we will suggest a simpler approach for dynamic service composition using a graph based methodology. This will be a design time service composition. This approach uses the functional and non-functional parameters of the services to select the most suitable services for composition as per user’s need. This approach involves “service classification” on the basis of functional parameters, “service discovery” on the basis of user’s need and then “service composition” using the selected services on the basis of non-functional parameters like response time, cost, security and availability. Another challenge in SOA implementation is that, once the composition has performed, some services may become faulty at runtime and may stop the entire process of serving a user’s need. So, we will also describe a way of “dynamic service reconfiguration” in our approach that will enable us to identify and replace a faulty service that is violating the SLA or is not accessible anymore. This service reconfiguration is done without redoing or reconfiguring the entire composition. In the end, to simulate the proposed approach, we will represent a prototype application built on php 5.4 using My SQL database at backend.
基金The author extend their appreciation to Deputyship for research&Innovation,Ministry of Education in Saudi Arabia for funding this research work through the Project Number(IF-PSAU-2022/01/19619).
文摘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.
基金The authors extend their appreciation to the Deputyship for Research and Innovation,Ministry of Education in Saudi Arabia for funding this research work through the project number 2022/01/22636.
文摘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.
基金Ministry of Education in Saudi Arabia for funding this research work through the project number (IFPSAU-2021/01/17793)rch work through the project number (IFPSAU-2021/01/17793)。
文摘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.
文摘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.
