Today, the success of a cloud system significantly relies on its availability and reliability. To achieve a better availability, fault recovery must be performed in an efficient way. When no backup is available, service re-composition becomes the only option. Although many semantic approaches for service re-composition have been proposed, they all seem to be time-consuming, and service granularity still remains as an open question. In this paper, we introduce an efficient service re-composition approach using semantic augmentation and a fast service granularity selection so that a faulty service can be replaced promptly. A semantic service matching mechanism is also proposed for discovering appropriate candidate services for re-composition. The experiment results from a cloud environment confirm the advantages of our approach.
{"title":"Efficient Service Re-composition Using Semantic Augmentation for Fast Cloud Fault Recovery","authors":"Zhengping Wu, Nailu Chu","doi":"10.1109/SCC.2013.78","DOIUrl":"https://doi.org/10.1109/SCC.2013.78","url":null,"abstract":"Today, the success of a cloud system significantly relies on its availability and reliability. To achieve a better availability, fault recovery must be performed in an efficient way. When no backup is available, service re-composition becomes the only option. Although many semantic approaches for service re-composition have been proposed, they all seem to be time-consuming, and service granularity still remains as an open question. In this paper, we introduce an efficient service re-composition approach using semantic augmentation and a fast service granularity selection so that a faulty service can be replaced promptly. A semantic service matching mechanism is also proposed for discovering appropriate candidate services for re-composition. The experiment results from a cloud environment confirm the advantages of our approach.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"4 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":"134618051","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 service computing, the quality of service (QoS) has been used to distinguish different services. Many service recommendation schemes predict how a customer might rate the QoS of various services. Based on the predicted ratings, they recommend services to the customer. Most of these schemes do not consider the unfair rating problem. As the QoS rating of a service can determine whether the service is chosen by a customer, malicious users and services might explore the weakness of the existing schemes in handling unfair ratings to gain commercial advantage. This paper proposed a service recommendation scheme that is robust against unfair rating. When predicting a customer's QoS rating for a service, the proposed scheme takes into account of the ratings given to the service by the users that are similar to the customer, the ratings that the service gained from the typical users and the own experience of the customer. Experiments with the proposed scheme show that (a) the scheme has good prediction accuracy, and (b) it can counter the manipulations by the malicious users and services effectively.
{"title":"A Robust Service Recommendation Scheme","authors":"Xinfeng Ye, J. Zheng, B. Khoussainov","doi":"10.1109/SCC.2013.105","DOIUrl":"https://doi.org/10.1109/SCC.2013.105","url":null,"abstract":"In service computing, the quality of service (QoS) has been used to distinguish different services. Many service recommendation schemes predict how a customer might rate the QoS of various services. Based on the predicted ratings, they recommend services to the customer. Most of these schemes do not consider the unfair rating problem. As the QoS rating of a service can determine whether the service is chosen by a customer, malicious users and services might explore the weakness of the existing schemes in handling unfair ratings to gain commercial advantage. This paper proposed a service recommendation scheme that is robust against unfair rating. When predicting a customer's QoS rating for a service, the proposed scheme takes into account of the ratings given to the service by the users that are similar to the customer, the ratings that the service gained from the typical users and the own experience of the customer. Experiments with the proposed scheme show that (a) the scheme has good prediction accuracy, and (b) it can counter the manipulations by the malicious users and services effectively.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"33 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":"134519827","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}
Service composition has received considerable attention nowadays as a key technology to deliver desired business logics by directly aggregating existing Web services. Considering the dynamic and autonomous nature of Web services, building high-quality software systems by composing third-party services faces novel challenges. As a solution, new techniques have been recently developed to automatically predict the QoS of services in a future time and the prediction result will facilitate in selecting individual services. Nonetheless, limited effort has been devoted to QoS prediction for service composition. To fill out this technical gap, we propose a novel model in this paper that integrates QoS prediction with service composition. The integrated model will lead to a composition result that is not only able to fulfill user requirement during the composition time but also expected to maintain the desired QoS in future. As user requirement is expected to be satisfied by the composition result for a long period of time, significant effort can be reduced for re-composing newly selected services, which usually incurs high cost. We conduct experiments on both real and synthetic QoS datasets to demonstrate the effectiveness of the proposed approach.
{"title":"Reliable Service Composition via Automatic QoS Prediction","authors":"Hongbing Wang, Haixia Sun, Qi Yu","doi":"10.1109/SCC.2013.45","DOIUrl":"https://doi.org/10.1109/SCC.2013.45","url":null,"abstract":"Service composition has received considerable attention nowadays as a key technology to deliver desired business logics by directly aggregating existing Web services. Considering the dynamic and autonomous nature of Web services, building high-quality software systems by composing third-party services faces novel challenges. As a solution, new techniques have been recently developed to automatically predict the QoS of services in a future time and the prediction result will facilitate in selecting individual services. Nonetheless, limited effort has been devoted to QoS prediction for service composition. To fill out this technical gap, we propose a novel model in this paper that integrates QoS prediction with service composition. The integrated model will lead to a composition result that is not only able to fulfill user requirement during the composition time but also expected to maintain the desired QoS in future. As user requirement is expected to be satisfied by the composition result for a long period of time, significant effort can be reduced for re-composing newly selected services, which usually incurs high cost. We conduct experiments on both real and synthetic QoS datasets to demonstrate the effectiveness of the proposed approach.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"26 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":"125469753","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}
G. Salles, M. Fantinato, J. Albuquerque, Marislei Nishijima
The purpose for achieving strategic alignment between Information Technology (IT) and Business areas refers to the need of large organizations to exploit the IT's ability to deliver good products and services, thereby standing out in a competitive scenario. Within this context, Business Process Management and Service Orientation tend to gain space in organizations, since they are able to automate and optimize processes and services for the business. In the business process analysis and modeling phase, it is important to treat not only functional properties, but also process quality and operating constraints, usually grouped as Non-Functional Properties (NFP); thereby preventing that investments in IT are wasted on inefficiency and rework. In order to address these constraints, Business Level Agreements (BLA) and Service Level Agreements (SLA) should be used. The most prestigious languages for business process modeling, including Business Process Model and Notation (BPMN), lack the representation of these NFPs. The approach proposed in this paper, BLA@BPMN, extends BPMN to embody BLAs, as part of a bigger approach to foster strategic alignment in this context. A BLA is specified in the process model level so that it can be mapped to a set of SLAs at the executable process level.
{"title":"A Contribution to Organizational and Operational Strategic Alignment: Incorporating Business Level Agreements into Business Process Modeling","authors":"G. Salles, M. Fantinato, J. Albuquerque, Marislei Nishijima","doi":"10.1109/SCC.2013.111","DOIUrl":"https://doi.org/10.1109/SCC.2013.111","url":null,"abstract":"The purpose for achieving strategic alignment between Information Technology (IT) and Business areas refers to the need of large organizations to exploit the IT's ability to deliver good products and services, thereby standing out in a competitive scenario. Within this context, Business Process Management and Service Orientation tend to gain space in organizations, since they are able to automate and optimize processes and services for the business. In the business process analysis and modeling phase, it is important to treat not only functional properties, but also process quality and operating constraints, usually grouped as Non-Functional Properties (NFP); thereby preventing that investments in IT are wasted on inefficiency and rework. In order to address these constraints, Business Level Agreements (BLA) and Service Level Agreements (SLA) should be used. The most prestigious languages for business process modeling, including Business Process Model and Notation (BPMN), lack the representation of these NFPs. The approach proposed in this paper, BLA@BPMN, extends BPMN to embody BLAs, as part of a bigger approach to foster strategic alignment in this context. A BLA is specified in the process model level so that it can be mapped to a set of SLAs at the executable process level.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"28 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":"126165315","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}
Jia Zhang, P. Votava, Tsengdar J. Lee, Shrikant Adhikarla, I. Kulkumjon, Matthew Schlau, Divya Natesan, R. Nemani
Most of the existing service discovery methods focus on finding candidate services based on functional and non-functional requirements. However, while the open science community engenders many similar scientific services, how to differentiate them remains a challenge. This paper proposes a trust model that leverages the implicit human factor to help quantify the trustworthiness of candidate services. A hierarchical Knowledge-Social-Trust (KST) network model is established to draw hidden information from various publication repositories (e.g., DBLP) and social networks (e.g., Twitter). As a proof of concept, a prototyping service has been developed to help scientists evaluate and visualize trust of services. The performance factor is studied and experience is reported.
{"title":"A Technique of Analyzing Trust Relationships to Facilitate Scientific Service Discovery and Recommendation","authors":"Jia Zhang, P. Votava, Tsengdar J. Lee, Shrikant Adhikarla, I. Kulkumjon, Matthew Schlau, Divya Natesan, R. Nemani","doi":"10.1109/SCC.2013.104","DOIUrl":"https://doi.org/10.1109/SCC.2013.104","url":null,"abstract":"Most of the existing service discovery methods focus on finding candidate services based on functional and non-functional requirements. However, while the open science community engenders many similar scientific services, how to differentiate them remains a challenge. This paper proposes a trust model that leverages the implicit human factor to help quantify the trustworthiness of candidate services. A hierarchical Knowledge-Social-Trust (KST) network model is established to draw hidden information from various publication repositories (e.g., DBLP) and social networks (e.g., Twitter). As a proof of concept, a prototyping service has been developed to help scientists evaluate and visualize trust of services. The performance factor is studied and experience is reported.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"21 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":"129563549","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}
Y. Maurel, Thomas Leveque, P. Lalanda, Pierre Bourret
In most Service-Oriented frameworks service selection is based on provider-centric information despite well-known shortcomings (trustworthiness, incompleteness, subjectivity). We propose to allow consumers and third-party modules to extend information about providers and their services directly into the service registry. The knowledge is organized and shared via access controlled groups of interest. Services can be discovered using this knowledge. Our solution is integrated to OSGi and uses the decorator-pattern to make usage transparent.
{"title":"Extensible Service Knowledge","authors":"Y. Maurel, Thomas Leveque, P. Lalanda, Pierre Bourret","doi":"10.1109/SCC.2013.76","DOIUrl":"https://doi.org/10.1109/SCC.2013.76","url":null,"abstract":"In most Service-Oriented frameworks service selection is based on provider-centric information despite well-known shortcomings (trustworthiness, incompleteness, subjectivity). We propose to allow consumers and third-party modules to extend information about providers and their services directly into the service registry. The knowledge is organized and shared via access controlled groups of interest. Services can be discovered using this knowledge. Our solution is integrated to OSGi and uses the decorator-pattern to make usage transparent.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"7 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":"129630248","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}
The rise of dynamic applications is coming with new development challenges. Indeed, dynamism is a complex concern, difficult to perceive and manage by developers. In the context of a large industrial project dealing with fleet management, we had to deal with important environmental and evolutionary dynamism. To make it easier for the development team, we have used and extended the iPOJO service component model. This paper presents how the dynamism is described in component metadata and how it is managed at runtime. The extensions have been integrated into the Apache Felix iPOJO source code.
动态应用程序的兴起带来了新的开发挑战。事实上，动态是一个复杂的问题，很难被开发人员理解和管理。在处理车队管理的大型工业项目的背景下，我们必须处理重要的环境和进化动力。为了方便开发团队，我们使用并扩展了iPOJO服务组件模型。本文介绍了如何在组件元数据中描述动态以及如何在运行时对其进行管理。这些扩展已经集成到Apache Felix iPOJO源代码中。
{"title":"Describing Dynamism in Service Dependencies: Industrial Experience and Feedbacks","authors":"C. Escoffier, Pierre Bourret, P. Lalanda","doi":"10.1109/SCC.2013.82","DOIUrl":"https://doi.org/10.1109/SCC.2013.82","url":null,"abstract":"The rise of dynamic applications is coming with new development challenges. Indeed, dynamism is a complex concern, difficult to perceive and manage by developers. In the context of a large industrial project dealing with fleet management, we had to deal with important environmental and evolutionary dynamism. To make it easier for the development team, we have used and extended the iPOJO service component model. This paper presents how the dynamism is described in component metadata and how it is managed at runtime. The extensions have been integrated into the Apache Felix iPOJO source code.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"9 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":"117043618","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}
Service contract matchmaking represents a promising path towards the definition of accurate service selection mechanisms. Basically, it consists in evaluating the degree of match between preferences explicitly defined by a service customer and the contractual terms offered by service providers. However, service contract matchmaking assumes that a service customer is always aware of the contractual terms on which to specify preferences. In reality, a service customer often specifies preferences only on a very limited set of common and well-known terms (e.g., price). This paper proposes a new approach to service contract selection that adopts the value in use concept to quantify the trade-off between benefits and sacrifices related to contractual terms on which the customer has omitted to specify preferences. Experimental activities in the car insurance domain demonstrate the effectiveness of the approach.
{"title":"Value-Based Service Contract Selection","authors":"M. Comerio","doi":"10.1109/SCC.2013.13","DOIUrl":"https://doi.org/10.1109/SCC.2013.13","url":null,"abstract":"Service contract matchmaking represents a promising path towards the definition of accurate service selection mechanisms. Basically, it consists in evaluating the degree of match between preferences explicitly defined by a service customer and the contractual terms offered by service providers. However, service contract matchmaking assumes that a service customer is always aware of the contractual terms on which to specify preferences. In reality, a service customer often specifies preferences only on a very limited set of common and well-known terms (e.g., price). This paper proposes a new approach to service contract selection that adopts the value in use concept to quantify the trade-off between benefits and sacrifices related to contractual terms on which the customer has omitted to specify preferences. Experimental activities in the car insurance domain demonstrate the effectiveness of the approach.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"25 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":"121221784","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}
Despite the success of orchestration and choreography for Web services composition, there are still challenges to be overcome such as the difficulty for management of complex control-flow executions, the communication cost associated with service interactions, knowledge of the business process by services and even their compatibility in compositions. As an alternative to traditional approaches, in this paper we focus on an important face of Web services compositions that is the management of control-flow executions and propose the use of WED-flow approach, in which the execution of business processes is driven by changes in data states. In our approach, the control-flow is not a requirement but a consequence of Web services execution, providing greater flexibility for the development and maintenance of applications. The first contribution of this work is the evaluation of possible scenarios for orchestration and choreography. The second contribution is the implementation and validation of WED-flow approach for Web services execution for these possible scenarios.
{"title":"Web Services Composition through Data Events Approach","authors":"M. C. Rodrigues, J. E. Ferreira, C. Pu","doi":"10.1109/SCC.2013.11","DOIUrl":"https://doi.org/10.1109/SCC.2013.11","url":null,"abstract":"Despite the success of orchestration and choreography for Web services composition, there are still challenges to be overcome such as the difficulty for management of complex control-flow executions, the communication cost associated with service interactions, knowledge of the business process by services and even their compatibility in compositions. As an alternative to traditional approaches, in this paper we focus on an important face of Web services compositions that is the management of control-flow executions and propose the use of WED-flow approach, in which the execution of business processes is driven by changes in data states. In our approach, the control-flow is not a requirement but a consequence of Web services execution, providing greater flexibility for the development and maintenance of applications. The first contribution of this work is the evaluation of possible scenarios for orchestration and choreography. The second contribution is the implementation and validation of WED-flow approach for Web services execution for these possible scenarios.","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":"117088268","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}
Hongxia Zhang, Rongheng Lin, Hua Zou, Fangchun Yang, Yao Zhao
Service-oriented product lines provide a unified representation of variants of the possible applications of a specific domain. The configuration process is often completed by multi-stakeholders collaboratively. However, current configuration methods do not provide means to coordinate concurrent decision making. In this paper, we present a framework that describes the collaborative configuration process of Service-oriented Product lines based on fuzzy quality requirements. First, the configuration objective is obtained based on an improved fuzzy multi-attribute group decision making method. Then, the corresponding multi-objective evolutionary approaches are presented for product configuration and business process configuration that satisfy both functional and non-functional preferences and constraints, respectively.
{"title":"The Collaborative Configuration of Service-Oriented Product Lines Based on Evolutionary Approach","authors":"Hongxia Zhang, Rongheng Lin, Hua Zou, Fangchun Yang, Yao Zhao","doi":"10.1109/SCC.2013.23","DOIUrl":"https://doi.org/10.1109/SCC.2013.23","url":null,"abstract":"Service-oriented product lines provide a unified representation of variants of the possible applications of a specific domain. The configuration process is often completed by multi-stakeholders collaboratively. However, current configuration methods do not provide means to coordinate concurrent decision making. In this paper, we present a framework that describes the collaborative configuration process of Service-oriented Product lines based on fuzzy quality requirements. First, the configuration objective is obtained based on an improved fuzzy multi-attribute group decision making method. Then, the corresponding multi-objective evolutionary approaches are presented for product configuration and business process configuration that satisfy both functional and non-functional preferences and constraints, respectively.","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":"132021281","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
扫码关注我们
求助内容：
应助结果提醒方式：