2011 IEEE 30th International Symposium on Reliable Distributed Systems

4-7 Oct. 2011

Filter Results

Displaying Results 1 - 25 of 42
  • [Front cover]

    Publication Year: 2011, Page(s): C1
    Request permission for commercial reuse | |PDF file iconPDF (666 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2011, Page(s): i
    Request permission for commercial reuse | |PDF file iconPDF (34 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2011, Page(s): iii
    Request permission for commercial reuse | |PDF file iconPDF (89 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2011, Page(s): iv
    Request permission for commercial reuse | |PDF file iconPDF (107 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2011, Page(s):v - vii
    Request permission for commercial reuse | |PDF file iconPDF (225 KB)
    Freely Available from IEEE
  • Message from the General Chair

    Publication Year: 2011, Page(s): viii
    Request permission for commercial reuse | |PDF file iconPDF (151 KB) | HTML iconHTML
    Freely Available from IEEE
  • Message from the Technical Program Committee Co-Chairs

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

    Publication Year: 2011, Page(s): x
    Request permission for commercial reuse | |PDF file iconPDF (158 KB)
    Freely Available from IEEE
  • Technical Program Committee

    Publication Year: 2011, Page(s): xi
    Request permission for commercial reuse | |PDF file iconPDF (164 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2011, Page(s): xii
    Request permission for commercial reuse | |PDF file iconPDF (141 KB)
    Freely Available from IEEE
  • Exploring Latent Features for Memory-Based QoS Prediction in Cloud Computing

    Publication Year: 2011, Page(s):1 - 10
    Cited by:  Papers (46)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (383 KB) | HTML iconHTML

    With the increasing popularity of cloud computing as a solution for building high-quality applications on distributed components, efficiently evaluating user-side quality of cloud components becomes an urgent and crucial research problem. However, invoking all the available cloud components from user-side for evaluation purpose is expensive and impractical. To address this critical challenge, we p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ELT: Efficient Log-based Troubleshooting System for Cloud Computing Infrastructures

    Publication Year: 2011, Page(s):11 - 20
    Cited by:  Papers (7)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (379 KB) | HTML iconHTML

    We present an Efficient Log-based Troubleshooting(ELT) system for cloud computing infrastructures. ELT adopts a novel hybrid log mining approach that combines coarse-grained and fine-grained log features to achieve both high accuracy and low overhead. Moreover, ELT can automatically extract key log messages and perform invariant checking to greatly simplify the troubleshooting task for the system ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Active Replication at (Almost) No Cost

    Publication Year: 2011, Page(s):21 - 30
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (321 KB) | HTML iconHTML

    MapReduce has become a popular programming paradigm in the domain of batch processing systems. Its simplicity allows applications to be highly scalable and to be easily deployed on large clusters. More recently, the MapReduce approach has been also applied to Event Stream Processing (ESP) systems. This approach, which we call StreamMapReduce, enabled many novel applications that require both scala... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transaction Models for Massively Multiplayer Online Games

    Publication Year: 2011, Page(s):31 - 40
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (326 KB) | HTML iconHTML

    Massively Multiplayer Online Games are considered large distributed systems where the game state is partially replicated across the server and thousands of clients. Given the scale, game engines typically offer only relaxed consistency without well-defined guarantees. In this paper, we leverage the concept of transactions to define consistency models that are suitable for gaming environments. We d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Balancing the Communication Load of State Transfer in Replicated Systems

    Publication Year: 2011, Page(s):41 - 50
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (4570 KB) | HTML iconHTML

    State transfer mechanisms are an essential building block in the design of many distribution applications that replicate the state, such as partially replicated databases or view-synchronous group communication. When a reconfiguration occurs, a need arises to ship a subset of objects that constitute the application state to a subset of nodes in the system. The most commonly employed solution is to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated Discovery of Credit Card Data Flow for PCI DSS Compliance

    Publication Year: 2011, Page(s):51 - 58
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (325 KB) | HTML iconHTML

    Credit cards are key instruments in personal financial transactions. Credit card payment systems used in these transactions and operated by merchants are often targeted by hackers to steal the card data. To address this threat, the payment card industry establishes a mandatory security compliance standard for businesses that process credit cards. A central pre-requisite for this compliance procedu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • OSARE: Opportunistic Speculation in Actively REplicated Transactional Systems

    Publication Year: 2011, Page(s):59 - 64
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (327 KB) | HTML iconHTML

    In this work we present OSARE, an active replication protocol for transactional systems that combines the usage of Optimistic Atomic Broadcast with a speculative concurrency control mechanism in order to overlap transaction processing and replica synchronization. OSARE biases the speculative serialization of transactions towards an order aligned with the optimistic message delivery order. However,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling Medium Utilization for Admission Control in Industrial Wireless Mesh Networks

    Publication Year: 2011, Page(s):65 - 74
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (365 KB) | HTML iconHTML

    Wireless Mesh Networks (WMNs) are a promising technology for industrial environment communication because of their high flexibility and low cost. To fulfill the thereby arising reliability demands, admission control can be used to prevent congestion and to provide end-to-end guarantees to applications. However, this requires a very precise modeling of the medium utilization for existing and reques... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling the Fault Tolerance Consequences of Deduplication

    Publication Year: 2011, Page(s):75 - 84
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (278 KB) | HTML iconHTML

    Modern storage systems are employing data deduplication with increasing frequency. Often the storage systems on which these techniques are deployed contain important data, and utilize fault-tolerant hardware and software to improve the reliability of the system and reduce data loss. We suggest that data deduplication introduces inter-file relationships that may have a negative impact on the fault ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resilience-Driven Parameterisation of Ad Hoc Routing Protocols: olsrd as a Case Study

    Publication Year: 2011, Page(s):85 - 90
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (2832 KB) | HTML iconHTML

    Ad hoc routing protocols are threatened by a variety of accidental and malicious faults that limit their use. Although a number of well-known strategies exist to enhance the performance and resilience of such type of protocols, their final effectiveness strongly relies on the usage of appropriate protocol configuration parameters. This paper investigates how to parameterise ad hoc routing protocol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DONUT: Building Shortcuts in Large-Scale Decentralized Systems with Heterogeneous Peer Distributions

    Publication Year: 2011, Page(s):91 - 100
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (396 KB) | HTML iconHTML

    Large-scale distributed systems gather thousands of peers spread all over the world. Such systems need to offer good routing performances regardless of their size and despite high churn rates. To achieve that requirement, the system must add appropriate shortcuts to its logical graph (overlay). However, to choose efficient shortcuts, peers need to obtain information about the overlay topology. In ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partition-Tolerant Distributed Publish/Subscribe Systems

    Publication Year: 2011, Page(s):101 - 110
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (391 KB) | HTML iconHTML

    In this paper, we develop reliable distributed publish/subscribe algorithms that can tolerate concurrent failure of up to d broker machines or communication links. In our approach, d is a configuration parameter which determines the level of fault-tolerance of the system and reliability refers to exactly-once and per-source, in-order delivery of publications to clients with matching subscriptions.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting Node Connection Regularity for DHT Replication

    Publication Year: 2011, Page(s):111 - 120
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (375 KB) | HTML iconHTML

    Distributed Hash-Tables (DHTs) provide an efficient way to store objects in large-scale peer-to-peer systems. To guarantee that objects are reliably stored, DHTs rely on replication. Several replication strategies have been proposed in the last years. The most efficient ones use predictions about the availability of nodes to reduce the number of object migrations that need to be performed: objects... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Approach Based on Swarm Intelligence for Event Dissemination in Dynamic Networks

    Publication Year: 2011, Page(s):121 - 126
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (252 KB) | HTML iconHTML

    Dynamic networks require adaptive strategies for information dissemination, as the topology constantly changes. This work presents an event-based bio-inspired dissemination approach that employs ants, which correspond to mobile agents, to spread information throughout the network. An event is defined as a state transition of a node or link. A node which detects an event in its neighborhood trigger... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identifying Compromised Users in Shared Computing Infrastructures: A Data-Driven Bayesian Network Approach

    Publication Year: 2011, Page(s):127 - 136
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (432 KB) | HTML iconHTML

    The growing demand for processing and storage capabilities has led to the deployment of high-performance computing infrastructures. Users log into the computing infrastructure remotely, by providing their credentials (e.g., username and password), through the public network and using well-established authentication protocols, e.g., SSH. However, user credentials can be stolen and an attacker (usin... View full abstract»

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