Probabilistic qualitative preference matching in long-term IaaS composition
المؤلف | Mistry, Sajib |
المؤلف | Bouguettaya, Athman |
المؤلف | Dong, Hai |
المؤلف | Erradi, Abdelkarim |
تاريخ الإتاحة | 2023-04-10T09:10:06Z |
تاريخ النشر | 2017 |
اسم المنشور | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
المصدر | Scopus |
الملخص | 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. |
راعي المشروع | 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. |
اللغة | en |
الناشر | Springer Verlag |
الموضوع | Infrastructure-as-a-Service (IaaS) qualitative similarity measure approach K-d tree CP-nets |
النوع | Conference Paper |
الصفحات | 256-271 |
رقم المجلد | 10601 LNCS |
الملفات في هذه التسجيلة
الملفات | الحجم | الصيغة | العرض |
---|---|---|---|
لا توجد ملفات لها صلة بهذه التسجيلة. |
هذه التسجيلة تظهر في المجموعات التالية
-
علوم وهندسة الحاسب [2288 items ]