Worst-case workflow performance optimization

Publikationstyp
Conference Paper
Date Issued
2008-06
Sprache
English
Author(s)
Eckert, Julian  
Schulte, Stefan  
Niemann, Michael  
Repp, Nicolas  
Steinmetz, Ralf  
TORE-URI
http://hdl.handle.net/11420/11930
Start Page
632
End Page
637
Article Number
4545684
Citation
3rd International Conference on Internet and Web Applications and Services (ICIW 2008)
Contribution to Conference
3rd International Conference on Internet and Web Applications and Services, ICIW 2008  
Publisher DOI
10.1109/ICIW.2008.118
Scopus ID
2-s2.0-51049098896
Performance evaluation and execution management of service-oriented workflows became quite important in order to avoid performance degradation. Performance measurement is crucial to ensure that workflow execution remains feasible and that SLA violations due to overload are avoided. Network calculus as a well-known system theory for deterministic queuing systems can be used to describe the worst-case performance behavior of a workflow in order to plan workflow control in advance. Concerning business processes with high repetition rates the workflow controller has to be able to serve all incoming requests with an optimal composition of Web services. Thus, this paper presents a formal worst-case calculation model using the concepts of network calculus. Furthermore, optimization problems based on the worst-case scenario are introduced in order to minimize the worst-case delay and to maximize the throughput of the Web services invoked with minimal costs.
Subjects
Network calculus
Performance optimization
Quality of service
Service-oriented architecture
Web service workflow
DDC Class
600: Technology