International Conference on Autonomic Computing, 2004. Proceedings.最新文献

{"title":"Subscription-driven self-organization in content-based publish/subscribe","authors":"R. Baldoni, R. Beraldi, Leonardo Querzoni, A. Virgillito","doi":"10.1109/ICAC.2004.57","DOIUrl":"https://doi.org/10.1109/ICAC.2004.57","url":null,"abstract":"In this paper, we outline an approach for enhancing content-based routing performance in publish/subscribe systems composed by an application-level network of event brokers. We present an algorithm which aim is to logically place close (in terms of TCP hops) brokers that manage subscribers with similar interests. We show how this algorithm allows the content-based routing algorithm to work in a favorable scenario, thus increasing its global performance.","PeriodicalId":345031,"journal":{"name":"International Conference on Autonomic Computing, 2004. Proceedings.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116971872","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":"RepStore: a self-managing and self-tuning storage backend with smart bricks","authors":"Zheng Zhang, Shiding Lin, Qiao Lian, C. Jin","doi":"10.1109/ICAC.2004.50","DOIUrl":"https://doi.org/10.1109/ICAC.2004.50","url":null,"abstract":"With the continuously improving price-performance ratio, building large, smart-brick based distributed storage system becomes increasingly attractive. The challenges, however, include not only reliability, adequate cost-performance ratio, online upgrades and so on, but also the system's ability to achieve these goals in as self-managing and self-adaptive a manner as possible. In this paper, we describe RepStore, a system that fulfills these goals. RepStore unites the self-organizing capability of P2P DHT and the completely autonomous, per-brick tuning mechanism to derive a scalable and cost-effective architecture. RepStore employs replication for active write-intensive data and erasure-coding for the rest, strives to achieve the best cost-performance balance automatically and transparent to application, and does so in a completely distributed manner. Our preliminary evaluations reveal that the system performs much as expected, achieving performance and reliability closer to a 3-way fully replicated system with only 60% of the cost.","PeriodicalId":345031,"journal":{"name":"International Conference on Autonomic Computing, 2004. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130815429","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":"Benchmarking autonomic capabilities: promises and pitfalls","authors":"Aaron B. Brown, J. Hellerstein, Matt Hogstrom, Tony S. Lau, S. Lightstone, Peter Shum, M. P. Yost","doi":"10.1109/ICAC.2004.22","DOIUrl":"https://doi.org/10.1109/ICAC.2004.22","url":null,"abstract":"Benchmarks provide a way to quantify progress in a field. Our goal is to produce a suite of benchmarks covering the four categories of autonomic capabilities: self-configuring, self-healing, self-optimizing, and self-protecting (IBM, 2003). This is not an easy task, however, and in this paper we identify several of the challenges and pitfalls that must be confronted to extend benchmarking technology beyond its traditional basis in performance evaluation.","PeriodicalId":345031,"journal":{"name":"International Conference on Autonomic Computing, 2004. Proceedings.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117264500","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":"Autonomic systems for mobile robots","authors":"Nik A. Melchior, W. Smart","doi":"10.1109/ICAC.2004.20","DOIUrl":"https://doi.org/10.1109/ICAC.2004.20","url":null,"abstract":"Mobile robots are an excellent testbed for autonomic computing research. The ultimate goal of robotics research is to develop a platform that can function autonomously in the face of hardware and software failures. This goal is becoming more important as robots are increasingly being deployed outside of controlled environments. In this paper, we discuss our work toward implementing an autonomic system for a mobile robot. This work is motivated by our experiences with existing mobile robot control software during real-world deployments.","PeriodicalId":345031,"journal":{"name":"International Conference on Autonomic Computing, 2004. Proceedings.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127763120","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":"Pricing and autonomic control of Web servers with time-varying request patterns","authors":"Yiyu Chen, Amitayu Das, N. Gautam, Qian Wang, A. Sivasubramaniam","doi":"10.1109/ICAC.2004.45","DOIUrl":"https://doi.org/10.1109/ICAC.2004.45","url":null,"abstract":"The motivation for this paper stems from two important emerging trends: (i) the growth of commercial services on the Internet, and (ii) the need for deploying systems that can automatically tune themselves. The need for automatic tuning for price (charged by the service provider) becomes particularly acute not only because of high costs of involving humans in system operation but also because such tuning should be nimble enough to adapt to workload changes. This paper introduces a dynamic pricing structure which is fair to both clients and servers. It also examines techniques for dynamically setting the price. During widely time-varying loads, if the server charges a fixed price regardless of load, it can result in either being unfair to the clients or a loss in revenue earned. Again, fixing the price to a low value can decrease the revenue that a server could potentially make. Our first contribution in this paper is a combination of pricing and admission control strategy for such commercial services that take the above-mentioned factors into consideration. In the first step, the customer/client is offered a price package. The second step enforces a level of admission control imposed by the server. It can so happen that a client despite the high price, chooses to get service at a time of high load. The server can use the second step as a way of rejecting this client if it feels that the revenue it would make from this client can be offset by the lower revenue due to degradation in QoS for others. The second contribution in this paper is in developing and evaluating three heuristics for dynamically modulating the above pricing/admission-control strategy to maximize revenue. Some of the factors that need to be taken into consideration when designing techniques for modulating the parameters are revenue enhancement (for the server), implementability and computational complexity. We specifically focus on a Web service on the Internet that needs to cater to the http file requests of a large number of clients on a continuous basis.","PeriodicalId":345031,"journal":{"name":"International Conference on Autonomic Computing, 2004. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134009297","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":"Robustness and security in a mobile-agent based network monitoring system","authors":"A. Tripathi, Muralidhar Koka, Sandeep Karanth, Ivan Osipkov, Harsha Talkad, Tanvir Ahmed, David Johnson, Scott Dier","doi":"10.1109/ICAC.2004.51","DOIUrl":"https://doi.org/10.1109/ICAC.2004.51","url":null,"abstract":"We present the mechanisms for self-recovery in Konark, a mobile agent based system for monitoring network computing systems. An important aspect of our design is the use of the monitoring system's inherent capabilities to detect its own component failures. The Konark system is implemented using Ajanta. Our monitoring system achieves robustness by incorporating mechanisms for self-monitoring and self-configuration at different levels of the system architecture. The event detection, correlation, and notification mechanisms are used as the basic building blocks for failure detection. Our design uses the notion of continuous periodic detection and notification of a failure event until the failed components causing it are repaired.","PeriodicalId":345031,"journal":{"name":"International Conference on Autonomic Computing, 2004. Proceedings.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130979583","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":"Reinforcement learning for autonomic network repair","authors":"M. Littman, N. Ravi, E. Fenson, R. Howard","doi":"10.1109/ICAC.2004.48","DOIUrl":"https://doi.org/10.1109/ICAC.2004.48","url":null,"abstract":"We report on our efforts to formulate autonomic network repair as a reinforcement-learning problem. Our implemented system is able to learn to efficiently restore network connectivity after a failure.","PeriodicalId":345031,"journal":{"name":"International Conference on Autonomic Computing, 2004. Proceedings.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126148065","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":"The organic grid: self-organizing computation on a peer-to-peer network","authors":"A. Chakravarti, Gerald Baumgartner, Mario Lauria","doi":"10.1109/TSMCA.2005.846396","DOIUrl":"https://doi.org/10.1109/TSMCA.2005.846396","url":null,"abstract":"Desktop grids have recently been used to perform some of the largest computations in the world and have the potential to grow by several more orders of magnitude. However, current approaches to utilizing desktop resources require either centralized servers or extensive knowledge of the underlying system, limiting their scalability. We propose a biologically inspired and fully-decentralized approach to the organization of computation that is based on the autonomous scheduling of strongly mobile agents on a peer-to-peer network. In a radical departure from current models, we envision large-scale desktop grids in which agents autonomously organize themselves so as to maximize resource utilization. By encapsulating computation and behavior into agents, the organization of the computation can be customized for different classes of applications. At the same time, the design of the underlying infrastructure is greatly simplified, resulting in a system that naturally lends itself to a true peer-to-peer implementation where each node can be at the same time provider and user of the computing utility infrastructure. We demonstrate this concept with a reduced-scale proof-of-concept implementation that executes a data-intensive independent-task application on a set of heterogeneous, geographically distributed machines. We present a detailed exploration of the design space of our system and a performance evaluation of our implementation using metrics appropriate for assessing self-organizing desktop grids.","PeriodicalId":345031,"journal":{"name":"International Conference on Autonomic Computing, 2004. Proceedings.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115336001","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":"GRUSEL - a self optimizing, bandwidth aware video on demand P2P application","authors":"C. Loeser, M. Ditze, P. Altenbernd, F. Rammig","doi":"10.1109/ICAC.2004.35","DOIUrl":"https://doi.org/10.1109/ICAC.2004.35","url":null,"abstract":"The main target of the application is an autonomic, self optimizing video on demand system with minimal administration effort. Thus we focus on content replication due to past access frequencies. The P2P communication strategy can be adapted to streaming applications: movie content is not just transferred via best effort but may be streamed from one peer to another with QoS guarantees.","PeriodicalId":345031,"journal":{"name":"International Conference on Autonomic Computing, 2004. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124371072","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 scheme for reliable delivery of events in distributed middleware systems","authors":"S. Pallickara, G. Fox","doi":"10.1109/ICAC.2004.4","DOIUrl":"https://doi.org/10.1109/ICAC.2004.4","url":null,"abstract":"Increasingly interactions that services and entities have with each other, and among themselves, are network bound. These interactions can be encapsulated in events. We describe a scheme for the reliable delivery of events in the presence of link and node failures.","PeriodicalId":345031,"journal":{"name":"International Conference on Autonomic Computing, 2004. Proceedings.","volume":"254 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121074254","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}