Resource Planning Heuristics for Service-Oriented Workflows

Resource allocation and resource planning, especially in a SOA and grid environment, become crucial. Particularly, in an environment with a huge number of workflow consumers requesting a decentralized cross-organizational workflow, performance evaluation and execution-management of service-oriented workflows gain in importance. The need for an effective and efficient workflow management forces enterprises to use intelligent optimization models and heuristics to compose workflows out of several services under real-time conditions. This paper introduces the required architecture workflow performance extension - WPX.KOM for resource planning and workload prediction purposes. Furthermore, optimization approaches and a high-performance heuristic solving the addressed resource planning problem with low computational overhead are presented.

[1]  Antonio Jorge Silva Cardoso,et al.  Quality of service and semantic composition of workflows , 2002 .

[2]  Kunal Verma,et al.  Constraint driven Web service composition in METEOR-S , 2004, IEEE International Conference onServices Computing, 2004. (SCC 2004). Proceedings. 2004.

[3]  H. Corporaal,et al.  Fast Multi-Dimension Multi-Choice Knapsack Heuristic for MP-SoC Run-Time Management , 2006, 2006 International Symposium on System-on-Chip.

[4]  David Pisinger,et al.  Algorithms for Knapsack Problems , 1995 .

[5]  R. Berbner,et al.  Queuing-based capacity planning approach for Web service workflows using optimization algorithms , 2008, 2008 2nd IEEE International Conference on Digital Ecosystems and Technologies.

[6]  Maria Luisa Villani,et al.  An approach for QoS-aware service composition based on genetic algorithms , 2005, GECCO '05.

[7]  Ralf Steinmetz,et al.  An architecture for a QoS driven compostion of web service based workflows , 2005 .

[8]  Mike P. Papazoglou,et al.  Service-oriented computing: concepts, characteristics and directions , 2003, Proceedings of the Fourth International Conference on Web Information Systems Engineering, 2003. WISE 2003..

[9]  Mike P. Papazoglou,et al.  Service oriented architectures: approaches, technologies and research issues , 2007, The VLDB Journal.

[10]  Mohammad Sohel Rahman,et al.  Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hulls , 2006, Comput. Oper. Res..

[11]  Kin F. Li,et al.  Solving the Knapsack Problem for Adaptive Multimedia Systems , 2002, Stud. Inform. Univ..

[12]  Ralf Steinmetz,et al.  An Approach for Replanning of Web Service Workflows , 2006, AMCIS.

[13]  Nikitas J. Dimopoulos,et al.  A new heuristic for solving the multichoice multidimensional knapsack problem , 2005, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[14]  Vldb Endowment,et al.  The VLDB journal : the international journal on very large data bases. , 1992 .

[15]  Timothy W. Finin,et al.  A Planner for Composing Services Described in DAML-S , 2003 .

[16]  Shankar Ponnekanti,et al.  SWORD: A Developer Toolkit for Web Service Composition , 2008 .

[17]  Zaigham Mahmood Service oriented architecture: potential benefits and challenges , 2007 .

[18]  Tao Yu,et al.  Service Selection Algorithms for Composing Complex Services with Multiple QoS Constraints , 2005, ICSOC.

[19]  Michael Niemann,et al.  Worst-Case Workflow Performance Optimization , 2008, 2008 Third International Conference on Internet and Web Applications and Services.

[20]  Thomas Bäck,et al.  The zero/one multiple knapsack problem and genetic algorithms , 1994, SAC '94.

[21]  Quan Z. Sheng,et al.  Quality driven web services composition , 2003, WWW '03.