Hong Kong, China
Dec. 18, 2006 to Dec. 22, 2006
Walter Binder , University of Lugano, Switzerland
Ion Constantinescu , Ecole Polytechnique Federale de Lausanne (EPFL), Switzerland
Boi Faltings , Ecole Polytechnique Federale de Lausanne (EPFL), Switzerland
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/WI.2006.68
Recent algorithms for automated service composition issue many complex queries to service directories. As service directories are shared resources, they may become performance bottlenecks. In order to increase scalability, we introduce a compact directory digest, which is distributed to clients and includes all information needed for automated service composition. Therefore, complex directory queries during service composition can be avoided. We encode a directory digest as a Zero-Suppressed Reduced Ordered Binary Decision Diagram (ZDD). In several steps, we refine a simple service composition algorithm in order to leverage the ZDD representation. Introducing specialized ZDD operations, we achieve a service composition algorithm that scales very well with an increasing size of the directory digest.
Walter Binder, Ion Constantinescu, Boi Faltings, "Efficient Service Composition Using Zero-Suppressed Reduced Ordered Binary Decision Diagrams", WI, 2006, Web Intelligence, IEEE / WIC / ACM International Conference on, Web Intelligence, IEEE / WIC / ACM International Conference on 2006, pp. 587-593, doi:10.1109/WI.2006.68