A Cost-Effective Service Composition Method for Mass Customized QoS Requirements

2012 IEEE Ninth International Conference on Services Computing Pub Date : 2012-06-24 DOI:10.1109/SCC.2012.5

Zhongjie Wang, Fei Xu, Xiaofei Xu

{"title":"A Cost-Effective Service Composition Method for Mass Customized QoS Requirements","authors":"Zhongjie Wang, Fei Xu, Xiaofei Xu","doi":"10.1109/SCC.2012.5","DOIUrl":null,"url":null,"abstract":"We present a cost-effective service composition algorithm MC4MR aiming at mass customized QoS requirements. If a group of customers raise personalized QoS constraints on a given service, the algorithm looks for a finite number of composition solutions to meet these requirements and realize maximum benefit. To pursue higher cost-effectiveness, we combine multiple individualized requirements together and find a limited number of composition solutions that jointly satisfy them. The algorithm adopts the recursive and greedy strategies to reduce the computation complexity. Mass requirements are ordered according to the \"potential benefit (PB)\", requirements with higher PB are handled earlier, and subsequent ones are handled based on previously obtained solutions using three heuristic policies. The MC4MR algorithm is further simplified as an OC4MR algorithm (to look for one solution for multiple customized requirements) and an OC4OR algorithm (to look for one solution for one requirement). Experiments are conducted to compare performance and cost-effectiveness between MC4MR and traditional approaches, and some factors that impact the quality of solutions are explored.","PeriodicalId":178841,"journal":{"name":"2012 IEEE Ninth International Conference on Services Computing","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Ninth International Conference on Services Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCC.2012.5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

Abstract

We present a cost-effective service composition algorithm MC4MR aiming at mass customized QoS requirements. If a group of customers raise personalized QoS constraints on a given service, the algorithm looks for a finite number of composition solutions to meet these requirements and realize maximum benefit. To pursue higher cost-effectiveness, we combine multiple individualized requirements together and find a limited number of composition solutions that jointly satisfy them. The algorithm adopts the recursive and greedy strategies to reduce the computation complexity. Mass requirements are ordered according to the "potential benefit (PB)", requirements with higher PB are handled earlier, and subsequent ones are handled based on previously obtained solutions using three heuristic policies. The MC4MR algorithm is further simplified as an OC4MR algorithm (to look for one solution for multiple customized requirements) and an OC4OR algorithm (to look for one solution for one requirement). Experiments are conducted to compare performance and cost-effectiveness between MC4MR and traditional approaches, and some factors that impact the quality of solutions are explored.

查看原文本刊更多论文

大规模定制QoS需求的一种经济有效的服务组合方法

针对大规模定制QoS需求，提出了一种具有成本效益的服务组合算法MC4MR。如果一组客户对给定的服务提出个性化的QoS约束，算法会寻找有限数量的组合解决方案来满足这些要求，实现效益最大化。为了追求更高的成本效益，我们将多个个性化需求组合在一起，并找到有限数量的组合解决方案，共同满足他们。该算法采用递归和贪心策略，降低了计算复杂度。根据“潜在效益(PB)”对质量需求进行排序，PB较高的需求被较早处理，随后的需求根据先前获得的解决方案使用三种启发式策略进行处理。MC4MR算法进一步简化为OC4MR算法(为多个定制需求寻找一个解决方案)和OC4OR算法(为一个需求寻找一个解决方案)。通过实验比较了MC4MR和传统方法的性能和成本效益，并探讨了影响解决方案质量的一些因素。

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

求助全文

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

来源期刊

2012 IEEE Ninth International Conference on Services Computing

自引率

0.00%

发文量