{"title":"端到端QoS约束和复杂收费模型下的成本最小化服务选择","authors":"René Ramacher, L. Mönch","doi":"10.1109/SCC.2012.18","DOIUrl":null,"url":null,"abstract":"The composition of services allows for achieving complex business requirements on top of already existing functionality, potentially procured from third party providers. Facing a growing market of services, enterprises have to select the most appropriate services to support their service compositions. Beside functional attributes the service selection is driven by nonfunctional properties like the price or the quality of a service. Taken into account quantity discounts, bundle effects, and subscription-based charging, complex service charging models are discussed in the literature of service marketing. Dynamic and complex charging models are expected to play an important role in the future service industry. Therefore, a service selection has to deal with those complex charging models in order to obtain a cost minimizing composition of services. In this paper, we present a cost minimizing service selection model based on mathematical programming that considers complex service charging models found in the literature. In addition to a pure cost minimizing point of view, the proposed model also takes into account end-to-end constrained quality of service (QoS) attributes like the execution time of service compositions. The conducted computational experiments demonstrate that the approach is applicable to solve problem instances of reasonable size.","PeriodicalId":178841,"journal":{"name":"2012 IEEE Ninth International Conference on Services Computing","volume":"98 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Cost-Minimizing Service Selection in the Presence of End-to-End QoS Constraints and Complex Charging Models\",\"authors\":\"René Ramacher, L. Mönch\",\"doi\":\"10.1109/SCC.2012.18\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The composition of services allows for achieving complex business requirements on top of already existing functionality, potentially procured from third party providers. Facing a growing market of services, enterprises have to select the most appropriate services to support their service compositions. Beside functional attributes the service selection is driven by nonfunctional properties like the price or the quality of a service. Taken into account quantity discounts, bundle effects, and subscription-based charging, complex service charging models are discussed in the literature of service marketing. Dynamic and complex charging models are expected to play an important role in the future service industry. Therefore, a service selection has to deal with those complex charging models in order to obtain a cost minimizing composition of services. In this paper, we present a cost minimizing service selection model based on mathematical programming that considers complex service charging models found in the literature. In addition to a pure cost minimizing point of view, the proposed model also takes into account end-to-end constrained quality of service (QoS) attributes like the execution time of service compositions. The conducted computational experiments demonstrate that the approach is applicable to solve problem instances of reasonable size.\",\"PeriodicalId\":178841,\"journal\":{\"name\":\"2012 IEEE Ninth International Conference on Services Computing\",\"volume\":\"98 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"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.18\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Ninth International Conference on Services Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCC.2012.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Cost-Minimizing Service Selection in the Presence of End-to-End QoS Constraints and Complex Charging Models
The composition of services allows for achieving complex business requirements on top of already existing functionality, potentially procured from third party providers. Facing a growing market of services, enterprises have to select the most appropriate services to support their service compositions. Beside functional attributes the service selection is driven by nonfunctional properties like the price or the quality of a service. Taken into account quantity discounts, bundle effects, and subscription-based charging, complex service charging models are discussed in the literature of service marketing. Dynamic and complex charging models are expected to play an important role in the future service industry. Therefore, a service selection has to deal with those complex charging models in order to obtain a cost minimizing composition of services. In this paper, we present a cost minimizing service selection model based on mathematical programming that considers complex service charging models found in the literature. In addition to a pure cost minimizing point of view, the proposed model also takes into account end-to-end constrained quality of service (QoS) attributes like the execution time of service compositions. The conducted computational experiments demonstrate that the approach is applicable to solve problem instances of reasonable size.