Lei Xu, Ewnetu Bayuh Lakew, F. Hernández-Rodriguez, E. Elmroth
{"title":"A Scalable Accounting Solution for Prepaid Services in Cloud Systems","authors":"Lei Xu, Ewnetu Bayuh Lakew, F. Hernández-Rodriguez, E. Elmroth","doi":"10.1109/SCC.2012.40","DOIUrl":"https://doi.org/10.1109/SCC.2012.40","url":null,"abstract":"Prepaid charging, an essential option for the accounting of cloud services, provides effective financial control for both service providers and customers. However, it has to be supported by real-time credit checking and cost calculation. These real-time actions consume resources of the providers' network and impose high overhead. To tackle this issue, we present a scalable accounting solution in which an accounting component is hosted in every cluster constituting a cloud system. Each of our accounting component supervises service consumptions based on a calculated interval of a service bundle that is composed of all services hosted in a cluster and consumed by one customer simultaneously. Credit will be re-allocated when a customer's credit in one cluster is not enough to compensate further usage, and the allocation is performed based on service consumptions. This work is intended to reduce the cost of prepaid services and to ensure service provision is not hampered by the charging part. Additionally, we perform theoretical and experimental analyses that indicate this work can provide an inexpensive accounting solution for the long-lived services in storage clouds.","PeriodicalId":178841,"journal":{"name":"2012 IEEE Ninth International Conference on Services Computing","volume":"72 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":"129127887","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 Multi-agent Reinforcement Learning Model for Service Composition","authors":"Hongbing Wang, Xiaojun Wang, Xuan Zhou","doi":"10.1109/SCC.2012.58","DOIUrl":"https://doi.org/10.1109/SCC.2012.58","url":null,"abstract":"This paper describes a multi-agent reinforcement learning model for the optimization of Web service composition. Based on the model, we propose a multiagent Q-learning algorithm, where each agent would benefit from the advice of other agents in team. In contrast to single-agent reinforcement learning, our algorithm can speed up convergence to optimal policy. In addition, it allows composite service to dynamically adjust itself to fit the varying environment, where the properties of the component services continue changing. Our experiments demonstrate the efficiency of our algorithm.","PeriodicalId":178841,"journal":{"name":"2012 IEEE Ninth International Conference on Services Computing","volume":"97 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":"131637275","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":"How to Assess and Customize Service Value for IT Cloud Services Clients","authors":"K. Ramaswami, A. Sailer","doi":"10.1109/SCC.2012.70","DOIUrl":"https://doi.org/10.1109/SCC.2012.70","url":null,"abstract":"This article describes our novel methodology to ascertain the IT Cloud customer's perceived service value in terms of non-functional requirements and our experience applying this methodology to clients using a Virtual Desktop Service running on an IT Cloud.","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":"134189877","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":"Towards an Automata-Based Semantic Web Services Composition Method in Context-Aware Environment","authors":"Zhichao Zhang, Weiping Li, Zhonghai Wu, Wei Tan","doi":"10.1109/SCC.2012.27","DOIUrl":"https://doi.org/10.1109/SCC.2012.27","url":null,"abstract":"This paper proposes a service automaton to proactively provide services to users in a context aware pervasive system. First, a context space (CSP) model is proposed based on conceptual space theory, and this model deals with context, situation, services and user preferences in a unified way. In CSP, situation is used to depict the specific scene faced by a user; user preferences can be deemed as a basis to predict the user desired goal situation; to derive a service composition that achieves a given goal, we formalize semantic web services as automata with an emphasize on the relations among contexts and services. Afterwards a composite service automaton (CSA) is defined to synthesis services into a global automata and support the service composition to achieve the goal situation. At last, a temperature control case in smart homes is illustrated to validate the model and approach. The example shows that the service automata can conveniently reflect the state transition of a context aware system from a global perspective and help user achieve the goal situation.","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":"134254874","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}
Michele Stecca, Martino Fornasa, Nicholas DallArmellina, M. Maresca
{"title":"Event-Driven Mashup Orchestration with Scala","authors":"Michele Stecca, Martino Fornasa, Nicholas DallArmellina, M. Maresca","doi":"10.1109/SCC.2012.41","DOIUrl":"https://doi.org/10.1109/SCC.2012.41","url":null,"abstract":"We describe the organization of a Server-side platform supporting the execution of Event-Driven Mashups (i.e., composite applications combining services and smart objects through events). To support a large number of concurrent Mashup executions, Mashup Execution Platforms (MEPs) must exploit the processing power of multi-processor computer architectures as well as appropriate concurrency models and programming languages. In order to do so, we describe a MEP based on the emerging Scala programming language which provides an efficient concurrency model - based on the actor model - that is suitable for the execution on multi-processor systems. Since the MEP architecture considered in this paper has been previously implemented in Java we also describe its porting from Java to Scala taking advantage of the compatibility between the two programming languages. Finally, the Java-based and the Scala-based implementations are compared from a performance point of view.","PeriodicalId":178841,"journal":{"name":"2012 IEEE Ninth International Conference on Services Computing","volume":"15 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":"133000955","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}
Masahiro Tanaka, Yohei Murakami, Donghui Lin, T. Ishida
{"title":"A Service Binding Framework for Open Environment","authors":"Masahiro Tanaka, Yohei Murakami, Donghui Lin, T. Ishida","doi":"10.1109/SCC.2012.74","DOIUrl":"https://doi.org/10.1109/SCC.2012.74","url":null,"abstract":"A service invocation in a composite service is usually defined by its interface for abstraction. Once the interface is standardized and many services which have the same interface become available, a user can bind preferable ones to the composite service only by setting endpoints. Since new services become available day by day in open environment, it is crucial to automatically construct the bindings according to user's requirements. However, runtime binding construction often degrades the performance because searching a vast amount of possible bindings is time-consuming. Moreover, bindings need to be modified even during execution of a composite service when some adaptation process is applied. In this paper, we proposed a framework for constructing bindings, which is based on ATMS (Assumption-based Truth Maintenance System). The framework effectively caches possibilities of bindings and can manage changes of bindings when a runtime adaptation process is applied. We implemented a prototype of the framework and confirmed that it works fast enough for a real scale service composition.","PeriodicalId":178841,"journal":{"name":"2012 IEEE Ninth International Conference on Services Computing","volume":"71 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":"123893635","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":"Utilizing PCFGs for Modeling and Learning Service Compositions in Sensor Networks","authors":"S. Geyik, E. Bulut, B. Szymanski","doi":"10.1109/SCC.2012.22","DOIUrl":"https://doi.org/10.1109/SCC.2012.22","url":null,"abstract":"Service composition in sensor networks combines elementary services with a specific functionality to create a service with higher level functionality. The previous efforts in automating composition were sending full information about all services across the entire sensor network, creating a security risk and imposing significant communication overhead. Furthermore, learning based composition or error detection methods do not consider global information, leading to inefficiencies in the generated composition graphs. In this paper, we propose a probabilistic context-free grammar (PCFG) based modeling technique to construct service compositions. The successful compositions created for the given application are treated as statements belonging to an efficient composition PCFG of this application. The given set of such compositions is used to derive this PCFG automatically. Future composition could be then easily constructed with the help of such PCFG. We present our methodology for achieving such modeling and provide examples of its use to demonstrate its advantage over previous work. We also evaluate the resulting improvements in performance of compositions and in the costs of their creation.","PeriodicalId":178841,"journal":{"name":"2012 IEEE Ninth International Conference on Services Computing","volume":"34 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":"124184755","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}
Jack Li, Qingyang Wang, D. Jayasinghe, Simon Malkowski, Pengcheng Xiong, C. Pu, Yasuhiko Kanemasa, Motoyuki Kawaba
{"title":"Profit-Based Experimental Analysis of IaaS Cloud Performance: Impact of Software Resource Allocation","authors":"Jack Li, Qingyang Wang, D. Jayasinghe, Simon Malkowski, Pengcheng Xiong, C. Pu, Yasuhiko Kanemasa, Motoyuki Kawaba","doi":"10.1109/SCC.2012.85","DOIUrl":"https://doi.org/10.1109/SCC.2012.85","url":null,"abstract":"High resource utilization is an important goal in achieving high return on investment in cloud environments. Guaranteed quality of service (QoS) is an important goal for web-facing applications such as e-commerce. Achieving both high utilization and high QoS simultaneously is a significant challenge, since high utilization often implies more QoS failures such as long response times. In this paper, we adopt a profit model based on response time (i.e., decreasing or negative revenues for increasing query answer response time) to represent the QoS requirements. Our data shows that such a profit model often yields different analytical results compared to traditional performance metrics such as average throughput. Using extensive experimental measurements (on the same hardware platform and software stack) of the standard RUBBoS n-tier benchmark, we study the impact of different allocations of software resources such as the size of thread pools in various servers in an n-tier system. First, the profit model emphasizes the importance of appropriate allocations, showing a difference of up to 48.6% when system utilization is high (over 80%). Second, our experiments show that over-allocation of thread pool may lead to unnecessary consumption of critical resources (e.g., CPU) that reduce profits by up to 84.8%. Third, we found that under-allocation of thread pool in one server may lead to under-utilization of several servers downstream in an n-tier system, also reducing profits by up to 52.8%. Our data shows that the best allocation depends on several system parameters, including resource availability. We designed an adaptive algorithm to find the best allocations and show its effectiveness through our experiments and analyses.","PeriodicalId":178841,"journal":{"name":"2012 IEEE Ninth International Conference on Services Computing","volume":"2 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":"115650859","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}
Chathura Herath, Fang Liu, S. Marru, Lahiru Gunathilake, M. Sosonkina, J. Vary, P. Maris, M. Pierce
{"title":"Web Service andWorkflow Abstractions to Large Scale Nuclear Physics Calculations","authors":"Chathura Herath, Fang Liu, S. Marru, Lahiru Gunathilake, M. Sosonkina, J. Vary, P. Maris, M. Pierce","doi":"10.1109/SCC.2012.112","DOIUrl":"https://doi.org/10.1109/SCC.2012.112","url":null,"abstract":"This paper discusses the web service and scientific workflow abstractions to next generation ab initio computational nuclear physics resources as part of the Leadership Class Configuration Interaction (LCCI) Environment. These abstractions will rapidly and efficiently involve new collaborators and graduate students in productive research. The workflow infrastructure democratizes the access to the nuclear physics simulations executing on remote supercomputing resources. The paper focuses on employing an open community based workflow system in developing and deploying LCCI infrastructures. The paper also emphasizes on the enhancements made to infrastructure to add advanced workflow capabilities providing greater flexibility in handling parametric sweeps and provenance aware workflows. The paper discusses on how the provenance integration will not only capture execution trace but dynamically modify the workflow graph at run time to re-use retrospective execution results.","PeriodicalId":178841,"journal":{"name":"2012 IEEE Ninth International Conference on Services Computing","volume":"23 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":"115606331","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":"Collective Intelligence Applications in IT Services Business","authors":"M. Vukovic, O. Stewart","doi":"10.1109/SCC.2012.55","DOIUrl":"https://doi.org/10.1109/SCC.2012.55","url":null,"abstract":"IT outsourcing enables companies to contract out IT services, such as infrastructure and application management to external providers. IT services delivery relies on knowledge that is in the collective possession of application and infrastructure specialists. With recent advances in harnessing the expertise of network-connected humans, services businesses have also started to seek strategies to efficiently utilize the collective knowledge of their employees. In this paper, we present the application of collective intelligence to three different service types: 1) automation (translation solution), 2) infrastructure management (asset inventory discovery) and 3) application management (software development). We extrapolate a set of salient properties (i.e., input, output, and size of the collective input) as the key elements for employing collective intelligence within the services business. We discuss some of the differences amongst the disparate collective intelligence services and present the resulting distinctive properties as challenges that may inspire further research in services business.","PeriodicalId":178841,"journal":{"name":"2012 IEEE Ninth International Conference on Services Computing","volume":"16 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":"116243888","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}