Graph reduction for QoS prediction of cloud-service compositions Online publication date: Wed, 16-Jul-2014
by Yanik Ngoko; Christophe Cérin; Alfredo Goldman
International Journal of Business Process Integration and Management (IJBPIM), Vol. 7, No. 2, 2014
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.
Online publication date: Wed, 16-Jul-2014
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Business Process Integration and Management (IJBPIM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org