WARP: Efficient Automatic Web Service Composition

WARP is a new algorithm designed to achieve highest performance in Automatic Web Service Composition (WSC). In its first version, WARP solves the simplest form of WSC, providing very low running times but relative long compositions. Further, a heuristic score is associated to services that promote t...

Full description

Saved in:
Bibliographic Details
Published in2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) pp. 284 - 285
Main Author Diac, Paul
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2017
Subjects
Artificial intelligence
Benchmark testing
Conferences
Generators
heuristic
orchestration
Planning
polynomial time
Scientific computing
web service composition
Web services
Online AccessGet full text

Cover

More Information
Summary:WARP is a new algorithm designed to achieve highest performance in Automatic Web Service Composition (WSC). In its first version, WARP solves the simplest form of WSC, providing very low running times but relative long compositions. Further, a heuristic score is associated to services that promote the most relevant services when multiple are accessible. After this improvement, compositions are short and computed almost as fast as in the first version. Two well-known benchmarks [1], [4] are used to compare WARP with previous planning based approaches [5]. More revealing instances are generated by a proposed test generator.
DOI:10.1109/SYNASC.2017.00053