On optimal service selection in Service Oriented Architectures

  • Authors:

  • Daniel A. Menascé;Emiliano Casalicchio;Vinod Dubey

  • Affiliations:

  • Department of Computer Science, MS 5C8, George Mason University, Fairfax, VA 22030, USA;Dipartimento di Informatica Sistemi e Prod., Universití di Roma "Tor Vergata", Roma, Italy;The Volgenau School of Information Technology and Engineering, George Mason University, Fairfax, VA 22030, USA

  • Venue:
  • Performance Evaluation
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Service Oriented Architectures enable a multitude of service providers to provide loosely coupled and interoperable services at different Quality of Service and cost levels. This paper considers business processes composed of activities that are supported by service providers. The structure of a business process may be expressed by languages such as BPEL and allows for constructs such as sequence, switch, while, flow, and pick. This paper considers the problem of finding the set of service providers that minimizes the total execution time of the business process subject to cost and execution time constraints. The problem is clearly NP-hard. However, the paper presents an optimized algorithm that finds the optimal solution without having to explore the entire solution space. This algorithm can be used to find the optimal solution in problems of moderate size. A heuristic solution is also presented. Thorough experimental studies, based on random business processes, demonstrate that the heuristic algorithm was able to produce service provider allocations that result in execution times that are only a few percentage points (less than 2.5%) worse than the allocations obtained by the optimal algorithm while examining a tiny fraction of the solution space (tens of points versus millions of points).