2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06)

2-4 Oct. 2006

Filter Results

Displaying Results 1 - 25 of 48
  • 25th IEEE Symposium on Reliable Distributed Systems - Cover

    Publication Year: 2006, Page(s): c1
    Request permission for commercial reuse | |PDF file iconPDF (137 KB)
    Freely Available from IEEE
  • 25th IEEE Symposium on Reliable Distributed Systems - Title

    Publication Year: 2006, Page(s):i - iii
    Request permission for commercial reuse | |PDF file iconPDF (56 KB)
    Freely Available from IEEE
  • 25th IEEE Symposium on Reliable Distributed Systems - Copyright

    Publication Year: 2006, Page(s): iv
    Request permission for commercial reuse | |PDF file iconPDF (53 KB)
    Freely Available from IEEE
  • 25th IEEE Symposium on Reliable Distributed Systems - Table of contents

    Publication Year: 2006, Page(s):v - viii
    Request permission for commercial reuse | |PDF file iconPDF (57 KB)
    Freely Available from IEEE
  • Message from the Symposium Chair

    Publication Year: 2006, Page(s): ix
    Request permission for commercial reuse | |PDF file iconPDF (44 KB) | HTML iconHTML
    Freely Available from IEEE
  • Message from the Technical Program Co-chairs

    Publication Year: 2006, Page(s): x
    Request permission for commercial reuse | |PDF file iconPDF (46 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference Committees

    Publication Year: 2006, Page(s):xi - xii
    Request permission for commercial reuse | |PDF file iconPDF (40 KB)
    Freely Available from IEEE
  • External reviewers

    Publication Year: 2006, Page(s): xiii
    Request permission for commercial reuse | |PDF file iconPDF (40 KB)
    Freely Available from IEEE
  • Reducing the Availability Management Overheads of Federated Content Sharing Systems

    Publication Year: 2006, Page(s):5 - 17
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (246 KB) | HTML iconHTML

    We consider the problem of ensuring high data availability in federated content sharing systems. Ideally, such a system would provide high data availability in a device transparent manner so that users are not faced with the time-consuming and error-prone task of managing data replicas across the constituent devices of the system. We propose a novel unified availability model and a decentralized r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Topology Sensitive Replica Selection

    Publication Year: 2006, Page(s):18 - 28
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (189 KB) | HTML iconHTML

    As the disks typically found in personal computers grow larger, protecting data by replicating it on a collection of "peer" systems rather than on dedicated high performance storage systems can provide comparable reliability and availability guarantees but at reduced cost and complexity. In order to be adopted, peer-to-peer storage systems must be able to replicate data on hosts that are trusted, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deleting Files in the Celeste Peer-to-Peer Storage System

    Publication Year: 2006, Page(s):29 - 38
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (205 KB) | HTML iconHTML

    Celeste is a robust peer-to-peer object store built on top of a distributed hash table (DHT). Celeste is a working system, developed by Sun Microsystems Laboratories. During the development of Celeste, we faced the challenge of complete object deletion, and moreover, of deleting "files" composed of several different objects. This important problem is not solved by merely deleting meta-data, as the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliably Executing Tasks in the Presence of Untrusted Entities

    Publication Year: 2006, Page(s):39 - 50
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (283 KB) | HTML iconHTML

    In this work we consider a distributed system formed by a master processor and a collection of n processors (workers) that can execute tasks; worker processors are untrusted and might act maliciously. The master assigns tasks to workers to be executed. Each task returns a binary value, and we want the master to accept only correct values with high probability. Furthermore, we assume that the servi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • WRAPS: Denial-of-Service Defense through Web Referrals

    Publication Year: 2006, Page(s):51 - 60
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (180 KB) | HTML iconHTML

    The Web is a complicated graph, with millions of Web sites interlinked together. In this paper, we propose to use this Web sitegraph structure to mitigate flooding attacks on a Web site, using a new Web referral architecture for privileged service ("WRAPS"). WRAPS allows a legitimate client to obtain a privilege URL through a click on a referral hypher-link, from a Web site trusted by the target W... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Client-Transparent Approach to Defend Against Denial of Service Attacks

    Publication Year: 2006, Page(s):61 - 70
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (260 KB) | HTML iconHTML

    Denial of service (DoS) attacks attempt to consume a server's resources (network bandwidth, computing power, main memory, disk bandwidth etc.) to near exhaustion so that there are no resources left to handle requests from legitimate clients. An effective solution to defend against DoS attacks is to filter DoS attack requests at the earliest point (say, the Web site's firewall), before they consume... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proactive Resilience Revisited: The Delicate Balance Between Resisting Intrusions and Remaining Available

    Publication Year: 2006, Page(s):71 - 82
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (315 KB) | HTML iconHTML

    In a recent paper, we presented proactive resilience as a new approach to proactive recovery, based on architectural hybridization. We showed that, with appropriate assumptions about fault rate, proactive resilience makes it possible to build distributed intrusion-tolerant systems guaranteed not to suffer more than the assumed number of faults during their lifetime. In this paper, we explore the i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Call Availability Prediction in a Telecommunication System: A Data Driven Empirical Approach

    Publication Year: 2006, Page(s):83 - 95
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (8307 KB) | HTML iconHTML

    Availability prediction in a telecommunication system plays a crucial role in its management, either by alerting the operator to potential failures or by proactively initiating preventive measures. In this paper, we apply linear (ARMA, multivariate, random walk) and nonlinear (Radial and Universal Basis Functions) regression techniques to recognize system failures and to predict the system's call ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • FT-PPTC: An Efficient and Fault-Tolerant Commit Protocol for Mobile Environments

    Publication Year: 2006, Page(s):96 - 105
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (331 KB) | HTML iconHTML

    Transactions are required not only for wired networks but also for the emerging wireless environments where mobile and fixed hosts participate side by side in the execution of the transaction. This heterogenous environment is characterized by constraints in mobile host capabilities, network connectivity and also an increasing number of possible failure modes. Classical atomic commit protocols used... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling Distributed Computing System Reliability with DRBD

    Publication Year: 2006, Page(s):106 - 118
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (362 KB) | HTML iconHTML

    Nowadays the great part of devices or systems we commonly use are often driven or managed by microchips and computers: cars, music players, phones, trains, planes, .... A consolidated trend of technology is to substitute mechanical with electronic parts, analogical with digital devices or controls, and so on. In this context, features like security, availability and reliability, usually summarized... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DRIFT: Efficient Message Ordering in Ad Hoc Networks Using Virtual Flooding

    Publication Year: 2006, Page(s):119 - 131
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (369 KB) | HTML iconHTML

    We present DRIFT - a total order multicast algorithm for ad hoc networks with mobile or static nodes. Due to the ad hoc nature of the network, DRIFT uses flooding for message propagation. The key idea of DRIFT is virtual flooding - a way of using unrelated message streams to propagate message causality information in order to accelerate message delivery. We describe DRIFT in detail. We evaluate it... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalised Repair for Overlay Networks

    Publication Year: 2006, Page(s):132 - 142
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (281 KB) | HTML iconHTML

    We present and evaluate a generic approach to the repair of overlay networks which identifies general principles of overlay repair and embodies these as a reusable service. At the heart of our approach is an algorithm that discovers the extent of a failed section of any type of overlay, and assigns responsibility to carry out the repair. The repair strategy itself is 'pluggable' and can be tailore... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decentralized Local Failure Detection in Dynamic Distributed Systems

    Publication Year: 2006, Page(s):143 - 154
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (515 KB) | HTML iconHTML

    A failure detector is an important building block when constructing fault-tolerant distributed systems. In asynchronous distributed systems, failed processes are often indistinguishable from slow processes. A failure detector is an oracle that can intelligently suspect processes to have failed. Different classes of failure detectors have been proposed to solve different kinds of problems. Almost a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improvements and Reconsideration of Distributed Snapshot Protocols

    Publication Year: 2006, Page(s):155 - 164
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (224 KB) | HTML iconHTML

    Distributed snapshots are an important building block for distributed systems, and, among other applications, are useful for constructing efficient checkpointing protocols. In addition to the imposed overhead of the existing distributed snapshot protocols, those protocols are not trivially applicable (if at all) in many of today's distributed systems, e.g., grid, mobile, and sensors systems. After... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Weakly-Persistent Causal Objects in Dynamic Distributed Systems

    Publication Year: 2006, Page(s):165 - 174
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (213 KB) | HTML iconHTML

    In the context of clients accessing a read/write shared object, persistency of a written value is a property stating that a value written into the object is always available unless overwritten by a successive write operation. This property can be easily guaranteed in a static distributed system provided that either a subset of processes implementing the object does not crash or processes can crash... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-Blocking Synchronous Checkpointing Based on Rollback-Dependency Trackability

    Publication Year: 2006, Page(s): 411
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (215 KB) | HTML iconHTML

    This article proposes an original approach that applies the rollback-dependency trackability (RDT) property to implement a new non-blocking synchronous checkpointing protocol, called RDT-NBS, that takes mutable checkpoints and efficiently supports concurrent initiators. Mutable checkpoints can be saved in non-stable storage and make it possible for non-blocking synchronous checkpointing protocols ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PLATO: Predictive Latency-Aware Total Ordering

    Publication Year: 2006, Page(s):175 - 188
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (747 KB) | HTML iconHTML

    PLATO is a predictive total ordering protocol designed for low-latency multicast in datacenters. It predicts out-of-order arrival of multicast packets by observing their inter-arrival times, and delays packets before passing them up to the application only if it believes the packets to have arrived in the wrong order. We show through experimentation on real datacenter-style networks that the inter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.