Optimizing cost and response time for data intensive services' composition based on ABC algorithm

2015 5th International Conference on Information & Communication Technology and Accessibility (ICTA) Pub Date : 2015-12-01 DOI:10.1109/ICTA.2015.7426888

A. Bousrih, Zaki Brahmi

{"title":"Optimizing cost and response time for data intensive services' composition based on ABC algorithm","authors":"A. Bousrih, Zaki Brahmi","doi":"10.1109/ICTA.2015.7426888","DOIUrl":null,"url":null,"abstract":"Various experts, large institutions (like the US MIT 1) administrations and specialists in the field of technology consider data-intensive services as one of the major IT challenges of the 2010-2020 decade and made it one of their new priorities for researches and development. This type of application is observed in several scientific fields such as biology, astronomy, cosmology, social sciences and climate. Considering data-intensive Web services and the cloud together, where data play the dominant role in the execution of the data-intensive service composition, the cost and response time of data sets and services influence the quality of the whole composition. Thus, we propose a novel approach towards minimizing cost response time and energy consumption for composite data-intensive services. It uses the artificial bee colony algorithm in order to select and find the optimal cost and response time of a data-intensive service. The newly composed data-intensive service will be an outstanding contribution to composite data-intense services research.","PeriodicalId":375443,"journal":{"name":"2015 5th International Conference on Information & Communication Technology and Accessibility (ICTA)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 5th International Conference on Information & Communication Technology and Accessibility (ICTA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTA.2015.7426888","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

Abstract

Various experts, large institutions (like the US MIT 1) administrations and specialists in the field of technology consider data-intensive services as one of the major IT challenges of the 2010-2020 decade and made it one of their new priorities for researches and development. This type of application is observed in several scientific fields such as biology, astronomy, cosmology, social sciences and climate. Considering data-intensive Web services and the cloud together, where data play the dominant role in the execution of the data-intensive service composition, the cost and response time of data sets and services influence the quality of the whole composition. Thus, we propose a novel approach towards minimizing cost response time and energy consumption for composite data-intensive services. It uses the artificial bee colony algorithm in order to select and find the optimal cost and response time of a data-intensive service. The newly composed data-intensive service will be an outstanding contribution to composite data-intense services research.

查看原文本刊更多论文

基于ABC算法的数据密集型业务组合成本和响应时间优化

各种专家、大型机构(如美国麻省理工学院)管理部门和技术领域的专家认为，数据密集型服务是2010-2020年十年的主要IT挑战之一，并将其作为研究和开发的新重点之一。这种类型的应用在生物学、天文学、宇宙学、社会科学和气候等几个科学领域都可以观察到。同时考虑数据密集型Web服务和云，其中数据在数据密集型服务组合的执行中起主导作用，数据集和服务的成本和响应时间会影响整个组合的质量。因此，我们提出了一种新的方法来最小化复合数据密集型服务的成本、响应时间和能耗。它采用人工蜂群算法来选择和寻找数据密集型服务的最优成本和响应时间。新组合的数据密集型服务将是对组合数据密集型服务研究的突出贡献。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2015 5th International Conference on Information & Communication Technology and Accessibility (ICTA)

自引率

0.00%

发文量