Probabilistic qualitative preference matching in long-term IaaS composition
Author | Mistry, Sajib |
Author | Bouguettaya, Athman |
Author | Dong, Hai |
Author | Erradi, Abdelkarim |
Available date | 2023-04-10T09:10:06Z |
Publication Date | 2017 |
Publication Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Resource | Scopus |
Abstract | We propose a qualitative similarity measure approach to select an optimal set of probabilistic Infrastructure-as-a-Service (IaaS) requests according to the provider's probabilistic preferences over a long-term period. The long-term qualitative preferences are represented in probabilistic temporal CP-Nets. The preferences are indexed in a k-d tree to enable the multidimensional similarity measure using tree matching approaches. A probabilistic range sampling approach is proposed to reduce the large multidimensional search space in temporal CP-Nets. A probability distribution matching approach is proposed to reduce the approximation error in the similarity measure. Experimental results prove the feasibility of the proposed approach. Springer International Publishing AG 2017. |
Sponsor | Acknowledgements. This research was made possible by NPRP 7-481-1-088 grant from the Qatar National Research Fund (a member of The Qatar Foundation). The statements made herein are solely the responsibility of the authors. |
Language | en |
Publisher | Springer Verlag |
Subject | Infrastructure-as-a-Service (IaaS) qualitative similarity measure approach K-d tree CP-nets |
Type | Conference Paper |
Pagination | 256-271 |
Volume Number | 10601 LNCS |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |
This item appears in the following Collection(s)
-
Computer Science & Engineering [2286 items ]