{"title":"Reputation-Based Web Service Selection for Composition","authors":"S. Bansal, A. Bansal","doi":"10.1109/SERVICES.2011.96","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.96","url":null,"abstract":"The success and acceptance of Web service composition depends on computing solutions comprised of trustworthy services. In this paper, we extend our Web service Composition framework to include selection and ranking of services based on their reputation score. With the increasing popularity of Web-based Social Networks like Linked in, Facebook, and Twitter, there is great potential in determining the reputation score of a particular service provider using Social Network Analysis. We present a technique to calculate a reputation score per service using centrality measure of Social Networks. We use this score to produce composition solutions that consist of services provided by trust-worthy and reputed providers.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"84 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114010362","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":"Externalizing the Autopoietic Part of Software to Achieve Self-Adaptability","authors":"Romina Torres, H. Astudillo","doi":"10.1109/SERVICES.2011.69","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.69","url":null,"abstract":"The autopietic/allopietic duality has been proposed to address the fact that Software systems must look to their own survival besides their successful mission completion. To the best of our knowledge, there are no explicit computational models to operationalize and test this distinction. This article describes a framework to add autopietic capabilities to composite Software systems, by using an external self-organized market full of service providers willing to provide services for satisfying new requirements and recovering actions. The approach is exemplified when a QoS agreement violation occurs in a composite application system.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114186777","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}
R. Ko, Peter Jagadpramana, M. Mowbray, Siani Pearson, M. Kirchberg, Q. Liang, Bu-Sung Lee
{"title":"TrustCloud: A Framework for Accountability and Trust in Cloud Computing","authors":"R. Ko, Peter Jagadpramana, M. Mowbray, Siani Pearson, M. Kirchberg, Q. Liang, Bu-Sung Lee","doi":"10.1109/SERVICES.2011.91","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.91","url":null,"abstract":"The key barrier to widespread uptake of cloud computing is the lack of trust in clouds by potential customers. While preventive controls for security and privacy are actively researched, there is still little focus on detective controls related to cloud accountability and audit ability. The complexity resulting from large-scale virtualization and data distribution carried out in current clouds has revealed an urgent research agenda for cloud accountability, as has the shift in focus of customer concerns from servers to data. This paper discusses key issues and challenges in achieving a trusted cloud through the use of detective controls, and presents the Trust Cloud framework, which addresses accountability in cloud computing via technical and policy-based approaches.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122103808","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}
Vedaprakash Subramanian, Hongyi Ma, Liqiang Wang, En-Jui Lee, Po Chen
{"title":"Rapid 3D Seismic Source Inversion Using Windows Azure and Amazon EC2","authors":"Vedaprakash Subramanian, Hongyi Ma, Liqiang Wang, En-Jui Lee, Po Chen","doi":"10.1109/SERVICES.2011.90","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.90","url":null,"abstract":"With its rapid development, cloud computing has been increasingly adopted by scientists for large-scale scientific computation. Compared to the traditional computing platforms such as cluster and supercomputer, cloud computing is more elastic in the support of real-time computation and more powerful in the management of large-scale datasets. This paper presents our experience on designing and implementing seismic source inversion on both cluster (specifically, MPI-based) and cloud computing (specifically, Amazon EC2 and Microsoft Windows Azure). Our experiment shows that applying cloud computing to seismic source inversion is feasible and has its advantages. In addition, we notice that both cluster and Amazon EC2 have obviously better performance than Windows Azure. Cloud computing is suited for real-time processing scientific applications but it (especially Azure) does not work well for tightly-coupled applications.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"5 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123650303","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":"On Performance Modeling and Prediction in Support of Scientific Workflow Optimization","authors":"C. Wu, Vivek Datla","doi":"10.1109/SERVICES.2011.37","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.37","url":null,"abstract":"The computing modules in distributed scientific workflows must be mapped to computer nodes in shared network environments for optimal workflow performance. Finding a good workflow mapping scheme critically depends on an accurate prediction of the execution time of each individual computational module in the workflow. The time prediction of a scientific computation does not have a silver bullet as it is determined collectively by several dynamic system factors including concurrent loads, memory size, CPU speed, and also by the complexity of the computational program itself. This paper investigates the problem of modeling scientific computations and predicting their execution time based on a combination of both hardware and software properties. We employ statistical learning techniques to estimate the effective computational power of a given computer node at any point of time and estimate the total number of CPU cycles needed for executing a given computational program on any input data size. We analytically derive an upper bound of the estimation error for execution time prediction given the hardware and software properties. The proposed statistical analysis-based solution to performance modeling and prediction is validated and justified by experimental results measured on the computing nodes that vary significantly in terms of the hardware specifications.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123352045","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":"Service Adaptation at Message Level","authors":"Jianmin Jiang, Shi Zhang, Ping Gong, Zhong Hong","doi":"10.1109/SERVICES.2011.76","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.76","url":null,"abstract":"In SOA, adaptation techniques aim to automatically generate adapters. However, the generation of the adapter is a complicated task and requires extra knowledge to resolve all kinds of mismatches. We propose a novel model, called a protocol structure, which is used to model services and adapters and detect the mismatches among services. Once developers present interface mappings among services, adapters can be derived from the interface mappings.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122947177","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":"Analyzing Execution Dynamics of Scientific Workflows for Latency Minimization in Resource Sharing Environments","authors":"Yi Gu, C. Wu, N. Rao","doi":"10.1109/SERVICES.2011.54","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.54","url":null,"abstract":"Many computation-intensive scientific applications feature complex workflows of distributed computing modules with intricate execution dependencies. Such scientific workflows must be mapped and executed in shared environments to support distributed scientific collaborations. We formulate workflow mapping as an optimization problem for latency minimization, whose difficulty essentially arises from the topological matching nature in the spatial domain, which is further compounded by the resource sharing complicacy in the temporal dimension. We conduct a rigorous analysis of the resource sharing dynamics in workflow executions, which constitutes the base for a workflow mapping algorithm to minimize the end-to-end delay. The correctness of the dynamics analysis is verified in comparison with an approximate solution, a dynamic system simulation program, and a real network deployment, and the performance superiority of the proposed mapping solution is illustrated by extensive comparisons with existing methods using both simulations and experiments.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126817542","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":"A Measure Standard for Ontology-Based Service Recommendation","authors":"Zhi Yang, Budan Wu, Junliang Chen","doi":"10.1109/SERVICES.2011.39","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.39","url":null,"abstract":"Web Service is becoming the next generation of web-based application. With enhancement of quality of services and increasing quantity of services, how to recommend the suitable services according to personalized requirement becomes an urgent question. In the existing approaches of service recommendation, the result of service recommendation is the service list in which there is no evaluation standard that we can use to distinguish services with high relevancy and low relevancy. So in real-world, the user may obtain low relative services. To address the problem, in this paper, membership function is analyzed and recommendation measure standard is proposed. With dynamic programming theory, an ontology based approach of service recommendation is provided. In the result of service recommendation, membership as measure index is used to divide high relative services, medium relative services and low relative services. High relative services are recommended to the user. So the recommended services are accurate and available.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133578857","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":"Meaningful Service Classifications for Flexible Service Descriptions","authors":"Sudhir Agarwal, M. Junghans","doi":"10.1109/SERVICES.2011.79","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.79","url":null,"abstract":"We present a formal underpinning for textit{Web service classes} by viewing them as a set of services that fulfill a logical combination of constraints on functional and non-functional properties. A hierarchy of service classes is automatically derived by their formal definition and can be exploited for an efficient service retrieval. In addition, we show in this paper how service classes can be used (i) to create service descriptions without specifying precise property values and (ii) to create service requests that can use service classes to express ranges of desired property values.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115152394","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":"Balava: Federating Private and Public Clouds","authors":"A. Nordal, Åge Kvalnes, J. Hurley, D. Johansen","doi":"10.1109/SERVICES.2011.21","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.21","url":null,"abstract":"Balava is a new system for managing computations that span multiple clouds and involve data with confidentiality constraints. This paper describes the design, implementation and initial performance evaluation of Balava building-blocks. We detail the run-time developed to interconnect private and public clouds, and present a storage overlay built on top of this run-time. To support low-overhead execution of Balava computations, we are investigating alternative approaches to virtualization. We present a new hyper visor that supports light-weight virtual environments, while also preserving application binary interfaces.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116158600","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}