{"title":"Service Restructuring by Choreography-Driven Equivalence","authors":"Zaiwen Feng, Rong Peng, K. He, Zhoufang He","doi":"10.1109/SCC.2012.62","DOIUrl":"https://doi.org/10.1109/SCC.2012.62","url":null,"abstract":"A Web service specification can be quite complex, including multiple operations and various kinds of message exchange patterns. In this work, we focus on the problem of restructuring a Web service, which contains a process model inside, preserving at the same time its behavior that is shown to the service user. We provide a behavioral signature model for service restructuring. It is considered for Web services to be choreography equivalence if they conform to the same behavioral signature model. Based on behavioral signature models and graph searching technologies, we provide an algorithm for restructuring the process model from within the service while assuring service choreography equivalence. A case study runs throughout the paper to illustrate the feasibility of our work. We have implemented a prototype to demonstrate and evaluate our approach.","PeriodicalId":178841,"journal":{"name":"2012 IEEE Ninth International Conference on Services Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126865497","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}
Qiang He, Jun Han, Yun Yang, Jean-Guy Schneider, Hai Jin, Steven Versteeg
{"title":"Probabilistic Critical Path Identification for Cost-Effective Monitoring of Service-Based Systems","authors":"Qiang He, Jun Han, Yun Yang, Jean-Guy Schneider, Hai Jin, Steven Versteeg","doi":"10.1109/SCC.2012.39","DOIUrl":"https://doi.org/10.1109/SCC.2012.39","url":null,"abstract":"When operating in volatile environments, service-based systems (SBSs) that are built through dynamic composition of component services must be monitored in order to guarantee the response times of the SBSs. In particular, the critical path of a composite SBS, i.e., the execution path in the service composition with the maximum execution time, should be prioritised in cost-effective monitoring as it determines the response time of the SBS. In volatile operating environments, the critical path of a SBS is probabilistic. As such, it is important to estimate the criticalities of the execution paths and the component services, i.e., the probabilities that they are critical, to decide which parts of the system to monitor. In this paper, we propose a novel approach to the identification of Probabilistic Critical Path for Service-based Systems (PCP-SBS). PCP-SBS takes into account the probabilistic nature of the critical path and calculates path criticalities in the context of service composition. We evaluate PCP-SBS experimentally using SBSs that are synthetically composed based on a real-world Web service dataset.","PeriodicalId":178841,"journal":{"name":"2012 IEEE Ninth International Conference on Services Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127378068","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}
F. Lécué, N. Mehandjiev, J. Vogel, P. Un, Bernhard Neu
{"title":"KPI-Based Service Composition Modeling and Optimization with Design Time User Interaction","authors":"F. Lécué, N. Mehandjiev, J. Vogel, P. Un, Bernhard Neu","doi":"10.1109/SCC.2012.97","DOIUrl":"https://doi.org/10.1109/SCC.2012.97","url":null,"abstract":"Most of existing approaches consider composition optimization as a back-end process and rarely expect non-technical end-users to interact directly with the optimization process. Thus these approaches do not enable the end-user to leverage the effects of direct interaction of the process of composition. Indeed, corrective actions can be taken only before and after the execution, not during composition construction. We focus on end-user support and optimized service selection during composition modeling. Of particular interest hereby is whether business users with limited IT skills can leverage our approach to optimize and consume web services and their composition.","PeriodicalId":178841,"journal":{"name":"2012 IEEE Ninth International Conference on Services Computing","volume":"80 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131170810","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}
S. Mandala, M. Vukovic, Jim Laredo, Yaoping Ruan, Milton Hernandez
{"title":"Hybrid Role Mining for Security Service Solution","authors":"S. Mandala, M. Vukovic, Jim Laredo, Yaoping Ruan, Milton Hernandez","doi":"10.1109/SCC.2012.57","DOIUrl":"https://doi.org/10.1109/SCC.2012.57","url":null,"abstract":"IT services delivery is a complex ecosystem that engages 100000s of system administrators in service delivery centers globally managing 1000s of IT systems on behalf of customers. Such large-scale hosting environments require a flexible identity management system to provision necessary access rights, in order to ensure compliance posture of an organization. A popular and effective access control scheme is Role Based Access Control (RBAC). Ideally, a role should correspond to a business function performed within an enterprise. Several role mining algorithms have been proposed which attempt to automate the process of role discovery. In this paper, we represent the user-permission assignments as a bi-partite graph with users/permissions as vertices and user-permission assignments as edges. Given a user-permission bi-partite graph, most role mining algorithms focus on discovering roles that cover all the user-permission assignments. We show that by relaxing the coverage requirement, one can improve the accuracy of role detection. We propose a parameterized definition of a role based on graph theoretical properties, and demonstrate that the role parameters can be controlled to balance the accuracy and coverage of the roles detected. Finally, we propose a heuristic to illustrate the efficacy of our approach and validate it on real and artificial organizational access control data.","PeriodicalId":178841,"journal":{"name":"2012 IEEE Ninth International Conference on Services Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131315033","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}
{"title":"Trade-Offs in a Google Distance and a WordNet Hybrid for QoS-Enabled Web Services Composition","authors":"D. Jutla, D. Veerasekaran, R. Ding","doi":"10.1109/SCC.2012.77","DOIUrl":"https://doi.org/10.1109/SCC.2012.77","url":null,"abstract":"This paper proposes a hybrid approach in using Google Distance and WordNet together in a new method for the semantic similarity matching stage of web services discovery. We provide comparisons, using services recall and precision metrics, between our hybrid approach and our earlier lightweight Google Distance-based approach for web services discovery. Our performance evaluation demonstrates the trade-offs between the Google Distance only approach and a WordNet-assisted Google Distance hybrid approach for similarity matching in the web services discovery phase. Further, the impact of both approaches on QoS-enabled web service composition is described for 7 representative web transactions in the Travel domain.","PeriodicalId":178841,"journal":{"name":"2012 IEEE Ninth International Conference on Services Computing","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134068527","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}
{"title":"Experimental Evaluation of Web Service Frameworks in the Presence of Security Attacks","authors":"R. Oliveira, N. Laranjeiro, M. Vieira","doi":"10.1109/SCC.2012.52","DOIUrl":"https://doi.org/10.1109/SCC.2012.52","url":null,"abstract":"Web services are increasingly being used to provide critical operations in business-to-business and safety-critical environments. In these environments the exploitation of security vulnerabilities may result in major damages in the services infrastructures, financial or reputation losses to the organizations involved, and other catastrophic consequences for the users and the environment. Web services frameworks are the basis for developers to create and deploy web services, and must provide a robust and secure environment, so that an application can deliver its service, even when in presence of security attacks. In this paper we study the behavior of well-known web services frameworks in the presence of security attacks targeting the core web services specifications, i.e., those enabling basic message exchange functionalities. Results show that frameworks are quite resistant to attacks. However, they also indicate that even very popular and highly tested frameworks can be vulnerable to attacks, with potentially catastrophic consequences for the services being deployed.","PeriodicalId":178841,"journal":{"name":"2012 IEEE Ninth International Conference on Services Computing","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134460497","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}
{"title":"Dynamic Service Selection Based on Context-Aware QoS","authors":"Donghui Lin, Chunqi Shi, T. Ishida","doi":"10.1109/SCC.2012.95","DOIUrl":"https://doi.org/10.1109/SCC.2012.95","url":null,"abstract":"With the development of service-oriented computing environments, QoS-aware service selection has been a more and more important research issue. In service composition environments, QoS attributes of atomic services are always aggregated for computing the QoS of the composite services, which has been reported in many previous studies. However, there are situations that some QoS attributes cannot be aggregated for composite services. For example, it is difficult to compute the translation quality of a composite translation service by simply aggregating its component atomic services (machine translation service, morphological analysis service, dictionary service). Moreover, when multiple QoS attributes are used for evaluating services, it is always difficult to maximize all the QoS attributes because there might be anti-correlated relations between them. To address above problems, this paper proposes an approach for selecting services based on context-aware factors of QoS attributes. In our proposed approach, context-aware factors that affect QoS attributes are first extracted from analyzing their correlation with QoS attributes. Then, QoS data is generated based on the extracted factors for QoS prediction and evaluation. Further, dynamic service selection is realized based on QoS prediction and evaluation considering user requirements. We use a case study in the domain of language service with some experiments to show the effectiveness of our approach.","PeriodicalId":178841,"journal":{"name":"2012 IEEE Ninth International Conference on Services Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121214335","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}
{"title":"Modeling and Configuration of Process Variants for On-Boarding Customers to IT Outsourcing","authors":"W. Yao, Sujoy Basu, Jun Yu Li, Bryan Stephenson","doi":"10.1109/SCC.2012.32","DOIUrl":"https://doi.org/10.1109/SCC.2012.32","url":null,"abstract":"An essential part of IT outsourcing is to move the customer's IT environment into the service provider's mode of operation, which is known as customer on-boarding. It covers every aspect of transition and transformation, from the time the customer signs the contract to the time the provider can deliver steady-state IT services. In order to improve the repeatability and enforce adoption of best practices, a standard set of processes should be established to direct, control, and measure on-boarding activities for each customer. However, this process is very complex and often gets adapted according to customer environments and requirements. It is very difficult to incorporate process variants needed for diverse scenarios into a single on-boarding process model, so that they can be reused. In this paper, we propose an approach based on ontology and rules to model the standard on-boarding process and configure process variants based on the business context that characterizes various scenarios. Further, semantic rules model adaptation policies and help generate a customized process variant schema on the fly. Based on this framework, we have developed a prototype to support process variant configuration. We also discuss the flexibility of our approach, and present its cost-benefit analysis.","PeriodicalId":178841,"journal":{"name":"2012 IEEE Ninth International Conference on Services Computing","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116577616","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}
{"title":"An Efficient Data Maintenance Model for Data Service Mashup","authors":"Peng Zhang, Guiling Wang, Guang Ji, Yanbo Han","doi":"10.1109/SCC.2012.10","DOIUrl":"https://doi.org/10.1109/SCC.2012.10","url":null,"abstract":"While end-users enjoy the data service mashup with high convenience and flexibility, how to achieve the best performance with minimum maintenance cost is a challenging problem. In this paper, the data maintenance problem is analyzed, and the maintenance cost model for the data service mashup is built. The model measures the response cost and update cost of a group of data service mashups in terms of the request frequency and update frequency. Experiment shows our mashup platform with the model can reduce data maintenance cost.","PeriodicalId":178841,"journal":{"name":"2012 IEEE Ninth International Conference on Services Computing","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124630536","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}
{"title":"Enabling Active Data Archival over Cloud","authors":"Rajeev Gupta, H. Gupta, Ullas Nambiar, M. Mohania","doi":"10.1109/SCC.2012.20","DOIUrl":"https://doi.org/10.1109/SCC.2012.20","url":null,"abstract":"The need to analyze huge amount of data for various business intelligence applications is well known. However, the rate at which enterprise data is generated now demands periodic migration of older data from the operational data warehouse to magnetic tapes. In this paper, we propose an \"Active data archival service\" in which the data is seamlessly archived on the cloud while ensuring that the archived data can be queried without any perceptible change to the end-user. This takes the burden of maintaining the archive off the user and shifts it to the archival service. We discuss the architecture of the service, challenges arising therein due to the federation of data brought on by the archival and how we handle these issues. Specifically, we investigate how the relational data needs to be transformed so that storing and retrieving the data from the cloud is efficient and seamless to the end user. We present our insights through an experimental study using TPC-DS benchmark.","PeriodicalId":178841,"journal":{"name":"2012 IEEE Ninth International Conference on Services Computing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128469341","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}