{"title":"面向服务体系结构中动态成本服务的智能组合","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":"{\"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}","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}
Intelligent Composition of Dynamic-Cost Services in Service-Oriented Architectures
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.