Search Swinburne Research Bank
Home
List of Titles
Probabilistic critical path identification for cost-effective monitoring of service-based web applications
List of Titles
Probabilistic critical path identification for cost-effective monitoring of service-based web applications
Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/224604
- Title
- Probabilistic critical path identification for cost-effective monitoring of service-based web applications
- Author(s)
- He, Qiang; Han, Jun; Yang, Yun; Schneider, Jean-Guy; Jin, Hai; Versteeg, Steve
- Abstract
- The critical path of a composite Web application operating in volatile environments, i.e., the execution path in the service composition with the maximum execution time, should be prioritised in cost-effective monitoring as it determines the response time of the Web application. In volatile operating environments, the critical path of a Web application is probabilistic. As such, it is important to estimate the criticalities of the execution paths, i.e., the probabilities that they are critical, to decide which parts of the system to monitor. We propose a novel approach to the identification of Probabilistic Critical Path for Service-based Web Applications (PCP-SWA), which calculates the criticalities of different execution paths in the context of service composition. We evaluate PCP-SWA experimentally using an example Web application. Compared to random monitoring, PCP-SWA based monitoring is 55.67% more cost-effective on average.
- Publication type
- Conference poster
- Research centre
- Swinburne University of Technology. Faculty of Information and Communication Technologies
- Source
- Proceedings of the 21st Annual World Wide Web Conference (WWW 2012), Lyon, France, 16-20 April 2012, pp. 523-524
- Publication year
- 2012
- Keyword(s)
- Critical paths; Monitoring; Service composition; Web application; Web services
- Publisher
- ACM
- ISBN
- 9781450312301, 1450312306
- Publisher URL
- http://dx.doi.org/10.1145/2187980.2188108
- Copyright
- Copyright © is held by the author/owner(s).
- Additional information
- The authors acknowledge support from the Australian Research Council in collaboration with CA Labs.
- Peer reviewed


