With ubiquitous computing becoming reality there is a great potential of computing power in the surroundings. This can be provided by mobile devices such as mobile phones and PDAs building spontaneous networks. For service provisioning, Web services are an accepted standard. We advocate that these can also be used in ubiquitous scenarios. In this paper, we present SoapME, a novel SOAPbased Web service container for Java ME. SoapME is very lightweight and supports resource-limited devices running only Java ME CLDC. Unlike related work, it provides dynamic deployment of SOAP-based Web services at runtime. Our SoapME prototype provides several extension points, for instance for invocation interception. It shows reasonable performance on a mobile phone and is compliant to the standard SOAP test collection specification.
随着无处不在的计算成为现实，周围环境的计算能力具有巨大的潜力。这可以通过移动设备，如移动电话和pda建立自发网络来提供。对于服务供应，Web服务是一种可接受的标准。我们主张这些也可以用于无处不在的场景。在本文中，我们介绍了SoapME，一种用于Java ME的新颖的基于soap的Web服务容器。SoapME非常轻量级，支持只运行Java ME CLDC的资源有限的设备。与相关工作不同，它在运行时提供基于soap的Web服务的动态部署。我们的SoapME原型提供了几个扩展点，例如用于调用拦截。它在移动电话上显示了合理的性能，并且符合标准SOAP测试集合规范。
{"title":"SoapME: a lightweight Java ME web service container","authors":"Holger Schmidt, Andreas Köhrer, F. Hauck","doi":"10.1145/1462802.1462805","DOIUrl":"https://doi.org/10.1145/1462802.1462805","url":null,"abstract":"With ubiquitous computing becoming reality there is a great potential of computing power in the surroundings. This can be provided by mobile devices such as mobile phones and PDAs building spontaneous networks. For service provisioning, Web services are an accepted standard. We advocate that these can also be used in ubiquitous scenarios.\u0000 In this paper, we present SoapME, a novel SOAPbased Web service container for Java ME. SoapME is very lightweight and supports resource-limited devices running only Java ME CLDC. Unlike related work, it provides dynamic deployment of SOAP-based Web services at runtime. Our SoapME prototype provides several extension points, for instance for invocation interception. It shows reasonable performance on a mobile phone and is compliant to the standard SOAP test collection specification.","PeriodicalId":376035,"journal":{"name":"Middleware for Service Oriented Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127690960","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}
Cássio M. M. Pereira, D. C. Lobato, C. Teixeira, M. G. Pimentel
Causal and total event ordering are Quality of Service guarantees needed by many distributed applications, such as collaborative whiteboards, chat systems, online multiplayer games, and has also usage when implementing active replication, replicated databases and other systems. Most state of the art Publish/Subscribe middlewares offer no guarantees regarding event ordering either because of the bandwidth overhead associated with the vector clock approach or the bottleneck of a central sequencer. In this paper we propose an architecture based on distributed shared memory, where publishers of the same group can publish at different brokers, while maintaining event ordering. By synchronizing broker access to one shared logical clock per group, causal and total event ordering is achieved. Our architecture allows events to be delivered out-of-order to subscribers, while giving them a way to correctly reorder events. Results of experiments with a reference implementation of the architecture show that the bandwidth consumption of our ordering mechanism can be three orders of magnitude lower than a vector based solution.
{"title":"Achieving causal and total ordering in publish/subscribe middleware with DSM","authors":"Cássio M. M. Pereira, D. C. Lobato, C. Teixeira, M. G. Pimentel","doi":"10.1145/1462802.1462813","DOIUrl":"https://doi.org/10.1145/1462802.1462813","url":null,"abstract":"Causal and total event ordering are Quality of Service guarantees needed by many distributed applications, such as collaborative whiteboards, chat systems, online multiplayer games, and has also usage when implementing active replication, replicated databases and other systems. Most state of the art Publish/Subscribe middlewares offer no guarantees regarding event ordering either because of the bandwidth overhead associated with the vector clock approach or the bottleneck of a central sequencer. In this paper we propose an architecture based on distributed shared memory, where publishers of the same group can publish at different brokers, while maintaining event ordering. By synchronizing broker access to one shared logical clock per group, causal and total event ordering is achieved. Our architecture allows events to be delivered out-of-order to subscribers, while giving them a way to correctly reorder events. Results of experiments with a reference implementation of the architecture show that the bandwidth consumption of our ordering mechanism can be three orders of magnitude lower than a vector based solution.","PeriodicalId":376035,"journal":{"name":"Middleware for Service Oriented Computing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124535854","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 aim of the SOAJA project (Service Oriented Adaptive Java Applications) is to develop a service-oriented infrastructure enabling efficient application running in complex, networked computing environments (GRID). The SOAJA infrastructure provides components and services enabling static and dynamic load balancing through Java object observation. SOAJA performs large scale computing using idle CPU time of the nodes of a GRID. Java Distributed Applications consist of many objects which are processed in parallel which SOAJA allocates to each Grid nodes at runtime. In this paper, we present the mechanisms and algorithms which ensures the automatic adaptation of the application objects, in response to the computing evolutions and to modifications of the resource availability. These mechanisms permit to control the granularity of the treatment and the distribution of the application on the Grid platform.
{"title":"Service oriented adaptive Java applications","authors":"I. Alshabani, R. Olejnik, B. Toursel","doi":"10.1145/1462802.1462810","DOIUrl":"https://doi.org/10.1145/1462802.1462810","url":null,"abstract":"The aim of the SOAJA project (Service Oriented Adaptive Java Applications) is to develop a service-oriented infrastructure enabling efficient application running in complex, networked computing environments (GRID). The SOAJA infrastructure provides components and services enabling static and dynamic load balancing through Java object observation. SOAJA performs large scale computing using idle CPU time of the nodes of a GRID. Java Distributed Applications consist of many objects which are processed in parallel which SOAJA allocates to each Grid nodes at runtime. In this paper, we present the mechanisms and algorithms which ensures the automatic adaptation of the application objects, in response to the computing evolutions and to modifications of the resource availability. These mechanisms permit to control the granularity of the treatment and the distribution of the application on the Grid platform.","PeriodicalId":376035,"journal":{"name":"Middleware for Service Oriented Computing","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114459526","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-Oriented Architectures (SOA) are built as compositions of inter-organizational services. These services are deployed and published by providers who are responsible for provisioning the services with sufficient resources. However, even though services are implemented by technologies providing a wide range of adaptation related features, such as configurable component models and communication infrastructures, state-of-the-art approaches to adaptive SOA systems do not provide principled solutions to exploit application layer adaptation mechanisms. Our technology-agnostic adaptation middleware has been designed for integrating and exploiting technology-specific adaptation technologies and mechanisms. In this paper, we describe how this middleware can support a cross-layer adaptation of SOA systems. In particular, we focus on the server-side perspective of SOA, and we show that our middleware is able to exploit both service interface and application layers technologies for supporting a coordinated adaptation of both layers.
{"title":"Cross-layer self-adaptation of service-oriented architectures","authors":"Eli Gjørven, Romain Rouvoy, F. Eliassen","doi":"10.1145/1462802.1462809","DOIUrl":"https://doi.org/10.1145/1462802.1462809","url":null,"abstract":"Service-Oriented Architectures (SOA) are built as compositions of inter-organizational services. These services are deployed and published by providers who are responsible for provisioning the services with sufficient resources. However, even though services are implemented by technologies providing a wide range of adaptation related features, such as configurable component models and communication infrastructures, state-of-the-art approaches to adaptive SOA systems do not provide principled solutions to exploit application layer adaptation mechanisms.\u0000 Our technology-agnostic adaptation middleware has been designed for integrating and exploiting technology-specific adaptation technologies and mechanisms. In this paper, we describe how this middleware can support a cross-layer adaptation of SOA systems. In particular, we focus on the server-side perspective of SOA, and we show that our middleware is able to exploit both service interface and application layers technologies for supporting a coordinated adaptation of both layers.","PeriodicalId":376035,"journal":{"name":"Middleware for Service Oriented Computing","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132219083","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}
Current workflow languages introduce limitations regarding modularity and flexibility. They are lacking support for reusability of primitive and structured activities. Designing processes often leads to duplication which makes the workflow descriptor complicated and unnecessarily large. Furthermore, due to the static character of the scripts, there is insufficient flexibility to model dynamic, evolvable and failsafe workflows. In this paper we present a framework that allows the design of WS-BPEL processes in a modular way based on reusable templates. In addition, we introduce an extra layer on top of WS-BPEL that allows template processing based on parameter values. This layer offers support for decision logic to adapt processes dynamically. The approach is based on the "Ruby On Rails" (RoR) framework, known for adding dynamism to static web pages. The proposed solution is portable with existing WS-BPEL engines.
当前的工作流语言引入了模块化和灵活性方面的限制。它们缺乏对原始和结构化活动的可重用性的支持。设计过程经常导致重复，这使得工作流描述符复杂且不必要地大。此外，由于脚本的静态特性，对动态、可演化和故障安全工作流建模的灵活性不足。在本文中，我们提出了一个框架，该框架允许基于可重用模板以模块化的方式设计WS-BPEL流程。此外，我们在WS-BPEL之上引入了一个额外的层，该层允许基于参数值进行模板处理。这一层为决策逻辑提供支持，以动态地调整流程。该方法基于“Ruby on Rails”(RoR)框架，该框架以在静态网页中添加动态性而闻名。建议的解决方案可与现有的WS-BPEL引擎移植。
{"title":"Dynamic reconfiguration using template based web service composition","authors":"Kristof Geebelen, Sam Michiels, W. Joosen","doi":"10.1145/1462802.1462811","DOIUrl":"https://doi.org/10.1145/1462802.1462811","url":null,"abstract":"Current workflow languages introduce limitations regarding modularity and flexibility. They are lacking support for reusability of primitive and structured activities. Designing processes often leads to duplication which makes the workflow descriptor complicated and unnecessarily large. Furthermore, due to the static character of the scripts, there is insufficient flexibility to model dynamic, evolvable and failsafe workflows. In this paper we present a framework that allows the design of WS-BPEL processes in a modular way based on reusable templates. In addition, we introduce an extra layer on top of WS-BPEL that allows template processing based on parameter values. This layer offers support for decision logic to adapt processes dynamically. The approach is based on the \"Ruby On Rails\" (RoR) framework, known for adding dynamism to static web pages. The proposed solution is portable with existing WS-BPEL engines.","PeriodicalId":376035,"journal":{"name":"Middleware for Service Oriented Computing","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117103779","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 growing popularity of hosted storage services and shared storage infrastructure in data centers is driving the recent interest in performance isolation and QoS in storage systems. Due to the bursty nature of storage workloads, meeting the traditional response-time Service Level Agreements requires significant over provisioning of the server capacity. We present a graduated, distribution-based QoS specification for storage servers that provides cost benefits over traditional QoS models. Our method RTT partitions the workload to minimize the capacity required to meet response time requirements of any specified fraction of the requests.
{"title":"Workload decomposition for QoS in hosted storage services","authors":"Lanyue Lu, K. Doshi, P. Varman","doi":"10.1145/1462802.1462806","DOIUrl":"https://doi.org/10.1145/1462802.1462806","url":null,"abstract":"The growing popularity of hosted storage services and shared storage infrastructure in data centers is driving the recent interest in performance isolation and QoS in storage systems. Due to the bursty nature of storage workloads, meeting the traditional response-time Service Level Agreements requires significant over provisioning of the server capacity. We present a graduated, distribution-based QoS specification for storage servers that provides cost benefits over traditional QoS models. Our method RTT partitions the workload to minimize the capacity required to meet response time requirements of any specified fraction of the requests.","PeriodicalId":376035,"journal":{"name":"Middleware for Service Oriented Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129882353","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 today's practice, we see readily precomposed commercial service bundles, such as a spam-free email box, consisting of more elementary services like mail storage and a spam-filter. However, these bundles may be suboptimal from the customer's perspective in terms of price and/or the elementary services that constitute the bundle. It would be advantageous to the customer if a service bundle more closely fulfilled the customer's individual requirements, by selecting the most appropriate elementary services included in the bundle. Also, by obtaining the bundle from a consortium of suppliers, rather than just one single supplier, the elementary services of each supplier with the best cost/benefit ratio can be selected. To put this vision into reality, we need middleware facilitating the automated composition of multisupplier bundles out of basic commercial services available online. We take the stand that the business nature of commercial services imposes leading requirements on the technical design of the middleware. Most importantly, the middleware should be fair in the sense that no single supplier obtains a preferred position in terms of service selection to satisfy a specific customer need. Also, the middleware should be able to deal with alternative services as offered by many competing suppliers, not to speak about the combinatoric explosion, resulting from combining the available services into candidate services bundles. We present a list of problems to be solved to arrive at middleware for multi-supplier service selection, bundling and provisioning. Also, we review existing work, usable to build a fair and efficient middleware solution for commercial service provisioning.
{"title":"Technical challenges in market-driven automated service provisioning","authors":"A. Chmielowiec, G. Pierre, J. Gordijn, M. Steen","doi":"10.1145/1462802.1462807","DOIUrl":"https://doi.org/10.1145/1462802.1462807","url":null,"abstract":"In today's practice, we see readily precomposed commercial service bundles, such as a spam-free email box, consisting of more elementary services like mail storage and a spam-filter. However, these bundles may be suboptimal from the customer's perspective in terms of price and/or the elementary services that constitute the bundle. It would be advantageous to the customer if a service bundle more closely fulfilled the customer's individual requirements, by selecting the most appropriate elementary services included in the bundle. Also, by obtaining the bundle from a consortium of suppliers, rather than just one single supplier, the elementary services of each supplier with the best cost/benefit ratio can be selected. To put this vision into reality, we need middleware facilitating the automated composition of multisupplier bundles out of basic commercial services available online.\u0000 We take the stand that the business nature of commercial services imposes leading requirements on the technical design of the middleware. Most importantly, the middleware should be fair in the sense that no single supplier obtains a preferred position in terms of service selection to satisfy a specific customer need. Also, the middleware should be able to deal with alternative services as offered by many competing suppliers, not to speak about the combinatoric explosion, resulting from combining the available services into candidate services bundles. We present a list of problems to be solved to arrive at middleware for multi-supplier service selection, bundling and provisioning. Also, we review existing work, usable to build a fair and efficient middleware solution for commercial service provisioning.","PeriodicalId":376035,"journal":{"name":"Middleware for Service Oriented Computing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125008065","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}
Many interesting emerging applications involve the coordination of a large number of service instances, for instance, as targets for dissemination or sources in information gathering. These applications raise hard architectural, scalability, and resilience issues that are not suitably addressed by centralized or monolithic coordination solutions. In this paper we propose a lightweight approach to service coordination aimed at such application scenarios. It is based on gossiping and thus potentially fully decentralized, requiring that each participant is concerned only with a small number of peers. Although being obviously simple and scalable, it has been shown that gossip-based protocols lead to emergent strong resilience guarantees. We illustrate the approach with WS--PushGossip, a proof-of-concept coordination protocol based upon the WS--Coordination framework. Besides presenting WS--PushGossip, we illustrate its usefulness with a sample application, and outline a middleware implementation based on Apache Axis2.
{"title":"Gossip-based service coordination for scalability and resilience","authors":"F. Campos, J. Pereira","doi":"10.1145/1462802.1462812","DOIUrl":"https://doi.org/10.1145/1462802.1462812","url":null,"abstract":"Many interesting emerging applications involve the coordination of a large number of service instances, for instance, as targets for dissemination or sources in information gathering. These applications raise hard architectural, scalability, and resilience issues that are not suitably addressed by centralized or monolithic coordination solutions.\u0000 In this paper we propose a lightweight approach to service coordination aimed at such application scenarios. It is based on gossiping and thus potentially fully decentralized, requiring that each participant is concerned only with a small number of peers. Although being obviously simple and scalable, it has been shown that gossip-based protocols lead to emergent strong resilience guarantees.\u0000 We illustrate the approach with WS--PushGossip, a proof-of-concept coordination protocol based upon the WS--Coordination framework. Besides presenting WS--PushGossip, we illustrate its usefulness with a sample application, and outline a middleware implementation based on Apache Axis2.","PeriodicalId":376035,"journal":{"name":"Middleware for Service Oriented Computing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121649343","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 OSGi Service Platform is becoming the de facto middleware for deploying modularized Java applications. It is a dynamic platform that relies on a service oriented approach for loose coupling, but the absence of separate object spaces for isolating services of different modules cannot guarantee that service providers from uninstalled modules will no longer be referenced by active code. This may lead to memory retention and inconsistencies (e.g. a stale service that provides invalid cached data) that can introduce silent faults in the system by propagating invalid information. We present our ongoing work where we introduce an isolation layer between service consumer and provider by using dynamic proxies for services. When the corresponding service becomes unregistered (i.e. uninstalled) the mechanism is able to: 1) Guarantee that no consumers directly refer to the service provider; 2) allow finding out the misreferencing consumer code by using a fail-stop mechanism. We have tested this mechanism in different OSGi based applications and benchmarked it against other approaches for accessing services in the OSGi platform.
{"title":"Using fail-stop proxies for enhancing services isolation in the OSGi service platform","authors":"Kiev Gama, Walter Rudametkin, D. Donsez","doi":"10.1145/1462802.1462804","DOIUrl":"https://doi.org/10.1145/1462802.1462804","url":null,"abstract":"The OSGi Service Platform is becoming the de facto middleware for deploying modularized Java applications. It is a dynamic platform that relies on a service oriented approach for loose coupling, but the absence of separate object spaces for isolating services of different modules cannot guarantee that service providers from uninstalled modules will no longer be referenced by active code. This may lead to memory retention and inconsistencies (e.g. a stale service that provides invalid cached data) that can introduce silent faults in the system by propagating invalid information.\u0000 We present our ongoing work where we introduce an isolation layer between service consumer and provider by using dynamic proxies for services. When the corresponding service becomes unregistered (i.e. uninstalled) the mechanism is able to: 1) Guarantee that no consumers directly refer to the service provider; 2) allow finding out the misreferencing consumer code by using a fail-stop mechanism. We have tested this mechanism in different OSGi based applications and benchmarked it against other approaches for accessing services in the OSGi platform.","PeriodicalId":376035,"journal":{"name":"Middleware for Service Oriented Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130853588","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 management of Service Level Agreements (SLA) in the development of business processes in a Service Oriented Architecture (SOA) often requires much manual and errorprone effort by all parties throughout the lifecycle of the processes. The formal specification of SLAs into development tools can simplify some of this effort. In particular, the runtime provisioning and monitoring of processes can be achieved by an autonomic system that adapts to changing conditions to maintain the SLA's goals. A cost model allows the efficient execution and monitoring of processes, based on a declarative, user-specified optimality function. Experiments demonstrate that the system can indeed adapt to changing workload conditions, saving roughly 70% of the network bandwidth in one particular experiment.
{"title":"SLA-driven distributed application development","authors":"Vinod Muthusamy, H. Jacobsen","doi":"10.1145/1462802.1462808","DOIUrl":"https://doi.org/10.1145/1462802.1462808","url":null,"abstract":"The management of Service Level Agreements (SLA) in the development of business processes in a Service Oriented Architecture (SOA) often requires much manual and errorprone effort by all parties throughout the lifecycle of the processes. The formal specification of SLAs into development tools can simplify some of this effort. In particular, the runtime provisioning and monitoring of processes can be achieved by an autonomic system that adapts to changing conditions to maintain the SLA's goals. A cost model allows the efficient execution and monitoring of processes, based on a declarative, user-specified optimality function. Experiments demonstrate that the system can indeed adapt to changing workload conditions, saving roughly 70% of the network bandwidth in one particular experiment.","PeriodicalId":376035,"journal":{"name":"Middleware for Service Oriented Computing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127449377","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
扫码关注我们
求助内容：
应助结果提醒方式：