By Topic

21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings.

13-16 Oct. 2002

Filter Results

Displaying Results 1 - 25 of 54
  • Proceedings 21st IEEE Symposium on Reliable Distributed Systems

    Publication Year: 2002
    Request permission for commercial reuse | PDF file iconPDF (176 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 2002, Page(s):423 - 424
    Request permission for commercial reuse | PDF file iconPDF (58 KB)
    Freely Available from IEEE
  • A lower bound on dynamic k-stabilization in asynchronous systems

    Publication Year: 2002, Page(s):212 - 221
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (527 KB) | HTML iconHTML

    It is desirable that the smaller the number of faults hitting a network, the faster a network protocol recovers. We study the scenario where up to k (for a given k) faults hit processors of a synchronous distributed system by corrupting their state undetectably. In this context, we show that the well known step complexity model is not appropriate to study time complexity of time-adaptive protocols... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-intrusive, parallel recovery of replicated data

    Publication Year: 2002, Page(s):150 - 159
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (629 KB) | HTML iconHTML

    The increasingly widespread use of cluster architectures has resulted in many new application scenarios for data replication. While data replication is, in principle, a well understood problem. recovery of replicated systems has not yet received enough attention. In the case of clusters, recovery procedures are particularly important since they have to keep a high level of availability even during... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-stabilizing local mutual exclusion on networks in which process identifiers are not distinct

    Publication Year: 2002, Page(s):202 - 211
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (625 KB) | HTML iconHTML

    A self-stabilizing system is a system such that it autonomously converges to a legitimate system state, regardless of the initial system state. The local mutual exclusion problem is the problem of guaranteeing that no two processes neighboring each other execute their critical sections at a time. The process identifiers are said to be chromatic if no two processes neighboring each other have the s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heterogeneous checkpointing for multithreaded applications

    Publication Year: 2002, Page(s):140 - 149
    Cited by:  Papers (4)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (649 KB) | HTML iconHTML

    We present the first heterogeneous checkpointing scheme for applications using POSIX threads. The scheme relies on source code instrumentation to achieve heterogeneity. It supports various types of synchronization primitives, such as locks, semaphores, condition variables, and join operations. Unlike other non-heterogeneous checkpointing schemes proposed in the literature, our scheme supports both... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimistic total order in wide area networks

    Publication Year: 2002, Page(s):190 - 199
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (715 KB) | HTML iconHTML

    Total order multicast greatly simplifies the implementation of fault-tolerant services using the replicated state machine approach. The additional latency of total ordering can be masked by taking advantage of spontaneous ordering observed in LANs: A tentative delivery allows the application to proceed in parallel with the ordering protocol. The effectiveness of the technique rests on the optimist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A self-stabilizing algorithm for the Steiner tree problem

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

    Self-stabilization is a theoretical framework of non-masking fault-tolerant distributed algorithms. In this paper, we investigate the Steiner tree problem in distributed systems, and propose a self-stabilizing solution to the problem. Our solution is based on the pruned-MST technique, a heuristic technique to find a minimal cost Steiner tree by pruning unnecessary nodes and edges in a minimum cost... View full abstract»

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

    Publication Year: 2002, Page(s):262 - 267
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (479 KB) | HTML iconHTML

    The paper considers the Byzantine agreement problem in a fully asynchronous network, where some participants may be actively malicious. This is an important building block for fault-tolerant applications in a hostile environment, and a non-trivial problem: An early result by Fischer et al. (1985) shows that there is no deterministic solution in a fully asynchronous network subject to even a single... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Availability models with age-dependent checkpointing

    Publication Year: 2002, Page(s):130 - 139
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (583 KB) | HTML iconHTML

    In this paper, we consider a new stochastic model for file recovery action with checkpointing when a system failure occurs according to a homogeneous Poisson process. The present checkpoint model strongly depends on the system age and is quite different from the models by Gelenbe (1979) and Goes and Sumita (1995). We propose three kinds of approximation schemes to determine the optimal checkpoint ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient epidemic-style protocols for reliable and scalable multicast

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

    Epidemic-style (gossip-based) techniques have recently emerged as a scalable class of protocols for peer-to-peer reliable multicast dissemination in large process groups. These protocols provide probabilistic guarantees on reliability and scalability. However, popular implementations of epidemic-style dissemination are reputed to suffer from two major drawbacks: (a) (Network Overhead) when deploye... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fault-tolerant approach to secure information retrieval

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

    Several private information retrieval (PIR) schemes were proposed to protect users' privacy when sensitive information stored in database servers is retrieved. However, existing PIR schemes assume that any attack to the servers does not change the information stored and any computational results. We present a novel fault-tolerant PIR scheme (called FT-PIR) that protects users' privacy and at the s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A self-stabilizing algorithm for finding cliques in distributed systems

    Publication Year: 2002, Page(s):390 - 395
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB) | HTML iconHTML

    Self-stabilization is a theoretical framework of non-masking fault-tolerant algorithms in distributed systems. In this paper, we consider a problem to find fully connected subgraphs (cliques) in a network. In our problem setting, each process P in a network G is given a set of its neighbor processes as input, and must find a set of neighbors that are fully connected together with P. As constraints... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The performance of checkpointing and replication schemes for fault tolerant mobile agent systems

    Publication Year: 2002, Page(s):256 - 261
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (405 KB) | HTML iconHTML

    We evaluate the performance of checkpointing and replication schemes for the fault tolerant mobile agent system. For the quantitative comparison, we have implemented an experimental system on top of the Mole mobile agent system and also built a simulation system to include various failure cases. Our experiment aims to have the insight into the behavior of agents under two schemes and provide a gui... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • From Byzantine agreement to practical survivability: a position paper

    Publication Year: 2002, Page(s):374 - 379
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB) | HTML iconHTML

    Only a decade ago, issues of replication, high availability and load balancing were the focus of small, closely coupled cluster projects. Consequently, techniques for cluster management and small replication systems are abundant. However, the advent of the Internet led to wide spread and highly decentralized access of services and content that bring issues of scale and ubiquitous deployment. In pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient distributed precision control in symmetric replication environments

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

    Maintaining strict consistency of replicated data can be prohibitively expensive for many distributed applications and environments. In order to alleviate this problem, some systems allow applications to access stale, imprecise data. Due to relaxed correctness requirements, many applications can tolerate stale data but require that the imprecision be properly bounded. This paper describes ReBound,... View full abstract»

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

    Publication Year: 2002, Page(s):170 - 179
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (590 KB) | HTML iconHTML

    Reliable distributed protocols, such as consensus and atomic broadcast, are known to scale poorly with large number of processes. Recent research has shown that algorithms providing probabilistic guarantees are a promising alternative for such environments. In this paper, we propose a specification of atomic broadcast with probabilistic liveness and safety guarantees. We present an algorithm that ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Byzantine-resilient reliable multicast on a hybrid failure model

    Publication Year: 2002, Page(s):2 - 11
    Cited by:  Papers (15)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (722 KB) | HTML iconHTML

    The paper presents a new reliable multicast protocol that tolerates arbitrary faults, including Byzantine faults. This protocol is developed using a novel way of designing secure protocols which is based on a well-founded hybrid failure model. Despite our claim of arbitrary failure resilience, the protocol need not necessarily incur the cost of "Byzantine agreement", in number of participants and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-stabilizing distributed file systems

    Publication Year: 2002, Page(s):384 - 389
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB) | HTML iconHTML

    A self-stabilizing distributed file system is presented. The system constructs and maintains a spanning tree for each file volume. The spanning tree consists of the servers that have volume replicas and caches for the specific file volume. The spanning trees are constructed and maintained by self-stabilizing distributed algorithms. File system updates use the tree to implement file read and write ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing IPv6 as a peer-to-peer overlay network

    Publication Year: 2002, Page(s):347 - 351
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (361 KB) | HTML iconHTML

    This paper proposes to implement an IPv6 routing infrastructure as a self-organizing overlay network on top of the current IPv4 infrastructure. The overlay network builds upon a distributed IPv6 edge router with a master/slave architecture. We show how different slaves can be constructed to tunnel through NATs and firewalls, as well as to improve robustness of the routing infrastructure and to pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Loose synchronization of multithreaded replicas

    Publication Year: 2002, Page(s):250 - 255
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (525 KB) | HTML iconHTML

    Although multithreading can improve performance, it is a source of nondeterminism in application behavior. Existing approaches to replicating multithreaded applications either synchronize replicas at the interrupt level, at the expense of performance, or use a nonpreemptive deterministic scheduler at the expense of concurrency. This paper presents a loose synchronization algorithm for ensuring det... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • International workshop on self-repairing and self-configurable distributed systems

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

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reperasure: replication protocol using erasure-code in peer-to-peer storage network

    Publication Year: 2002, Page(s):330 - 335
    Cited by:  Papers (20)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB) | HTML iconHTML

    Peer-to-peer overlay networks offer a convenient way to host an infrastructure that can scale to the size of the Internet and yet stay manageable. These overlays are essentially self-organizing distributed hash tables (DHT). The dynamic nature of the system, however, poses serious challenges of data reliability. Furthermore, in order to see wider adoption, it is time to design support for generic ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Active software replication through a three-tier approach

    Publication Year: 2002, Page(s):109 - 118
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (695 KB) | HTML iconHTML

    A replication logic is the set of protocols and mechanisms implementing a software replication technique. A three-tier approach to replication consists in separating the replication logic from both clients and replicated servers by embedding such logic in a middle-tier In this paper we first introduce the fundamental concepts underlying three-tier replication. This approach has two main practical ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asynchronous resource discovery in peer to peer networks

    Publication Year: 2002, Page(s):224 - 231
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB) | HTML iconHTML

    The resource discovery problem arises in the context of peer to peer (P2P) networks, where at any point of time a peer may be placed at or removed from any location over a general purpose network (e.g., an Internet site). A vertex (peer) can communicate with another vertex directly if and only if it knows a certain routing information to that other vertex. Hence, it is critical for peers to convey... View full abstract»

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