{"title":"面向服务体系结构中业务流程基于效用的最优服务选择","authors":"V. Dubey, D. Menascé","doi":"10.1109/ICWS.2010.33","DOIUrl":null,"url":null,"abstract":"Service Oriented Architectures enable markets of functionally equivalent service providers delivering services at different Quality of Service (QoS) and cost levels. Under these circumstances, there is a need for mechanisms to optimally select service providers at run-time to support a business process execution so that a utility function for the business process is maximized subject to QoS and cost constraints. This is an NP-hard problem. This paper investigates this problem when the utility function is expressed in terms of multiple QoS metrics. An efficient optimal algorithm is presented, which eliminates the need to exhaustively search the state space. This algorithm can be used for small to medium size problems. A very efficient heuristic solution is also presented and scientifically evaluated against the optimal solution on a large set of randomly generated business processes.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Utility-Based Optimal Service Selection for Business Processes in Service Oriented Architectures\",\"authors\":\"V. Dubey, D. Menascé\",\"doi\":\"10.1109/ICWS.2010.33\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Service Oriented Architectures enable markets of functionally equivalent service providers delivering services at different Quality of Service (QoS) and cost levels. Under these circumstances, there is a need for mechanisms to optimally select service providers at run-time to support a business process execution so that a utility function for the business process is maximized subject to QoS and cost constraints. This is an NP-hard problem. This paper investigates this problem when the utility function is expressed in terms of multiple QoS metrics. An efficient optimal algorithm is presented, which eliminates the need to exhaustively search the state space. This algorithm can be used for small to medium size problems. A very efficient heuristic solution is also presented and scientifically evaluated against the optimal solution on a large set of randomly generated business processes.\",\"PeriodicalId\":170573,\"journal\":{\"name\":\"2010 IEEE International Conference on Web Services\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Conference on Web Services\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICWS.2010.33\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Web Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICWS.2010.33","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Utility-Based Optimal Service Selection for Business Processes in Service Oriented Architectures
Service Oriented Architectures enable markets of functionally equivalent service providers delivering services at different Quality of Service (QoS) and cost levels. Under these circumstances, there is a need for mechanisms to optimally select service providers at run-time to support a business process execution so that a utility function for the business process is maximized subject to QoS and cost constraints. This is an NP-hard problem. This paper investigates this problem when the utility function is expressed in terms of multiple QoS metrics. An efficient optimal algorithm is presented, which eliminates the need to exhaustively search the state space. This algorithm can be used for small to medium size problems. A very efficient heuristic solution is also presented and scientifically evaluated against the optimal solution on a large set of randomly generated business processes.