The Community for Technology Leaders
RSS Icon
Subscribe
Orlando, Florida
July 11, 2005 to July 15, 2005
ISBN: 0-7695-2408-7
pp: 103-112
Cagdas E. Gerede , Dept. of Computer Science University of California Santa Barbara, CA, 93106, USA
Bala Ravikumar , Dept. of Computer Science Sonoma State University Rohnert Park, CA 94928, USA
Jianwen Su , Dept. of Computer Science University of California Santa Barbara, CA, 93106, USA
ABSTRACT
<p>The paradigm of automated e-service composition through the integration of existing services promises a fast and efficient development of new services in cooperative business environments. Although the "why" part of this paradigm is well understood, many key pieces are missing to utilize the available opportunities. Recently "e-service communities" where service providers with similar interests can register their services are proposed towards realizing this goal. In these communities, requests for services posed by users can be processed by delegating them to already registered services, and orchestrating their executions. We use the service framework of the "Roman" model and further extend it to integrate activity processing costs into the "ad hoc" delegation computation. We investigate the problem of efficient processing of service requests in service communities and develop polynomial time ad hoc delegation techniques guaranteeing optimality.</p>
INDEX TERMS
null
CITATION
Cagdas E. Gerede, Bala Ravikumar, Jianwen Su, "Online and Minimum-Cost Ad Hoc Delegation in e-Service Composition", SCC, 2005, 2013 IEEE International Conference on Services Computing, 2013 IEEE International Conference on Services Computing 2005, pp. 103-112, doi:10.1109/SCC.2005.69
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool