Graph reduction for QoS prediction of cloud-service compositions. (1st January 2014)

• Record Type: Journal Article
• Authors: Ngoko, Yanik; Cérin, Christophe; Goldman, Alfredo
• Is Part Of: International journal of business process integration and management. Volume 7:Number 2(2014)
• Page Start: 89
• Page End: 102
• Publication Date: 2014-01-01
• Subjects: services compositions in clouds -- business process -- graph reduction -- QoS prediction -- performance variability; Business -- Computer networks -- Periodicals; Industrial management -- Periodicals; 658.054605
• Languages: English
• ISSNs: 1741-8763

Abstract

This paper deals with the graph reduction approach for the QoS prediction of cloud-services' compositions. Most works with graph reduction are based on a deterministic modelling of the QoS. Though interesting, these representations are not suitable for cloud environments because they neglect the QoS variations. On clouds, we propose to use a probabilistic modelling in which the QoS of an operation is drawn from a finite set of discrete values, according to a Probability Mass Function (PMF). This paper proposes to adapt an existing graph reduction algorithm for such representations. Our first contribution is to show that there is a potential combinatorial explosion when running the reduction algorithm with the probabilistic representation. Our second contribution is to propose two heuristics in which the combinatorial explosion is controlled. The heuristics are based on two classical ideas in arithmetic: truncation and rounding. Our last contribution is an experimental comparison of the heuristics.