loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI'06)
Efficient Service Composition Using Zero-Suppressed Reduced Ordered Binary Decision Diagrams
Hong Kong, China
December 18-December 22
ISBN: 0-7695-2747-7
ASCII Text
x 
 
Walter Binder, Ion Constantinescu, Boi Faltings, "Efficient Service Composition Using Zero-Suppressed Reduced Ordered Binary Decision Diagrams," Web Intelligence, IEEE / WIC / ACM International Conference on, pp. 587-593, 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/WI.2006.68,
author = {Walter Binder and Ion Constantinescu and Boi Faltings},
title = {Efficient Service Composition Using Zero-Suppressed Reduced Ordered Binary Decision Diagrams},
journal ={Web Intelligence, IEEE / WIC / ACM International Conference on},
volume = {0},
year = {2006},
isbn = {0-7695-2747-7},
pages = {587-593},
doi = {http://doi.ieeecomputersociety.org/10.1109/WI.2006.68},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Web Intelligence, IEEE / WIC / ACM International Conference on
TI - Efficient Service Composition Using Zero-Suppressed Reduced Ordered Binary Decision Diagrams
SN - 0-7695-2747-7
SP587
EP593
A1 - Walter Binder,
A1 - Ion Constantinescu,
A1 - Boi Faltings,
PY - 2006
KW - null
VL - 0
JA - Web Intelligence, IEEE / WIC / ACM International Conference on
ER -
 
Walter Binder, University of Lugano, Switzerland
Ion Constantinescu, Ecole Polytechnique Federale de Lausanne (EPFL), Switzerland
Boi Faltings, Ecole Polytechnique Federale de Lausanne (EPFL), Switzerland
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.
Citation:
Walter Binder, Ion Constantinescu, Boi Faltings, "Efficient Service Composition Using Zero-Suppressed Reduced Ordered Binary Decision Diagrams," wi, pp.587-593, 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.