Intelligent Composition of Dynamic-Cost Services in Service-Oriented Architectures

G. A. Ebrahim
{"title":"Intelligent Composition of Dynamic-Cost Services in Service-Oriented Architectures","authors":"G. A. Ebrahim","doi":"10.1109/EMS.2011.51","DOIUrl":null,"url":null,"abstract":"Service-oriented architecture becomes a major computing practice in modern enterprise software systems. In several cases, the cost of the services could depend on the combination of the services utilized. In addition, there could be several constraints imposed on the service composition process. One of the important constraints is to impose an upper bound on the number of clients' usages of services in a period of time. Another important constraint is to restrict the number of service-providers that should be utilized. This constraint is normally needed to reduce the number of long-term relationships between the clients and the service-providers. In this paper, a new algorithm is introduced that tries to find the optimal set of services needed by the software designer to fit his computing requirements. It tries to minimize the overall incurred cost taking into consideration the dynamic-cost of the services occurred due to clients' usage patterns. In addition, it tries to minimize the number of service-providers utilized and maximize the overall QoS. In addition, it takes into account the constraints imposed on using the services. Genetic algorithms are adopted in tackling this problem, which are able to reach a near-optimal solution.","PeriodicalId":131364,"journal":{"name":"2011 UKSim 5th European Symposium on Computer Modeling and Simulation","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 UKSim 5th European Symposium on Computer Modeling and Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EMS.2011.51","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Service-oriented architecture becomes a major computing practice in modern enterprise software systems. In several cases, the cost of the services could depend on the combination of the services utilized. In addition, there could be several constraints imposed on the service composition process. One of the important constraints is to impose an upper bound on the number of clients' usages of services in a period of time. Another important constraint is to restrict the number of service-providers that should be utilized. This constraint is normally needed to reduce the number of long-term relationships between the clients and the service-providers. In this paper, a new algorithm is introduced that tries to find the optimal set of services needed by the software designer to fit his computing requirements. It tries to minimize the overall incurred cost taking into consideration the dynamic-cost of the services occurred due to clients' usage patterns. In addition, it tries to minimize the number of service-providers utilized and maximize the overall QoS. In addition, it takes into account the constraints imposed on using the services. Genetic algorithms are adopted in tackling this problem, which are able to reach a near-optimal solution.
面向服务体系结构中动态成本服务的智能组合
面向服务的体系结构成为现代企业软件系统的主要计算实践。在一些情况下,服务的成本可能取决于所使用的服务的组合。此外,可能会对服务组合过程施加一些约束。一个重要的约束是在一段时间内对客户端使用服务的数量施加上限。另一个重要的约束是限制应该使用的服务提供者的数量。通常需要此约束来减少客户机和服务提供者之间的长期关系的数量。本文介绍了一种新的算法,该算法试图找到软件设计者所需要的最优服务集,以满足其计算需求。考虑到由于客户的使用模式而产生的服务的动态成本,它试图最小化总成本。此外,它尝试最小化所使用的服务提供者的数量,并最大化总体QoS。此外,它还考虑了对使用服务施加的约束。采用遗传算法求解该问题,能够得到近似最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信