{"title":"An Autonomic Service Discovery Mechanism to Support Pervasive Device Accessing Semantic Grid","authors":"Tao Guan, E. Zaluska, D. D. Roure","doi":"10.1109/ICAC.2007.5","DOIUrl":"https://doi.org/10.1109/ICAC.2007.5","url":null,"abstract":"An important challenge of integrating pervasive devices into Grid environment to enhance pervasive device capabilities is that pervasive devices need to locate, find, select and invoke the appropriate Grid services in an autonomic and flexible way. However, at this stage, both Grid service description and discovery standards are not very sophisticated. Semantic web technology benefits the concept of Grid services on pervasive devices by adding machine- processable explicit knowledge into the interaction between pervasive devices and Grid services. In this paper, we have presented a semantic-based Grid service discovery mechanism to support pervasive device accessing Grid services. In order to protect personal privacy in the pervasive computing environment, a service discovery restricting mechanism is also built to ensure the service can automatically be hidden for unauthorized users.","PeriodicalId":179923,"journal":{"name":"Fourth International Conference on Autonomic Computing (ICAC'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126163524","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. Taton, N. D. Palma, D. Hagimont, S. Bouchenak, J. Philippe
{"title":"Self-Optimization of Clustered Message-Oriented Middleware","authors":"C. Taton, N. D. Palma, D. Hagimont, S. Bouchenak, J. Philippe","doi":"10.1007/978-3-540-76848-7_38","DOIUrl":"https://doi.org/10.1007/978-3-540-76848-7_38","url":null,"abstract":"","PeriodicalId":179923,"journal":{"name":"Fourth International Conference on Autonomic Computing (ICAC'07)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131328047","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":"Policy Verification and Validation Framework Based on Model Checking Approach","authors":"S. Kikuchi, S. Tsuchiya, M. Adachi, T. Katsuyama","doi":"10.1109/ICAC.2007.31","DOIUrl":"https://doi.org/10.1109/ICAC.2007.31","url":null,"abstract":"Policy-based management is drawing attention as a solution to managing today's complex information systems. To be dependable, a policy-based system must be able to check the validity of a policy written by administrators. However, common test methods such as operations tests in a test scenario and simulations cannot check whether systems with given policies will work properly in every possible situation. To solve this problem, we propose a policy verification and validation framework based on model checking that exhaustively verifies a policy's validity by considering the relations between system characteristics and policies. We first define the validity of policies and the information needed to verify them from the viewpoint of model checking. We then construct our policy verification framework based on the definition and, finally, present a case study applying this framework to an on-demand data center scenario and show the effectiveness of our approach.","PeriodicalId":179923,"journal":{"name":"Fourth International Conference on Autonomic Computing (ICAC'07)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114290291","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}
J. Kephart, H. Chan, R. Das, David W. Levine, G. Tesauro, F. Rawson, C. Lefurgy
{"title":"Coordinating Multiple Autonomic Managers to Achieve Specified Power-Performance Tradeoffs","authors":"J. Kephart, H. Chan, R. Das, David W. Levine, G. Tesauro, F. Rawson, C. Lefurgy","doi":"10.1109/ICAC.2007.12","DOIUrl":"https://doi.org/10.1109/ICAC.2007.12","url":null,"abstract":"Getting multiple autonomic managers to work together towards a common goal is a significant architectural and algorithmic challenge, as noted in the ICAC 2006 panel discussion regarding \"Can we build effective multi-vendor autonomic systems?\" We address this challenge in a real small-scale system that processes web transactions. An administrator uses a utility function to define a set of power and performance objectives. Rather than creating a central controller to manage performance and power simultaneously, we use two existing IBM products, one that manages performance and one that manages power by controlling clock frequency. We demonstrate that, with good architectural and algorithmic choices established through trial and error, the two managers can indeed work together to act in accordance with a flexible set of power-performance objectives and tradeoffs, resulting in power savings of approximately 10%. Key elements of our approach include (a) a feedback controller that establishes a power cap (a limit on consumed power) by manipulating clock frequency and (b) reinforcement learning, which adoptively learns models of the dependence of performance and power consumption on workload intensity and the powercap.","PeriodicalId":179923,"journal":{"name":"Fourth International Conference on Autonomic Computing (ICAC'07)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122895076","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":"Strider Search Ranger: Towards an Autonomic Anti-Spam Search Engine","authors":"Yi-Min Wang, Ming Ma","doi":"10.1109/ICAC.2007.38","DOIUrl":"https://doi.org/10.1109/ICAC.2007.38","url":null,"abstract":"Search spammers use questionable search engine optimization techniques to promote their spam links into top search results. Large-scale spammers target commerce queries that they can monetize and attempt to spam as many top search results of those queries as possible. We model the large-scale search spam problem as that of defending against correlated attacks on search rankings across multiple keywords, and propose an autonomic anti-spam approach based on self-monitoring and self- protection. In this new approach, search engines monitor and correlate their own search results of spammer-targeted keywords to detect large-scale spam attacks that have successfully bypassed their current anti-spam solutions. They then initiate self-protection through targeted patrol of spam-heavy domains, targeted hunting at the sources of successful spam, and strengthening of specific weakness in the ranking algorithms. We describe the strider search ranger system which implements this new approach, and focus on its use to defend against an important class of search spam - the redirection spam - as a demonstration of the general concept. We evaluate the system by testing it against actual search results and show that it can detect useful spam patterns and eliminate a significant amount of spam for all three major search engines.","PeriodicalId":179923,"journal":{"name":"Fourth International Conference on Autonomic Computing (ICAC'07)","volume":"189 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122814769","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":"Energy-Aware Mobile Service Overlays: Cooperative Dynamic Power Management in Distributed Mobile Systems","authors":"B. Seshasayee, Ripal Nathuji, K. Schwan","doi":"10.1109/ICAC.2007.14","DOIUrl":"https://doi.org/10.1109/ICAC.2007.14","url":null,"abstract":"With their increasingly powerful computational resources and high-speed wireless communications, future mobile systems will have the ability to run sophisticated applications on collections of cooperative end devices. Mobility, however, requires dynamic management of these platforms' distributed resources, and such management can also be used to meet application quality requirements and prolong application lifetimes, the latter by best using available energy resources. This paper presents energy-aware mobile service overlays (MSOs), a set of mechanisms and associated policies for running mobile applications across multiple, cooperating machines while actively performing power management to extend system usability lifetimes. MSO policies manage energy consumption by (i) allocating application components to available nodes based upon their current energy capacities and resource availabilities, (ii) monitoring for, and responding to changes in energy and resource characteristics, and (iii) dynamically exploiting energy-performance tradeoffs in over provisioned situations. Coupled with mobility, such cooperation enables multiple mobile platforms to bring their joint resources to bear on complex application tasks, providing significant benefits to application lifetimes and performance. Evaluations of MSOs on a MANET computing testbed indicate an extension in system lifetime of up to 10% for an example application.","PeriodicalId":179923,"journal":{"name":"Fourth International Conference on Autonomic Computing (ICAC'07)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129743988","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":"Fault-Tolerant Reliable Delivery of Messages in Distributed Publish/Subscribe Systems","authors":"S. Pallickara, Hasan Bulut, G. Fox","doi":"10.1109/ICAC.2007.18","DOIUrl":"https://doi.org/10.1109/ICAC.2007.18","url":null,"abstract":"Reliable delivery of messages is an important problem that needs to be addressed in distributed systems. In this paper we briefly describe our basic strategy to enable reliable delivery of messages in the presence of link and node failures. This is facilitated by a specialized repository node. We then present our strategy to make this scheme even more failure resilient, by incorporating support for repository redundancy. Each repository functions autonomously. The scheme enables updates to the redundancy scheme depending on the failure resiliency requirements. If there are N available repositories, reliable delivery guarantees will be met even if N-1 repositories fail.","PeriodicalId":179923,"journal":{"name":"Fourth International Conference on Autonomic Computing (ICAC'07)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115784213","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 Regression-Based Analytic Model for Dynamic Resource Provisioning of Multi-Tier Applications","authors":"Qi Zhang, L. Cherkasova, E. Smirni","doi":"10.1109/ICAC.2007.1","DOIUrl":"https://doi.org/10.1109/ICAC.2007.1","url":null,"abstract":"The multi-tier implementation has become the industry standard for developing scalable client-server enterprise applications. Since these applications are performance sensitive, effective models for dynamic resource provisioning and for delivering quality of service to these applications become critical. Workloads in such environments are characterized by client sessions of interdependent requests with changing transaction mix and load over time, making model adaptivity to the observed workload changes a critical requirement for model effectiveness. In this work, we apply a regression-based approximation of the CPU demand of client transactions on a given hardware. Then we use this approximation in an analytic model of a simple network of queues, each queue representing a tier, and show the approximation's effectiveness for modeling diverse workloads with a changing transaction mix over time. Using the TPC- W benchmark and its three different transaction mixes we investigate factors that impact the efficiency and accuracy of the proposed performance prediction models. Experimental results show that this regression-based approach provides a simple and powerful solution for efficient capacity planning and resource provisioning of multi-tier applications under changing workload conditions.","PeriodicalId":179923,"journal":{"name":"Fourth International Conference on Autonomic Computing (ICAC'07)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127137831","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":"Identifying Performance-Critical Components in Transaction-Oriented Distributed Systems","authors":"Rui Zhang","doi":"10.1109/ICAC.2007.24","DOIUrl":"https://doi.org/10.1109/ICAC.2007.24","url":null,"abstract":"In order to make a difference in transaction- oriented distributed environments, performance management efforts must be focused on those components that play a critical role in end-to-end system performance. This paper overviews a flexible approach to identifying these components and quantifying their criticality, through a statistical extension to the classic critical path algorithm for DAGs. A preliminary case study in a real-world service-oriented Grid is used to demonstrate the approach.","PeriodicalId":179923,"journal":{"name":"Fourth International Conference on Autonomic Computing (ICAC'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130232714","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":"Using the Right Amount of Monitoring in Adaptive Load Sharing","authors":"David Breitgand, Rami Cohen, Amir Nahir, D. Raz","doi":"10.1109/ICAC.2007.41","DOIUrl":"https://doi.org/10.1109/ICAC.2007.41","url":null,"abstract":"In this work we extend the aforementioned supermarket model by incorporating the management costs into it. In particular, we assume that when a server is polled about its load, it has to allocate resources in order to answer this query. We consider a system that consists of n identical servers. Each server processes its incoming service requests according to the FIFO","PeriodicalId":179923,"journal":{"name":"Fourth International Conference on Autonomic Computing (ICAC'07)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115002637","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}