Services Computing has turned into the mainstream programming paradigm for building enterprise systems that are distributed in nature. However, the programming power available to the developers of service oriented systems has been slow to catch up. The object abstraction continues to be the prevalent mechanism for implementing services based software systems and has several drawbacks. A key drawback is the fact that programmers are provided the business requirements in terms of services but are expected to implement them using objects, leading to an abstraction gap that the programmer is expected to fill. In this paper, we formalize the notion of services as first class entities through a typed calculus, called Psi-CAL. Psi-CAL models major operations for service manipulation including creation, discovery, and invocation as well as establishing relationships among services. We present the syntax and semantics of Psi-CAL with a corresponding type system, towards building a programming language for services computing.
{"title":"Psi-CAL: Foundations of a Programming Language for Services Computing","authors":"Arun Kumar, Vineet Rajani, D. Ram","doi":"10.1109/SCC.2013.50","DOIUrl":"https://doi.org/10.1109/SCC.2013.50","url":null,"abstract":"Services Computing has turned into the mainstream programming paradigm for building enterprise systems that are distributed in nature. However, the programming power available to the developers of service oriented systems has been slow to catch up. The object abstraction continues to be the prevalent mechanism for implementing services based software systems and has several drawbacks. A key drawback is the fact that programmers are provided the business requirements in terms of services but are expected to implement them using objects, leading to an abstraction gap that the programmer is expected to fill. In this paper, we formalize the notion of services as first class entities through a typed calculus, called Psi-CAL. Psi-CAL models major operations for service manipulation including creation, discovery, and invocation as well as establishing relationships among services. We present the syntax and semantics of Psi-CAL with a corresponding type system, towards building a programming language for services computing.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128453937","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Accurate and rapid evaluation of web service performance is a key problem of Service-Oriented Architecture (SOA), where services are continuously being (re-)designed and released, and integrated within heterogeneous environments. Unfortunately, pre-deployment testing of services is not suitable to evaluate service performance at both design time and runtime. As a result, often process designers get a reliable assessment of service performance only very late in the lifecycle, once services have been deployed, while customers cannot evaluate service behavior at selection time. In this paper we tackle these problems by proposing a methodology that generates a simulation script that can be used for an early assessment of service performance, and to negotiate and evaluate SLAs on service performance at runtime.
{"title":"Early Assessment of Service Performance Based on Simulation","authors":"C. Ardagna, E. Damiani, K. Sagbo","doi":"10.1109/SCC.2013.80","DOIUrl":"https://doi.org/10.1109/SCC.2013.80","url":null,"abstract":"Accurate and rapid evaluation of web service performance is a key problem of Service-Oriented Architecture (SOA), where services are continuously being (re-)designed and released, and integrated within heterogeneous environments. Unfortunately, pre-deployment testing of services is not suitable to evaluate service performance at both design time and runtime. As a result, often process designers get a reliable assessment of service performance only very late in the lifecycle, once services have been deployed, while customers cannot evaluate service behavior at selection time. In this paper we tackle these problems by proposing a methodology that generates a simulation script that can be used for an early assessment of service performance, and to negotiate and evaluate SLAs on service performance at runtime.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122542354","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Besides performance, dependability and energy efficiency are two critical concerns during the design, development and management of large-scale services computing systems. In this paper, we jointly consider the performance, dependability and energy efficiency, and optimize the dependability-aware energy efficiency of services computing systems by maximizing the quality of service and dependability revenue and minimizing energy costs. Markov reward models are put forward, and quantitative analysis of them is carried out. In addition, the methodologies for hierarchical model composition and state aggregation are proposed. Furthermore, the optimization problem is formulated as an average reward criterion Markov decision problem, and the algorithm to solve it is introduced. Finally, the LANL service systems are analyzed and optimized as a case study to illuminate how this approach can apply to large-scale systems in reality.
{"title":"Modeling, Analysis and Optimization of Dependability-Aware Energy Efficiency in Services Computing Systems","authors":"Jiwei Huang, Chuang Lin, Jianxiong Wan","doi":"10.1109/SCC.2013.63","DOIUrl":"https://doi.org/10.1109/SCC.2013.63","url":null,"abstract":"Besides performance, dependability and energy efficiency are two critical concerns during the design, development and management of large-scale services computing systems. In this paper, we jointly consider the performance, dependability and energy efficiency, and optimize the dependability-aware energy efficiency of services computing systems by maximizing the quality of service and dependability revenue and minimizing energy costs. Markov reward models are put forward, and quantitative analysis of them is carried out. In addition, the methodologies for hierarchical model composition and state aggregation are proposed. Furthermore, the optimization problem is formulated as an average reward criterion Markov decision problem, and the algorithm to solve it is introduced. Finally, the LANL service systems are analyzed and optimized as a case study to illuminate how this approach can apply to large-scale systems in reality.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129259596","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In a typical cloud computing environment, there will always be different kinds of cloud resources and a number of cloud services making use of cloud resources to run on. As we can see, these cloud services usually have different performance traits. Some may be IO-intensive, like those data querying services, while others might demand more CPU cycles, like 3D image processing services. Meanwhile, cloud resources also have different kinds of capabilities such as data processing, IO throughput, 3D image rendering, etc. A simple fact is that allocating a suitable resource will greatly improve the performance of the cloud service, and make the cloud resource itself more efficient as well. So it is important for the providers to allocate cloud resources based on the fitness of performance traits between resources and services. In this paper, we introduce a new cloud resource allocating algorithm, which creates a market for cloud resources and makes the resource agents and service agents bargain in that market. In this way, use is able to be made of the invisible hand behind the market to grantee the efficiency of allocation. The auction model in our algorithm is new to other auction models in that it takes the effectiveness of fitness between resources and services into consideration during the auction procedures. With the idea of fitness introduced, the bargaining process and final price calculation is modified, so that resources and services can not only trade-off between those such as prices, budgets and the required level of QoS, but also on fitness amongst bidders. We study the allocating algorithm in terms of economic efficiency and system performance, and experiments show that the allocation is far more efficient in comparison with the continuous double auction in which the idea of fitness is not introduced.
{"title":"A Novel Approach to Allocate Cloud Resource with Different Performance Traits","authors":"Zuling Kang, Hongbing Wang","doi":"10.1109/SCC.2013.109","DOIUrl":"https://doi.org/10.1109/SCC.2013.109","url":null,"abstract":"In a typical cloud computing environment, there will always be different kinds of cloud resources and a number of cloud services making use of cloud resources to run on. As we can see, these cloud services usually have different performance traits. Some may be IO-intensive, like those data querying services, while others might demand more CPU cycles, like 3D image processing services. Meanwhile, cloud resources also have different kinds of capabilities such as data processing, IO throughput, 3D image rendering, etc. A simple fact is that allocating a suitable resource will greatly improve the performance of the cloud service, and make the cloud resource itself more efficient as well. So it is important for the providers to allocate cloud resources based on the fitness of performance traits between resources and services. In this paper, we introduce a new cloud resource allocating algorithm, which creates a market for cloud resources and makes the resource agents and service agents bargain in that market. In this way, use is able to be made of the invisible hand behind the market to grantee the efficiency of allocation. The auction model in our algorithm is new to other auction models in that it takes the effectiveness of fitness between resources and services into consideration during the auction procedures. With the idea of fitness introduced, the bargaining process and final price calculation is modified, so that resources and services can not only trade-off between those such as prices, budgets and the required level of QoS, but also on fitness amongst bidders. We study the allocating algorithm in terms of economic efficiency and system performance, and experiments show that the allocation is far more efficient in comparison with the continuous double auction in which the idea of fitness is not introduced.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127826594","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Security issues of cloud computing are always being concerned by customers. Research on a virtual machine's quantitative or qualitative value of risk will be a good start to know the security status of a cloud data center. Risk assessment is a solution for really understanding security procedures of the network and information system, analyzing where security threats come from and how much loss the risk can cause. By means of the combination of risk assessment with cloud computing, we can assess the risk value of virtual machines, and the security of data center can be ensured by administrator who has ability to quickly locate the risk points and easily control and reduce the risks. In this paper, we present VMRaS (a novel virtual machine risk assessment scheme in the cloud environment), a scheme that can assess the risk of a virtual machine. First, we introduce the process, criteria and algorithms of risk assessment. And then we present the design and implementation of VMRaS. We evaluate a prototype of VMRaS which is deployed on an Open Stack-based cloud computing resource management platform. The result shows that VMRaS works well in the Open Stack-based cloud environment.
{"title":"VMRaS: A Novel Virtual Machine Risk Assessment Scheme in the Cloud Environment","authors":"SiFan Liu, Jie Wu, Zhihui Lu, Hui Xiong","doi":"10.1109/SCC.2013.12","DOIUrl":"https://doi.org/10.1109/SCC.2013.12","url":null,"abstract":"Security issues of cloud computing are always being concerned by customers. Research on a virtual machine's quantitative or qualitative value of risk will be a good start to know the security status of a cloud data center. Risk assessment is a solution for really understanding security procedures of the network and information system, analyzing where security threats come from and how much loss the risk can cause. By means of the combination of risk assessment with cloud computing, we can assess the risk value of virtual machines, and the security of data center can be ensured by administrator who has ability to quickly locate the risk points and easily control and reduce the risks. In this paper, we present VMRaS (a novel virtual machine risk assessment scheme in the cloud environment), a scheme that can assess the risk of a virtual machine. First, we introduce the process, criteria and algorithms of risk assessment. And then we present the design and implementation of VMRaS. We evaluate a prototype of VMRaS which is deployed on an Open Stack-based cloud computing resource management platform. The result shows that VMRaS works well in the Open Stack-based cloud environment.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127834075","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. S. Sulong, Azlianor Abdul-Aziz, A. Koronios, Jing Gao
The focus of many organisations shifts towards a new initiative, specifically service-oriented architecture (SOA). The use of SOA enables high-level application integration and the orchestration of business processes in order to realise its full value, including agility and reusability. This shapes the thinking of architects and developers when it comes leveraging computing and information technology (IT) to model, create, operate and manage business processes as services. However, applying SOA initiatives without considering the quality of information makes it impossible for organisations to succeed. Many researchers have looked at the area of information quality (IQ) in terms of the technical aspects of SOA, but there is a gap in the literature when it comes to the process of implementing and deploying an enterprise-wide SOA as a phased, evolutionary process. Thus, this article discusses the importance of IQ throughout the implementation of SOA initiatives. SOA team members from seven case organisations which have been carrying out SOA initiatives were interviewed to gain in-depth insights into IQ in these firms. The results from these various real-world experiences indicate that tying together these two distinctive areas - SOA initiatives and IQ strategy - has a positive effect for a broader audience.
{"title":"The Importance of Considering Information Quality in the Implementation of Service-Oriented Architecture Initiatives","authors":"M. S. Sulong, Azlianor Abdul-Aziz, A. Koronios, Jing Gao","doi":"10.1109/SCC.2013.22","DOIUrl":"https://doi.org/10.1109/SCC.2013.22","url":null,"abstract":"The focus of many organisations shifts towards a new initiative, specifically service-oriented architecture (SOA). The use of SOA enables high-level application integration and the orchestration of business processes in order to realise its full value, including agility and reusability. This shapes the thinking of architects and developers when it comes leveraging computing and information technology (IT) to model, create, operate and manage business processes as services. However, applying SOA initiatives without considering the quality of information makes it impossible for organisations to succeed. Many researchers have looked at the area of information quality (IQ) in terms of the technical aspects of SOA, but there is a gap in the literature when it comes to the process of implementing and deploying an enterprise-wide SOA as a phased, evolutionary process. Thus, this article discusses the importance of IQ throughout the implementation of SOA initiatives. SOA team members from seven case organisations which have been carrying out SOA initiatives were interviewed to gain in-depth insights into IQ in these firms. The results from these various real-world experiences indicate that tying together these two distinctive areas - SOA initiatives and IQ strategy - has a positive effect for a broader audience.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126535806","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Zhongjun Liang, Hua Zou, Jing Guo, Fangchun Yang, Rongheng Lin
In this paper, we study a new framework for multi-user Web services selection problem, which aims to select best candidates to meet multi-user's requirements. However, the unavoidable challenges in this problem are the efficiency and effect. Most existing methods are proposed for the single request condition without considering the overload of Web services, which cannot be directly used in this problem. Furthermore, existing methods assumed the QoS information for users are all known and accurate, and in real case, there are always many missing QoS values in history records, which increase the difficulty of the selection. In this paper, we propose a new framework for multi-user Web services selection problem. This framework first predicts the missing multi-QoS values according to the historical QoS experience from different users, and then selects the global optimal solution for multi-user by our fast match approach. Comprehensive empirical studies demonstrate the utility of the proposed method.
{"title":"Selecting Web Service for Multi-user Based on Multi-QoS Prediction","authors":"Zhongjun Liang, Hua Zou, Jing Guo, Fangchun Yang, Rongheng Lin","doi":"10.1109/SCC.2013.35","DOIUrl":"https://doi.org/10.1109/SCC.2013.35","url":null,"abstract":"In this paper, we study a new framework for multi-user Web services selection problem, which aims to select best candidates to meet multi-user's requirements. However, the unavoidable challenges in this problem are the efficiency and effect. Most existing methods are proposed for the single request condition without considering the overload of Web services, which cannot be directly used in this problem. Furthermore, existing methods assumed the QoS information for users are all known and accurate, and in real case, there are always many missing QoS values in history records, which increase the difficulty of the selection. In this paper, we propose a new framework for multi-user Web services selection problem. This framework first predicts the missing multi-QoS values according to the historical QoS experience from different users, and then selects the global optimal solution for multi-user by our fast match approach. Comprehensive empirical studies demonstrate the utility of the proposed method.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121956568","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Business processes have been identified as effective means to developing service-based applications. It is an important and challenging research problem to check consistency between conceptual and executable business processes. Most existing approaches analyze the consistency based on qualitative equivalence relations between business processes and only provide a "true"/"false" result. Thus, they fail to differentiate slight inconsistency scenarios from totally inconsistency ones. To address this problem, we leverage activity constraints, i.e., partial orders, mutual-exclusions, and independences, to analyze consistency, and measure the consistency degree (ranging from 0 to 1.0) between a conceptual business process and an executable one based on the rate of consistent activity constraints. We show the applicability of our approach by analyzing the consistency between public views and private processes of some real-life BPEL processes.
{"title":"Quantifying Consistency between Conceptual and Executable Business Processes","authors":"Wei Song, Wenjia Zhang, Gongxuan Zhang, Junhua Ding, Xuewei Zhang","doi":"10.1109/SCC.2013.47","DOIUrl":"https://doi.org/10.1109/SCC.2013.47","url":null,"abstract":"Business processes have been identified as effective means to developing service-based applications. It is an important and challenging research problem to check consistency between conceptual and executable business processes. Most existing approaches analyze the consistency based on qualitative equivalence relations between business processes and only provide a \"true\"/\"false\" result. Thus, they fail to differentiate slight inconsistency scenarios from totally inconsistency ones. To address this problem, we leverage activity constraints, i.e., partial orders, mutual-exclusions, and independences, to analyze consistency, and measure the consistency degree (ranging from 0 to 1.0) between a conceptual business process and an executable one based on the rate of consistent activity constraints. We show the applicability of our approach by analyzing the consistency between public views and private processes of some real-life BPEL processes.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122163908","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yasuhiko Kanemasa, Qingyang Wang, Jack Li, Masazumi Matsubara, C. Pu
Performance unpredictability is one of the major concerns slowing down the migration of mission-critical applications into cloud computing infrastructures. An example of non-intuitive result is the measured n-tier application performance in a virtualized environment that showed increasing workload caused a competing, co-located constant workload to decrease its response time. In this paper, we investigate the sensitivity of measured performance in relation to two factors: (1) consolidated server specification of virtual machine resource availability, and (2) burstiness of n-tier application workload. Our first and surprising finding is that specifying a complete isolation, e.g., 50-50 even split of CPU between two co-located virtual machines (VMs) results in significantly lower performance compared to a fully-shared allocation, e.g., up to 100% CPU for both co-located VMs. This happens even at relatively modest resource utilization levels (e.g., 40% CPU in the VMs). Second, we found that an increasingly bursty workload also increases the performance loss among the consolidated servers, even at similarly modest utilization levels (e.g., 70% overall). A potential solution to the first problem (performance loss due to resource allocation) is cross-tier-priority scheduling (giving higher priority to shorter jobs), which can reduce the performance loss by a factor of two in our experiments. In contrast, bursty workloads are a more difficult problem: our measurements show they affect both the isolation and sharing strategies in virtual machine resource allocation.
{"title":"Revisiting Performance Interference among Consolidated n-Tier Applications: Sharing is Better Than Isolation","authors":"Yasuhiko Kanemasa, Qingyang Wang, Jack Li, Masazumi Matsubara, C. Pu","doi":"10.1109/SCC.2013.42","DOIUrl":"https://doi.org/10.1109/SCC.2013.42","url":null,"abstract":"Performance unpredictability is one of the major concerns slowing down the migration of mission-critical applications into cloud computing infrastructures. An example of non-intuitive result is the measured n-tier application performance in a virtualized environment that showed increasing workload caused a competing, co-located constant workload to decrease its response time. In this paper, we investigate the sensitivity of measured performance in relation to two factors: (1) consolidated server specification of virtual machine resource availability, and (2) burstiness of n-tier application workload. Our first and surprising finding is that specifying a complete isolation, e.g., 50-50 even split of CPU between two co-located virtual machines (VMs) results in significantly lower performance compared to a fully-shared allocation, e.g., up to 100% CPU for both co-located VMs. This happens even at relatively modest resource utilization levels (e.g., 40% CPU in the VMs). Second, we found that an increasingly bursty workload also increases the performance loss among the consolidated servers, even at similarly modest utilization levels (e.g., 70% overall). A potential solution to the first problem (performance loss due to resource allocation) is cross-tier-priority scheduling (giving higher priority to shorter jobs), which can reduce the performance loss by a factor of two in our experiments. In contrast, bursty workloads are a more difficult problem: our measurements show they affect both the isolation and sharing strategies in virtual machine resource allocation.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125617978","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Configurable process models can be used to provide information on business processes for different user groups in an appropriate and efficient manner. It promotes the reuse of proven practices by providing analysts with a generic modeling artifact from which to derive individual process models. Before a configurable business process being configured into a concrete business process model, the variability points of the configurable business process need to be identified. The decision on how to bind these variation points boils down to the users' requirements and needs. Given the specified requirements of the users, the configurable business process can be configured. In the paper, we propose a framework for carrying out automatic service-based business process configuration by using SWRL based business rules. We design and implement a variation point ontology, in which the guidelines of variable points are presented by SWRL rules. We also summarize a set of domain-specific business rules too, thus we can use these domain-specific rules to get the specific rules needed to meet users' requirements. We exploit domain ontology as knowledge base and rules as guideline to configure business process, for the purpose of individual configuration. Then we employ a configuration algorithm to configure a configurable business process depending on the reference result we obtain. The approach is validated by a case study from the domain of the urban logistics distribution.
{"title":"Ontology-Based Configuration for Service-Based Business Process Model","authors":"Ying Huang, Zaiwen Feng, K. He, Yiwang Huang","doi":"10.1109/SCC.2013.59","DOIUrl":"https://doi.org/10.1109/SCC.2013.59","url":null,"abstract":"Configurable process models can be used to provide information on business processes for different user groups in an appropriate and efficient manner. It promotes the reuse of proven practices by providing analysts with a generic modeling artifact from which to derive individual process models. Before a configurable business process being configured into a concrete business process model, the variability points of the configurable business process need to be identified. The decision on how to bind these variation points boils down to the users' requirements and needs. Given the specified requirements of the users, the configurable business process can be configured. In the paper, we propose a framework for carrying out automatic service-based business process configuration by using SWRL based business rules. We design and implement a variation point ontology, in which the guidelines of variable points are presented by SWRL rules. We also summarize a set of domain-specific business rules too, thus we can use these domain-specific rules to get the specific rules needed to meet users' requirements. We exploit domain ontology as knowledge base and rules as guideline to configure business process, for the purpose of individual configuration. Then we employ a configuration algorithm to configure a configurable business process depending on the reference result we obtain. The approach is validated by a case study from the domain of the urban logistics distribution.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130718572","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：