On the Scalability of Compositions of Service-Oriented Applications

Pozas, Nicolás; Durán, Francisco

doi:10.1007/978-3-030-91431-8_28

Cited by 1 publication

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Resolution methods are usually divided in exact methods and heuristics‐based methods. The use of other methods, like, for example, ant colonies, 29 dynamic programming, 30 or divide and conquer techniques, 31 have also been explored by different authors. A broader summary of the different alternatives can be found in Strunk's survey 6 .…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Location‐aware scalable service composition

Pozas García,

Durán,

Moreno Berrocal

et al. 2023

Softw Pract Exp

Self Cite

View full text Add to dashboard Cite

The problem of service composition is the process of assigning resources to services from a pool of available ones in the shortest possible time so that the overall quality of service is maximized. This article provides solutions for the composition problem that takes into account its scalability, services' locations, and users' restrictions, which are key for the management of applications using state‐of‐the‐art technologies. The provided solutions use different techniques, including genetic algorithms and heuristics. We provide an extensive experimental evaluation, which shows the pros and cons of each of them, and allows us to characterize the preferred option for each specific problem. Since no solution dominates the others, we propose a decision tree, based on our results, to select the best composition algorithm in each situation.

show abstract

Section: Related Workmentioning

confidence: 99%

“…As an alternative to exact methods, some solutions that trade between execution time and precision have been proposed. By selecting service providers at the service level, 31,32 one can get good speed ups. One of such techniques is the use of the divide and conquer algorithm.…”

Section: Related Workmentioning

confidence: 99%