Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2010 IEEE International Conference on Services Computing 2010
DOI: 10.1109/scc.2010.58
|View full text |Cite
|
Sign up to set email alerts
|

Metaheuristic Optimization of Large-Scale QoS-aware Service Compositions

Abstract: Abstract-We present an optimization approach for service compositions in large-scale service-oriented systems that are subject to Quality of Service (QoS) constraints. In particular, we leverage a composition model that allows a flexible specification of QoS constraints by using constraint hierarchies. We propose an extensible metaheuristic framework for optimizing such compositions. It provides coherent implementation of common metaheuristic functionalities, such as the objective function, improved mutation o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
27
0

Year Published

2011
2011
2021
2021

Publication Types

Select...
4
3
2

Relationship

2
7

Authors

Journals

citations
Cited by 54 publications
(27 citation statements)
references
References 24 publications
0
27
0
Order By: Relevance
“…This approach can also be considered a heuristic, since the combination with local selection does not guarantee a globally optimal solution [29]. Most comparably to our work, the authors of [30] use a genetic algorithm combined with local search to efficiently solve the QoS optimization problem. The main difference of our work to all these approaches is that we do not optimize the composition with regard to global QoS goals.…”
Section: Related Workmentioning
confidence: 93%
“…This approach can also be considered a heuristic, since the combination with local selection does not guarantee a globally optimal solution [29]. Most comparably to our work, the authors of [30] use a genetic algorithm combined with local search to efficiently solve the QoS optimization problem. The main difference of our work to all these approaches is that we do not optimize the composition with regard to global QoS goals.…”
Section: Related Workmentioning
confidence: 93%
“…A summary of the solution-specific aspects that are extracted from the set of papers included in the literature Performance (84) ES(32) [32], [45], [67]-COST(1) [33], GENERAL(10) [71], [79], [86], [113], [138], [139], [145], [205], [224], [243], MAPPING(3) [5], [95], [153], MEMORY(2) [5], [153], NOT PRE-SENTED(7) [21], [36], [91], [162], [202], [219], [242], PER-FORMANCE(1) [33], STRUCTURAL(1) [150] Energy(18) ES(17) [17], [28], [67], [68], [72], [84], [116], [153], [155], [165], [188], [193], [194], [211], [212], [237], [240], GENERAL(1) [206] DT(9) [67...…”
Section: Solutionmentioning
confidence: 99%
“…[5], [33], [95], [145], [224], NMF(1) [79], NOT PRESENTED(4) [36], [91], [242], [243], SAF(10) [21], [71], [86], [113], [150], [153], [162], [202], [205], [219] ALLOCATION(7) [5], [21], [33], [95], [145], [150], [153], COMPONENT SELECTION(1) [36], GENERAL(5) [79], [138], [139], [205], [224], HARDWARE REPLICATION(1) [95], HARD-WARE SELECTION(3) [33], [145], [150], NOT PRESENTED(1) [91], OTHER PROBLEM SPECIFIC(2) [71], [113], SCHEDULING(1) [33], SERVICE COMPOSITION(2) [202], [219], SERVICE SELECTION(6) [113], [162], [202], [219], [242], …”
Section: Mb(5)mentioning
confidence: 99%
“…[21] was the first effort to address the lower cost data-intensive service composition problem. Also, there is ample evidence regarding the applicability of genetic algorithms for large-scale optimization problems [13], [23] and service composition in cloud computing [25]. In order to deal with the dynamic changes of services and network conditions in cloud computing, as well as the constraints of different users and the flexibility of the selection criteria, a modified genetic algorithm-based dataintensive service composition approach is proposed in this paper.…”
Section: Related Workmentioning
confidence: 99%