Dynamic service adaptation for cost minimization of composite cloud service under stochastic runtime performance

碩士 === 國立臺中教育大學 === 資訊工程學系 === 104 === In recent years, cloud computing has become the most popular next-generation computing platform. Software as a Service (SaaS) based on Service-Oriented Architecture (SOA) is transforming how developers construct software and how users access software service on...

Full description

Bibliographic Details
Main Authors: Lu,Sin-Ji, 盧信吉
Other Authors: Huang,Kuo‑Chan
Format: Others
Language:zh-TW
Published: 2016
Online Access:http://ndltd.ncl.edu.tw/handle/4j76rp
id ndltd-TW-104NTCT0394001
record_format oai_dc
spelling ndltd-TW-104NTCT03940012019-05-15T22:43:15Z http://ndltd.ncl.edu.tw/handle/4j76rp Dynamic service adaptation for cost minimization of composite cloud service under stochastic runtime performance 以降低成本為目標之組合式雲端服務動態調整策略以降低服務執行時間不確定性之影響 Lu,Sin-Ji 盧信吉 碩士 國立臺中教育大學 資訊工程學系 104 In recent years, cloud computing has become the most popular next-generation computing platform. Software as a Service (SaaS) based on Service-Oriented Architecture (SOA) is transforming how developers construct software and how users access software service on cloud computing platform. Service selection is one of the challenging problems when developing composite cloud services. Service selection can be seen as a optimization problem under the constraint of the service level agreement (SLA) between service providers and users. This thesis explores the service selection problem in dynamic cloud environments where service performance varies dynamically. The goal is to select a set of appropriate services to reduce the total cost of running a composite cloud service as most as possible, considering the constraint of SLA. This thesis presents three new service selection methods. The first method is an iterative approach based on Chebyshev’s theorem and integer linear programming. The second method adopts a dynamic service adjustment strategy during the execution of a composite cloud service. The finish of each task will trigger service reselection for remaining tasks based on the updated constraint. The third method applies nonlinear programming. It takes dynamic performance variation into consideration in the target function of the formulated nonlinear programming problem, avoiding the iterative computing process in the previous two methods. We conducted a series of simulation experiments to evaluate and compare the three service selection methods and compared them to the previous approach in the literatutre. Experimental results show that our methods outperform the previous approach, having potential to further reduce the total cost of running composite cloud services. Huang,Kuo‑Chan 黃國展 2016 學位論文 ; thesis 54 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 國立臺中教育大學 === 資訊工程學系 === 104 === In recent years, cloud computing has become the most popular next-generation computing platform. Software as a Service (SaaS) based on Service-Oriented Architecture (SOA) is transforming how developers construct software and how users access software service on cloud computing platform. Service selection is one of the challenging problems when developing composite cloud services. Service selection can be seen as a optimization problem under the constraint of the service level agreement (SLA) between service providers and users. This thesis explores the service selection problem in dynamic cloud environments where service performance varies dynamically. The goal is to select a set of appropriate services to reduce the total cost of running a composite cloud service as most as possible, considering the constraint of SLA. This thesis presents three new service selection methods. The first method is an iterative approach based on Chebyshev’s theorem and integer linear programming. The second method adopts a dynamic service adjustment strategy during the execution of a composite cloud service. The finish of each task will trigger service reselection for remaining tasks based on the updated constraint. The third method applies nonlinear programming. It takes dynamic performance variation into consideration in the target function of the formulated nonlinear programming problem, avoiding the iterative computing process in the previous two methods. We conducted a series of simulation experiments to evaluate and compare the three service selection methods and compared them to the previous approach in the literatutre. Experimental results show that our methods outperform the previous approach, having potential to further reduce the total cost of running composite cloud services.
author2 Huang,Kuo‑Chan
author_facet Huang,Kuo‑Chan
Lu,Sin-Ji
盧信吉
author Lu,Sin-Ji
盧信吉
spellingShingle Lu,Sin-Ji
盧信吉
Dynamic service adaptation for cost minimization of composite cloud service under stochastic runtime performance
author_sort Lu,Sin-Ji
title Dynamic service adaptation for cost minimization of composite cloud service under stochastic runtime performance
title_short Dynamic service adaptation for cost minimization of composite cloud service under stochastic runtime performance
title_full Dynamic service adaptation for cost minimization of composite cloud service under stochastic runtime performance
title_fullStr Dynamic service adaptation for cost minimization of composite cloud service under stochastic runtime performance
title_full_unstemmed Dynamic service adaptation for cost minimization of composite cloud service under stochastic runtime performance
title_sort dynamic service adaptation for cost minimization of composite cloud service under stochastic runtime performance
publishDate 2016
url http://ndltd.ncl.edu.tw/handle/4j76rp
work_keys_str_mv AT lusinji dynamicserviceadaptationforcostminimizationofcompositecloudserviceunderstochasticruntimeperformance
AT lúxìnjí dynamicserviceadaptationforcostminimizationofcompositecloudserviceunderstochasticruntimeperformance
AT lusinji yǐjiàngdīchéngběnwèimùbiāozhīzǔhéshìyúnduānfúwùdòngtàidiàozhěngcèlüèyǐjiàngdīfúwùzhíxíngshíjiānbùquèdìngxìngzhīyǐngxiǎng
AT lúxìnjí yǐjiàngdīchéngběnwèimùbiāozhīzǔhéshìyúnduānfúwùdòngtàidiàozhěngcèlüèyǐjiàngdīfúwùzhíxíngshíjiānbùquèdìngxìngzhīyǐngxiǎng
_version_ 1719134785360625664