Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

An integer programming-based algorithm for optimising the WS-BPEL scenario execution adaptation process

An integer programming-based algorithm for optimising the WS-BPEL scenario execution adaptation... In this work we present an integer programming-based algorithm for adapting the execution of WS-BPEL scenarios, through the dynamic selection of the services to be invoked, according to criteria and policies set by the user. The proposed algorithm is experimentally evaluated both in terms of adaptation quality and adaptation computation overhead. The experimental results demonstrate that the proposed approach achieves to considerably improve adaptation speed, as compared to the exhaustive search algorithm which is considered as a baseline, while at the same time maintaining adaptation quality. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Web Engineering and Technology Inderscience Publishers

An integer programming-based algorithm for optimising the WS-BPEL scenario execution adaptation process

Loading next page...
 
/lp/inderscience-publishers/an-integer-programming-based-algorithm-for-optimising-the-ws-bpel-ytYxjG6AXn

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Enterprises Ltd
ISSN
1476-1289
eISSN
1741-9212
DOI
10.1504/IJWET.2020.113068
Publisher site
See Article on Publisher Site

Abstract

In this work we present an integer programming-based algorithm for adapting the execution of WS-BPEL scenarios, through the dynamic selection of the services to be invoked, according to criteria and policies set by the user. The proposed algorithm is experimentally evaluated both in terms of adaptation quality and adaptation computation overhead. The experimental results demonstrate that the proposed approach achieves to considerably improve adaptation speed, as compared to the exhaustive search algorithm which is considered as a baseline, while at the same time maintaining adaptation quality.

Journal

International Journal of Web Engineering and TechnologyInderscience Publishers

Published: Jan 1, 2020

There are no references for this article.