ACM Home Page
Please provide us with feedback. Feedback
A heuristic approach to optimal service selection in service oriented architectures
Full text PdfPdf (741 KB)
Source
Workshop on Software and Performance archive
Proceedings of the 7th international workshop on Software and performance table of contents
Princeton, NJ, USA
SESSION: Performance diagnosis and improvement table of contents
Pages 13-24  
Year of Publication: 2008
ISBN:978-1-59593-873-2
Authors
Daniel A. Menascé  George Mason University, Fairfax, VA, USA
Emiliano Casalicchio  Universita di Roma, Rome, Italy
Vinod Dubey  George Mason University, Fairfax, VA, USA
Sponsors
SIGSOFT: ACM Special Interest Group on Software Engineering
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 28,   Downloads (12 Months): 258,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1383559.1383562
What is a DOI?

ABSTRACT

Service Oriented Architectures (SOA) enable a multitude of service providers (SP) to provide loosely coupled and interoperable services at different Quality of Service (QoS) 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 and experimental studies that compare the optimal and heuristic solution show that the average execution time obtained with a heuristic allocation of providers to activities does not exceed 6% of that of the optimal solution.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
"Web Service - Business Process Execution Language (WS BPEL)," Version 2.0 - OASIS Committee Draft, 17th May, 2006.
 
2
D. Ardagna and B. Pernici, "Global and Local QoS Guarantee in Web Service Selection," Proc. of Business Process Management Workshops, pp. 32--46, 2005.
 
3
 
4
 
5
 
6
G. Canfora, M. Di Penta, R. Esposito, and M. L. Villani, "An Approach for QoS-aware Service Composition Based on Genetic Algorithms," Proc. Genetic and Computation Conf., June 2005.
 
7
V. Cardellini, E. Casalicchio, V. Grassi, and L. P. Francesco, "Flow-based service selection for web service composition supporting multiple qos classes," ICWS 2007. IEEE Intl. Conf. Web Services, pp. 743--750, July 9-13,2007.
 
8
 
9
 
10
H. David, "Order Statistics," John Wiley & Sons, 1981.
 
11
 
12
M. Hammer and J. Champy, "Reengineering the Corporation: A Manifesto for Business Revolution," Harper Business, 1993.
 
13
 
14
H. J. E. Johansson, "Business Process Reengineering: BreakPoint Strategies for Market Dominance," John Wiley & Sons, 1993.
 
15
 
16
 
17
 
18
D.A. Menascé and V. Dubey,"Utility-based QoS brokering in service oriented architectures," IEEE 2007 Intl. Conf. Web Services (ICWS 2007), Application Services and Industry Track, Salt Lake City, Utah, July 9-13, 2007, pp. 422--430.
 
19
 
20
 
21
 
22
 
23
M. Papazoglou, "Web Services: Principles and Technology," Prentice Hall, 2008.
 
24
 
25
T. Yu and K. J. Lin, "Service Selection Algorithms for Composing Complex Services with Multiple QoS Constraints," Proc. of 3rd Int'l Conf. on Service Oriented Computing, pp. 130--143, Dec. 2005.
 
26


Collaborative Colleagues:
Daniel A. Menascé: colleagues
Emiliano Casalicchio: colleagues
Vinod Dubey: colleagues