Quality-aware service delegation in automated web service composition: an automata-theoretic approach

  • Authors:

  • Oscar H. Ibarra;Bala Ravikumar;Cagdas Evren Gerede

  • Affiliations:

  • Computer Science Dept., University of California, Santa Barbara, CA;Computer Science Dept., Sonoma State University, CA;Computer Science Dept., University of California, Santa Barbara, Santa Barbara, CA

  • Venue:
  • Journal of Automata, Languages and Combinatorics
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Automated Web Service Composition has gained a significant momentum in facilitating fast and efficient formation of business-to-business collaborations where an important objective is the utilization of existing services to respond to new business requirements in a timely manner. In this context, the service delegation problem can be formulated as follows: When a user poses a sequence of requests to a "service community", how to delegate the requests to the available services registered in the community so that the user requests are satisfied via a collaboration of these services. Here, we present a formal analysis of the constrained service delegation problem where users also provides a set of quality constraints about the delegation of their requests. We follow the "Roman" service composition framework and extend it with a QoS model. We use the Presburger arithmetic to specify constraints. We show that there exists a linear time algorithm for the service delegation problem. In fact, this algorithm is a finite memory algorithm that solves two variations of the service delegation problem by reading the activity sequence in two or multiple passes. We also show that these results are tight in the sense that the number of passes can't be further reduced. We also prove that the constrained service delegation problem can be solved in polynomial time in the number of service requests and delegation constraints.