Mining models of composite web services for performance analysis

  • Authors:
  • Aiqiang Gao;Dongqing Yang;Shiwei Tang;Ming Zhang

  • Affiliations:
  • School of Electronics Engineering and Computer Science, Peking University, Beijing, China;School of Electronics Engineering and Computer Science, Peking University, Beijing, China;National Laboratory on Machine Perception, Peking University, Beijing, China;School of Electronics Engineering and Computer Science, Peking University, Beijing, China

  • Venue:
  • DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Web service composition provides a way to build value-added services and web applications by integrating and composing existing web services. In this paper, a composite web service is modeled using queueing network for the purpose of performance analysis. Each component web service participating the composite web service corresponds to one service center. The control flow between component web services is represented by the Markov chain that describes the transition of customers between service centers. To perform performance analysis, the Markov chain should be known first. However, a web service is usually a black box and only its interfaces can be seen externally, so the internal control flow can be only estimated from history execution logs. This paper gives a method that mines the Markov chain of a composite web service from its execution logs. Then, bottlenecks identification and performance analysis are conducted for the queueing network model. Experimental results show that this model mining method is effective and efficient.