Queuing-based capacity planning approach for web service workflows using optimization algorithms

Publikationstyp
Conference Paper
Date Issued
2008-02
Sprache
English
Author(s)
Eckert, Julian  
Schulte, Stefan  
Repp, Nicolas  
Berbner, Rainer  
Steinmetz, Ralf  
TORE-URI
http://hdl.handle.net/11420/11933
Start Page
313
End Page
318
Article Number
4635152
Citation
2nd IEEE International Conference on Digital Ecosystems and Technologies (IEEE-DEST 2008)
Contribution to Conference
2nd IEEE International Conference on Digital Ecosystems and Technologies, IEEE-DEST 2008  
Publisher DOI
10.1109/DEST.2008.4635152
Scopus ID
2-s2.0-56749085329
One major challenge for service-oriented workflows in digital ecosystems is capacity planning for cross-organizational Web service workflows in order to avoid performance degradation. In order to analyze the execution capacity of Web service workflows and to plan the workflow control, queuing theory can be used to describe the average performance behavior of a workflow. By addressing capacity planning of Web service workflows, resource usage becomes more and more important. Capacity planning and performance measurement are crucial to ensure that the workflow execution remains feasible and SLA violations due to overload are avoided. Thus, this paper presents a capacity planning approach for Web service workflows based on queuing theory to support capacity planning decisions. Further we describe an optimization algorithm how to achieve an optimal utilization of the invoked Web services at minimal costs.
Subjects
Capacity planning
Quality of service
Queuing theory
Service-oriented architecture
Web service workflow