An efficient and reliable approach for quality-of-service-aware service composition

Li, Jun; Zheng, Xiaolin; Chen, Song-Tao; Song, William-Wei; Chen, Deren

doi:10.1016/j.ins.2013.12.015

Cited by 91 publications

(27 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…However, when the aggregation function of the objective function is nonlinear, or any global QoS constraint cannot be described in a linear form, the aggregation function and the QoS constraint cannot be linearized. More explanation of heuristic algorithm can refer to the following literature [9], [10], [31].…”

Section: B Heuristic Algorithmsmentioning

confidence: 99%

A Meta-Heuristic-Based Approach for Qos-Aware Service Composition

Chen

2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

Recently, with the rapid increase in the number of web services, QoS-aware Web Service Composition(QWSC) has become a popular topic in both industry and academia. Meta-heuristic algorithm, as an effective way to solve classical optimization problems, has been successfully applied to QWSC nowdays. However, such approach has intrinsic drawbacks and usually lack of good performance in large-scale scenarios. For example, some meta-heuristic algorithms are suitable for continuous search space, while the search space of QWSC is discrete. For solving those problems which were commonly faced when applying meta-heuristic algorithm on QWSC, in this research, we firstly introduce a preprocessing approach for constructing fuzzy continuous neighborhood relations of concrete services, which makes the local search strategy of meta-heuristic algorithms be as effective in discrete space as in continuous space, thus improving the optimization performance. Second, we combine Harris Hawks Optimization (HHO) algorithm and logical chaotic sequence to propose an improved meta-heuristic algorithm named CHHO for solving QWSC. The ergodic and chaotic characteristics of chaotic sequences are used to enhance the ability of the CHHO to jump out of the local optimum for further optimization. Experimental results show that the CHHO has better optimization performance by comparing with the existing mainstream algorithms when solving QWSC problems. Additionally, the preprocessing approach not only greatly improves the optimization performance of the CHHO but also can be freely utilized in other meta-heuristics based approaches. INDEX TERMS Meta-heuristic algorithm, QoS-aware web service composition, Harris hawks optimization, fuzzy continuous, logical chaotic sequence.

show abstract

Section: B Heuristic Algorithmsmentioning

confidence: 99%

A Meta-Heuristic-Based Approach for Qos-Aware Service Composition

Chen

2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

show abstract

“…In T-HEU, the trustbased selection method is used to filter untrustworthy component services, the convex hulls to reduce the search space in the process of service composition, and the heuristic global optimization approach to obtain the near-optimal solution. 24 A systematic approach based on a fuzzy linguistic preference model and an evolutionary algorithm is put forward to solve the service level agreement (SLA)-constrained service composition problems. Specifically, the weighted Tchebycheff distance is introduced first to model this problem, and a fuzzy preference model for preference representation and weight assignment is presented, two evolutionary algorithms proposed for service composition.…”

Section: Related Workmentioning

confidence: 99%

HiCoACR: A reconfiguration decision-making model for reconfigurable security protocol based on hierarchically collaborative ant colony

Yi¹,

Liao

Du³

et al. 2020

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Reconfigurable security protocols, with dynamic protocol configuration and flexible resource allocation, have become a state-of-the-art technology to guarantee the security of space-ground integrated network. However, reconfiguration decision-making for reconfigurable security protocols remains a major challenge in order to adapt to diverse secure service requirements and deploy higher security level but more complicated security strategies in nodes with limited resources and computing abilities. To handle this problem commendably, a hierarchically collaborative ant colony–based reconfiguration decision-making model called HiCoACR is proposed. This model, inspired by the ideas of hierarchical reinforcement learning and population collaboration, decomposes the reconfiguration decision-making problem into two sub-problems by introducing a two-level hierarchy ant colony consisting of the Explorer and the Worker. The Explorer controls directions of protocol reconfiguration and generates abstract scheduling sub-goals which are conveyed from the Worker. While the Worker schedules most suitable cryptogram resources for each sub-goal received and produces the optimal reconfiguration solution which is verified and re-optimized by a Lévy process–based stochastic gradient descent algorithm. Both the Explorer and the Worker adopt a modified version of ant colony algorithm to fulfill its targets, where a hierarchical pheromone is defined to reinforce positive behaviors of each ant colony. Experiment results suggest that HiCoACR outperforms baseline algorithms and possesses well model transferability.

show abstract

“…The QoS describes the nonfunctional properties of the service. The QoS attributes of the candidate services defined in the related studies [ 28 , 46 , 47 ] are considered in this study. QoS-Based Evaluation.…”

Section: Proposed Modelmentioning

confidence: 99%

Mutation-Based Harmony Search Algorithm for Hybrid Testing of Web Service Composition

Maythaisong

Songpan

2018

Computational Intelligence and Neuroscience

View full text Add to dashboard Cite

Web service composition is a method of developing a new web service from an existing one based on business goals. Web services selected for composition should provide accurate operational results and reliable applications. However, most alternative service providers have not yet fulfilled users' needs in terms of services and processes. Service providers, in fact, have focused on enhancing nonfunctional attributes, such as efficiencies of time, cost, and availability, which still face limitations. Furthermore, it remains advantageous to compose services and suitably plan them around business plans. Thus, this study introduces hybrid testing using a combination of the functional and nonfunctional testing approaches. The former was used to design a test case through the equivalence class partitioning technique, and the latter was used to select suitable services for the test results. We find defects and appropriate solutions for combining services based on business requirements. The mutation-based harmony search (MBHS) algorithm is proposed to select web services and to compose with minimum defects. The results of this study reveal that MBHS can support a combination of various services more efficiently and dramatically than other metaheuristic methodologies. Additionally, it helps find appropriate solutions to compose services based on business plans.

show abstract

An efficient and reliable approach for quality-of-service-aware service composition

Cited by 91 publications

References 23 publications

A Meta-Heuristic-Based Approach for Qos-Aware Service Composition

A Meta-Heuristic-Based Approach for Qos-Aware Service Composition

HiCoACR: A reconfiguration decision-making model for reconfigurable security protocol based on hierarchically collaborative ant colony

Mutation-Based Harmony Search Algorithm for Hybrid Testing of Web Service Composition

Contact Info

Product

Resources

About