ReComp:QoZ-aware Recursive Service Composition at minimum Cost

In this work, we address the problem of selecting the best
set of available services or web functionalities (single or composite) to
provide a composite service at the minimum cost, while meeting QoS
requirements. Our Recursive composition model captures the fact that
the available service providers may include providers of single as well as
composite services; an important feature that was not captured in earlier
models. We show that Recursive Composition is an intrinsically harder
problem to solve than other studied compositional models. We use insights
about the structure of the Recursive Composition model to design an ef-
ficient algorithm BGF-D with provable guarantees on cost. Our approach
is equally suitable for all platforms that compose existing functionalities
including web services and web mashups. As an embodiment, we design
and implement the ReComp architecture for Recursive Composition of
web-services that implements the BGF-D algorithm. We present compre-
hensive theoretical and experimental evidence to establish the scalability
and superiority of the proposed algorithm over existing approaches.

By: Vimmi Jaiswal and Amit Sharma and Akshat Verma

Published in: RI10006 in 2010


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .