Efficient Heuristic Approach with Improved Time Complexity for Qos-Aware Service Composition

Klein, Adrian; Ishikawa, Fuyuki; Honiden, Shinichi

doi:10.1109/icws.2011.60

Cited by 45 publications

(22 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Process [74], [110], [106], [210], [50], [67], [206], [131], [196], [114], [97], [180], [100], [22], [113], [38], [168], [197], [181], [79], [109], [58], [70], [190], [44], [16], [80], [91], [84], [78], [159], [4], [129], [215], [147], [82], [68], [19], [28], [42], [60], [63], [86], [98], [115], [117], [119], [179], [216], [212], …”

Section: Dimension Referencesunclassified

See 1 more Smart Citation

Designing service-based applications in the presence of non-functional properties: A mapping study

Neto

Vargas-Solar²,

Costa

et al. 2016

Information and Software Technology

View full text Add to dashboard Cite

Section: Dimension Referencesunclassified

“…SOC [198], [105], [47], [36], [131], [39], [145], [38], [197], [58], [142], [183], [91], [10], [4], [215], [120], [19], [21], [31], [45], [189], [212], [158], [1], [174], [164], [188], [191].…”

Section: Dimension Referencesunclassified

Designing service-based applications in the presence of non-functional properties: A mapping study

Neto

Vargas-Solar²,

Costa

et al. 2016

Information and Software Technology

View full text Add to dashboard Cite

“…Others works [6] [19], [20] propose end-to-end QoS optimization computation assuming that a certain path will be better executed than others according to the probability of paths execution. For example method [6], proposes a universal model coupled with a branch and bound algorithm, but the convergence of the algorithm is not always possible.…”

Section: Related Workmentioning

confidence: 99%

“…Hence, the work in [7], proposes a heuristic technique based on a genetic algorithm to resolve the QoSbased service composition, which introduces interesting modifications, whether in crossover, mutation and selection phases in order to escape from local optimums and to expedite algorithm to deliver results in a timely manner. Otherwise, methods [18] and [19], propose a solution based on the genetic algorithm, within which Tabu search is used to generate neighbor plans and simulated annealing is applied for accepting or refusing the neighbor plan. Method [17] proposes a combination of the ant colony algorithm and the genetic algorithm, which transforms the problem of selecting optimal execution path for composite web service into a selection of the optimal path in the weighted directed acyclic graph.…”

Section: Related Workmentioning

confidence: 99%

SFL Algorithm for QoS-based Cloud Service Composition

Younes¹,

Essaaidi²,

Moussaoui³

2014

IJCA

View full text Add to dashboard Cite

With the advent of cloud service-based applications and Software as a Service (SaaS), new applications have recently known an increasing use of service-oriented architecture (SOA). This model has allowed computer science and associated industries to build new customized applications, by using the available and the existing cloud services bridged together dynamically to form a complex workflow process with more functionalities. However cloud services with similar and compatible functionalities may be offered by multiple providers but may also be offered at different QoS levels. Hence, to build a composite service with a high QoS, a decision should be made based on end-to-end QoS. This work proposes a new approach, for QoS-aware cloud service composition, which addresses a universal model, with end-toend QoS. It also proposes an effective evolutionary method based on Shuffled Frog Leaping Algorithm (SFLA), which is satisfying global and local constraints. Therefore, in order to evaluate the robustness of the proposed approach, we have evaluated the impact of several parameters that are highly significant in evolutionary methods, such as the impact of the population size, number of candidate services per task and number of criteria. The experimental results show that the chosen algorithm performs better than the ones based on Genetic Algorithm (GA).

show abstract

“…Klein et al [26] used linear programming techniques to provide a set of probabilistic service selection policies to chose services at runtime. However, their approach requires runtime information, they are focused on a long-term optimization, and they assume that services can be chosen automatically.…”

Section: Related Workmentioning

confidence: 99%

Quality Prediction in Service Composition Frameworks

Klatt

Brosch

Durdik

et al. 2012

Service-Oriented Computing

View full text Add to dashboard Cite

Abstract. With the introduction of services, software systems have become more flexible as new services can easily be composed from existing ones. Service composition frameworks offer corresponding functionality and hide the complexity of the underlying technologies from their users. However, possibilities for anticipating quality properties of composed services before their actual operation are limited so far. While existing approaches for model-based software quality prediction can be used by service composers for determining realizable Quality of Service (QoS) levels, integration of such techniques into composition frameworks is still missing. As a result, high effort and expert knowledge is required to build the system models required for prediction. In this paper, we present a novel service composition process that includes QoS prediction for composed services as an integral part. Furthermore, we describe how composition frameworks can be extended to support this process. With our approach, systematic consideration of service quality during the composition process is naturally achieved, without the need for detailed knowledge about the underlying prediction models. To evaluate our work and validate its applicability in different domains, we have integrated QoS prediction support according to our process in two composition frameworks -a large-scale SLA management framework and a service mashup platform.

show abstract

Efficient Heuristic Approach with Improved Time Complexity for Qos-Aware Service Composition

Cited by 45 publications

References 15 publications

Designing service-based applications in the presence of non-functional properties: A mapping study

Designing service-based applications in the presence of non-functional properties: A mapping study

SFL Algorithm for QoS-based Cloud Service Composition

Quality Prediction in Service Composition Frameworks

Contact Info

Product

Resources

About