The Experts below are selected from a list of 84 Experts worldwide ranked by ideXlab platform

Ming Zhang - One of the best experts on this subject based on the ideXlab platform.

  • Mining models of composite Web Services for performance analysis
    Lecture Notes in Computer Science, 2006
    Co-Authors: Aiqiang Gao, Dongqing Yang, Shiwei Tang, Ming Zhang
    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.

  • DASFAA - Mining models of composite Web Services for performance analysis
    Database Systems for Advanced Applications, 2006
    Co-Authors: Aiqiang Gao, Dongqing Yang, Shiwei Tang, Ming Zhang
    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.

Aiqiang Gao - One of the best experts on this subject based on the ideXlab platform.

  • Mining models of composite Web Services for performance analysis
    Lecture Notes in Computer Science, 2006
    Co-Authors: Aiqiang Gao, Dongqing Yang, Shiwei Tang, Ming Zhang
    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.

  • DASFAA - Mining models of composite Web Services for performance analysis
    Database Systems for Advanced Applications, 2006
    Co-Authors: Aiqiang Gao, Dongqing Yang, Shiwei Tang, Ming Zhang
    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.

Shiwei Tang - One of the best experts on this subject based on the ideXlab platform.

  • Mining models of composite Web Services for performance analysis
    Lecture Notes in Computer Science, 2006
    Co-Authors: Aiqiang Gao, Dongqing Yang, Shiwei Tang, Ming Zhang
    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.

  • DASFAA - Mining models of composite Web Services for performance analysis
    Database Systems for Advanced Applications, 2006
    Co-Authors: Aiqiang Gao, Dongqing Yang, Shiwei Tang, Ming Zhang
    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.

Dongqing Yang - One of the best experts on this subject based on the ideXlab platform.

  • Mining models of composite Web Services for performance analysis
    Lecture Notes in Computer Science, 2006
    Co-Authors: Aiqiang Gao, Dongqing Yang, Shiwei Tang, Ming Zhang
    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.

  • DASFAA - Mining models of composite Web Services for performance analysis
    Database Systems for Advanced Applications, 2006
    Co-Authors: Aiqiang Gao, Dongqing Yang, Shiwei Tang, Ming Zhang
    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.

Weiliang Zhao - One of the best experts on this subject based on the ideXlab platform.

  • ICSOC Workshops - Analyzing qos for Web Service compositions by QoSDIST
    Service-Oriented Computing, 2012
    Co-Authors: Huiyuan Zheng, Jian Yang, Weiliang Zhao
    Abstract:

    Quality of Service (QoS) analysis and prediction for Web Service compositions is an important and challenging issue in distributed computing. In existing work, QoS for Service compositions is either calculated based on constant QoS values or simulated based on probabilistic QoS distributions of Component Services. Simulation method is time consuming and can not be used in real-time applications for dynamic Web Service compositions. Experimental results in [5] show that our proposed QoS calculation approach significantly improves the efficiency in QoS estimation when the QoS of Component Web Services are probability distributions. In this paper, we present a tool QoSDIST to analyze the QoS for Web Service compositions based on our proposed QoS calculation method in [5]. QoSDIST does not put any constraints on the modeling of the QoS of Component Web Services, i.e., the QoS of a Component Web Service can be in single value, discrete values with frequencies, standard statistical distribution, or any general distribution regardless of its shape.

  • APSCC - QoSDIST: A QoS Probability Distribution Estimation Tool for Web Service Compositions
    2010 IEEE Asia-Pacific Services Computing Conference, 2010
    Co-Authors: Huiyuan Zheng, Jian Yang, Weiliang Zhao
    Abstract:

    In this paper, a QoS Distribution estimation Tool (QoSDIST) is developed to estimate the QoS distributions for Service compositions. QoSDIST can generate QoS probability distributions for Component Web Services. When estimating the QoS probability distribution for a Service composition, QoSDIST does not put any constraints on the representation of the QoSs of Component Web Services, i.e., the QoS of a Component Web Service can be in single value, discrete values with frequencies, standard statistical distribution, or any general distribution regardless of its shape, which can not be done by any existing approaches. Moreover, QoSDIST can deal with commonly used composition patterns, including loop with arbitrary exit points.

  • OTM Workshops - A tool for QoS probability distribution estimation of Web Service compositions
    On the Move to Meaningful Internet Systems: OTM 2010 Workshops, 2010
    Co-Authors: Huiyuan Zheng, Jian Yang, Weiliang Zhao
    Abstract:

    In this paper, we develop a QoS DIstribution Estimation Tool: QoSDIST for Service compositions. QoSDIST has the following functions which distinguish it from existing QoS estimation approaches: (1) QoSDIST can generate much more accurate QoS probability distributions for Component Web Services than existing methods [1]; (2) When estimating the QoS probability distribution for a Service composition, QoSDIST does not put any constraints on the representation of the QoSs of Component Web Services, i.e., the QoS of a Component Web Service can be in single value, discrete values with frequencies, standard statistical distribution, or any general distribution regardless of its shape, which can not be done by any existing approaches; (3) QoSDIST can deal with commonly used composition patterns, including loop with arbitrary exit points.