GOS: a global optimal selection strategies for QoS-aware web services composition

Li, Mu; Zhu, Danfeng; Deng, Tao; Sun, Hailong; Guo, Huipeng; Liu, Xudong

doi:10.1007/s11761-013-0133-7

Cited by 6 publications

(5 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If C S is the number of active Web service calls and CT the total number of calls, Execution time = 𝑇/𝐶 𝑇 , (10) where 𝑇 is the total execution time for all the 𝐶𝑇 calls, Throughput = 𝐶 𝑆 /𝑇, (11) with 𝐶 𝑇 = 50.…”

Section: Experimental Evaluationmentioning

confidence: 99%

“…The web service can usually not satisfy the need for speci c business activity in the real world but can serve diverse needs by creating different web services. Therefore, there is a possible silver bullet for businesses and several researchers have been interested [8][9][10][11][12][13][14]. In order to create such systems, web services include the necessary basic unit representing particular activities or features.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A High Performance Random Forest Machine Learning Algorithm for QoS- Based Web Services Composition

Choudhury

2023

Preprint

View full text Add to dashboard Cite

Service-based architecture becomes a key software interface for complex applications which can be dynamically and flexibly compounded by integrating existing Web services with standard protocols from various providers. New web services can adversely affect the quality of service and customer satisfaction through their rapid introduction into a competitive business environment. Hence, it remains a constant problem in state of the art research how to collect, aggregate and employ data on individual quality of service (QoS) components to obtain the optimum quality of service of a composite service that responds to customer needs. This study proposes a Random Forest (RF) Algorithm for high-performance machine learning web services composition (WSC) problem. In this experiment, the validation is done using value iteration, iterative policy evaluation, and policy iteration algorithm. In this experiment, we illustrate WSC difficulties how to solve and demanding an entire sequence of 1000,000 Web services can be measured using an Intel Core i7 device with a 32GB RAM, requiring the selection of 10,000 services from the current system and less than 130 seconds. Besides, only seven individual web services pose a real WSC problem that needs processing power of less than 0.03 seconds.

show abstract

Section: Experimental Evaluationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A High Performance Random Forest Machine Learning Algorithm for QoS- Based Web Services Composition

Choudhury

2023

Preprint

View full text Add to dashboard Cite

show abstract

“…Algorithms based on the grouping phase are presented by Deng et al [98] and Xia et al [99]. Another two papers, written by Liu et al [100] and by Li et al [101], present two original heuristic algorithms, the first paper for local, and the latter for global optimization. Schuller et al [102] present a method for complex workflows (compositions) where they aggregate QoS values to simplify the problem and then they formulate a linear optimization problem without proposition of the best algorithm to find a solution.…”

Section: ) New Original Algorithmsmentioning

confidence: 99%

Optimization of Business Process Execution in Services Architecture: A Systematic Literature Review

Górski

Woźniak

2021

IEEE Access

View full text Add to dashboard Cite

Web services have become a standard way to provide functions of information systems. The number of web services grows rapidly with the increasing popularity of microservices architecture. In consequence, many business processes are executed entirely through web services. Therefore, optimizing the performance of business process execution may bring many benefits. There are many optimization methods in this area. Our systematic literature review aims to introduce available methods to researchers interested in the optimization of business process execution. We queried four databases: ACM, IEEE Xplore, Science Direct, and Springer. Out of 12150 initially found papers, we have selected 128 for the review. We have grouped methods presented in those papers into three stages of business process optimization: Resource Allocation, Service Composition, and Service Scheduling. Service Composition attracts the largest group of researchers with a vast majority of 119 articles in it. Moreover, the most popular are genetic algorithms. In general, researchers mainly propose heuristic methods that optimize business processes during run-time. We see the potential for further exploration at both Resource Allocation and Service Scheduling stages.

show abstract

“…Rodrigues et al [17] presented an A * algorithm which solves the problem of semantic input-output message structure matching for web service composition. In order to satisfy the overall QoS constraints and reduce the time complexity, several heuristic algorithms [18][19][20] have been proposed to find a near optimal solution for service composition. Heuristic function design is critical to a heuristic search algorithm, which has been extensively researched in the area of heuristic algorithm development and selection.…”

Section: Related Workmentioning

confidence: 99%

A Heuristic Algorithm for Optimal Service Composition in Complex Manufacturing Networks

Peng

Wang

et al. 2019

Complexity

View full text Add to dashboard Cite

Service composition in a Cloud Manufacturing environment involves the adaptive and optimal assembly of manufacturing services to achieve quick responses to varied manufacturing needs. It is challenged by the inherent heterogeneity and complexity of these services in terms of their diverse and complex functions, qualities of service, execution paths, etc. In this paper, a manufacturing network is constructed to explicitly identify and describe the relationships between individual services based on their attributes. On this basis, the service composition problem can be modeled as a multiple-constrained optimal path (MCOP) selection problem by taking into account different types of composition, namely, sequence, parallel, selection, and cycle. A novel Dual Heuristic Functions based Optimal Service Composition Path algorithm (DHA_OSCP) is proposed to solve the NP-Complete MCOP problem, which involves exploiting the backward search procedure with different search targets to obtain two heuristic functions for the forward search procedure. The proposed algorithm is evaluated through a set of computational experiments in which the proposed algorithm and other popular algorithms such as MFPB_HOSTP are applied to the same dataset, and the results obtained show that DHA_OSCP can efficiently find the optimal service composition path with better Quality of Service (QoS). The viability of DHA_OSCP is further proved in a case study of services composition on a Cloud Manufacturing platform.

show abstract

GOS: a global optimal selection strategies for QoS-aware web services composition

Cited by 6 publications

References 20 publications

A High Performance Random Forest Machine Learning Algorithm for QoS- Based Web Services Composition

A High Performance Random Forest Machine Learning Algorithm for QoS- Based Web Services Composition

Optimization of Business Process Execution in Services Architecture: A Systematic Literature Review

A Heuristic Algorithm for Optimal Service Composition in Complex Manufacturing Networks

Contact Info

Product

Resources

About