By Topic

Reliable Distributed Systems, 2009. SRDS '09. 28th IEEE International Symposium on

Date 27-30 Sept. 2009

Filter Results

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

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

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

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

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

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

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

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

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

    Publication Year: 2009, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (90 KB)
    Freely Available from IEEE
  • Relaxed Atomic Broadcast: State-Machine Replication Using Bounded Memory

    Publication Year: 2009, Page(s):3 - 11
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (311 KB) | HTML iconHTML

    Atomic broadcast is a useful abstraction for implementing fault-tolerant distributed applications such as state-machine replication. Although a number of algorithms solving atomic broadcast have been published, the problem of bounding the memory used by these algorithms has not been given the attention it deserves. It is indeed impossible to solve repeated atomic broadcast with bounded memory in a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • When and How to Change Quorums on Wide Area Networks

    Publication Year: 2009, Page(s):12 - 21
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (361 KB) | HTML iconHTML

    In wide-area settings, unpredictable events, such as flash crowds caused by nearly instantaneous popularity of services, can cause servers that are expected to respond quickly to instead suddenly respond slowly. This presents a problem for achieving consistently good performance in quorum-based distributed systems, in which clients must choose which quorums (sets of servers) to access. Typically,c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multithreading-Enabled Active Replication for Event Stream Processing Operators

    Publication Year: 2009, Page(s):22 - 31
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB) | HTML iconHTML

    Event stream processing (ESP) systems are very popular in monitoring applications. Algorithmic trading, network monitoring and sensor networks are good examples of applications that rely upon ESP systems. As these systems become larger and more widely deployed, they have to answer increasingly stronger requirements that are often difficult to satisfy. Fault-tolerance is a good example of such a no... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Evaluation of a Metaprotocol for Database Replication Adaptability

    Publication Year: 2009, Page(s):32 - 38
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (295 KB) | HTML iconHTML

    Common solutions to database replication use a single replication protocol. This approach lacks flexibility for changing scenarios or when dealing with heterogeneous client application requirements. Our proposal is a metaprotocol that supports several replication protocols which may follow different replication techniques or provide different isolation levels. With our metaprotocol, replication pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliable and Highly Available Distributed Publish/Subscribe Service

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

    This paper develops reliable distributed publish/subscriber algorithms with service availability in the face of concurrent crash failure of up to delta brokers. The reliability of service in our context refers to per-source in-order and exactly-once delivery of publications to matching subscribers. To handle failures, brokers maintain data structures that enable them to reconnect the topology and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resource-Aware Migratory Services in Wide-Area Shared Computing Environments

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

    In this paper we present the design and evaluation of a system for deploying highly available and migratable services in shared infrastructures, such as the PlanetLab, where the available resource capacities at a node can fluctuate significantly. A migratable service can monitor its operating conditions and autonomously relocate itself to another node when the available resource capacities at the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model-Based Validation for Internet Services

    Publication Year: 2009, Page(s):61 - 70
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB) | HTML iconHTML

    Operator mistakes are a significant source of unavailability in Internet services. In our previous work, we proposed operator action validation as an approach for detecting mistakes while hiding them from the service and its users. Previous validation strategies have limitations, however, including the need for instances of correct behavior for comparison. In this paper, we propose a novel model-b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Effects of Threading, Infection Time, and Multiple-Attacker Collaboration on Malware Propagation

    Publication Year: 2009, Page(s):73 - 82
    Cited by:  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB) | HTML iconHTML

    Self-propagating malware spreads over the network quickly and automatically. Malware propagation should be modeled accurately for fast detection and defense. State-of-the-art malware propagation models fail to consider a number of issues. First, the malware can scan a host for multiple vulnerabilities on multiple ports. Second, the vulnerability scanning can be done by multiple threads concurrentl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Designing System-Level Defenses against Cellphone Malware

    Publication Year: 2009, Page(s):83 - 90
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB) | HTML iconHTML

    Cellphones are increasingly becoming attractive targets of various malware, which not only cause privacy leakage, extra charges, and depletion of battery power, but also introduce malicious traffic into networks. In this work, we seek system-level solutions to handle these security threats. Specifically, we propose a mandatory access control-based defense to blocking malware that launch attacks th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PolyVaccine: Protecting Web Servers against Zero-Day, Polymorphic and Metamorphic Exploits

    Publication Year: 2009, Page(s):91 - 99
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (579 KB) | HTML iconHTML

    Today Web servers are ubiquitous having become critical infrastructures of many organizations. However, they are still one of the most vulnerable parts of organizations infrastructure. Exploits are many times used by worms to fast propagate across the full Internet being Web servers one of their main targets. New exploit techniques have arouse in the last few years that have rendered useless tradi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault Localization for Firewall Policies

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

    Firewalls are the mainstay of enterprise security and the most widely adopted technology for protecting private networks. Ensuring the correctness of firewall policies through testing is important. In firewall policy testing, test inputs are packets and test outputs are decisions. Packets with unexpected (expected) evaluated decisions are classified as failed (passed) tests. Given failed tests tog... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DToken: A Lightweight and Traceable Delegation Architecture for Distributed Systems

    Publication Year: 2009, Page(s):107 - 116
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (810 KB) | HTML iconHTML

    Several major techniques have been proposed to address delegation problems in distributed computing environments of various scales, ranging from LAN, WAN, to the Internet. One of the major characteristics of existing public key cryptography based delegation mechanisms is their use of a fresh key pair every step along the delegation chain. This has led to a range of open issues, including a non-neg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constraint Based Automated Synthesis of Nonmasking and Stabilizing Fault-Tolerance

    Publication Year: 2009, Page(s):119 - 128
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (358 KB) | HTML iconHTML

    We focus on constraint based automated addition of nonmasking and stabilizing fault-tolerance to hierarchical programs. We specify legitimate states of the program in terms of constraints that should be satisfied in those states. To deal with faults that may violate these constraints, we add recovery actions while ensuring interference freedom among the recovery actions added for satisfying differ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communication-Based Prevention of Non-P-Pattern

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

    An issue pertinent to the design of checkpointing protocols is how to improve the autonomy of checkpointing and keep computation loss under control. To address the problem, a time-based multi-cycle checkpointing protocol is proposed in this paper. In this protocol, processes are allowed to take checkpoints with desired checkpoint cycles. To enable recent checkpoints to be used to form a consistent... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spin One's Wheels? Byzantine Fault Tolerance with a Spinning Primary

    Publication Year: 2009, Page(s):135 - 144
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (302 KB) | HTML iconHTML

    Most Byzantine fault-tolerant state machine replication (BFT) algorithms have a primary replica that is in charge of ordering the clients requests. Recently it was shown that this dependence allows a faulty primary to degrade the performance of the system to a small fraction of what the environment allows. In this paper we present Spinning, a novel BFT algorithm that mitigates such performance att... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Self-Stabilizing O(n)-Round k-Clustering Algorithm

    Publication Year: 2009, Page(s):147 - 155
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (319 KB) | HTML iconHTML

    Given an arbitrary network G of processes with unique IDs and no designated leader, and given a k-dominating set I C G, we propose a silent self-stabilizing distributed algorithm that computes a subset D of I which is a minimal k-dominating set of G. Using D as the set of cluster-heads, a partition of G into clusters, each of radius k, follows. The algorithm is comparison-based, requires O(log n) ... View full abstract»

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