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 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.
  • Collaborative networking in an uncooperative Internet

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

    Collaborative applications often require peer-to-peer interaction and peer discovery mechanisms. In today's Internet, Firewall and NAT technology, and a lack of support of IP multicast, have made it very difficult to support such applications. Application Level Gateways and Directory Services can solve these problems to some extent, but have scalability problems and should be used as a last resort... 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.
  • Fault-tolerant virtual private networks within an autonomous system

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

    This paper proposes the concept of a fault-tolerant virtual private network (FVPN) within an autonomous system-a framework for supporting seamless network fail-over by leveraging the inherent redundancy of the underlying Internet infrastructure. The proposed architecture includes an application-level module, which is integrated into gateways at VPN end-points. This module enables fail-over to a re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • OBIGrid: towards a new distributed platform for bioinformatics

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

    This paper describes the design philosophy for the grid system being developed by the Japan Committee on High-Performance Computing for Bioinformatics and Initiative for Parallel Bioinformatics (IPAB). The grid is an attractive solution to achieve a distributed bioinformatics environment with high performance parallel computers, large genomic databases, computation intensive applications such as h... 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.
  • Implementing quality of service in Web servers

    Publication Year: 2002, Page(s):32 - 40
    Cited by:  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (597 KB) | HTML iconHTML

    This paper analyzes the importance of differentiated service implementation in current Web servers, within the context of new Internet applications. An innovative approach of resource management is presented, which is carried out using the proportional cumulative value attribution (PCV) heuristic. This heuristic acts through two policies which, in response to requests, simultaneously sort the requ... 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.
  • The guardian model for exception handling in distributed systems

    Publication Year: 2002, Page(s):304 - 313
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (643 KB) | HTML iconHTML

    We present an abstraction called guardian for exception handling in distributed systems. The guardian can solve several limitations with existing distributed exception handling techniques. To understand these limitations, we analyze distributed exception handling with respect to sequential exception handling and identify the significant differences between them. This leads to the fundamental probl... 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.
  • A search for routing strategies in a peer-to-peer network using genetic programming

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

    Results taken from a simulated peer-to-peer network are described, in which genetic programming is utilized to evolve routing strategies that optimize resource location in various traffic flow scenarios. In all cases the evolved strategies result in more numerous resource locations than a pure, non-adaptive peer-to-peer protocol such as the Gnutella protocol. The resulting evolved strategies are d... View full abstract»

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

    Publication Year: 2002, Page(s):22 - 29
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (563 KB) | HTML iconHTML

    An ideal approach to deal with faults in large-scale distributed systems is to contain the effects of faults as locally as possible and, additionally, to ensure some type of tolerance within each fault-affected locality. Existing results using this approach accommodate only limited faults (such as crashes) or assume that fault occurrence is bounded in space and/or time. In this paper, we define an... 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.
  • Implementation of threshold-based diagnostic mechanisms for COTS-based applications

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

    This work investigates feasibility issues that must be addressed when threshold-based mechanisms are to be used for diagnostic purposes in COTS-based distributed systems. Threshold based mechanisms have typically been used for such purposes in embedded systems. A variety of solutions exist, with different characteristics of completeness, accuracy, and induced overhead. We first discuss the challen... 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.
  • Improving object search using hints, gossip, and supernodes

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

    Gnutella is a highly popular protocol for locating objects. It uses a non-scalable approach which results in either high loads or small yields. In this paper we present PALOCATE, an evolving protocol focusing on efficiency without sacrificing quality of recall. We present simulation studies showing the effectiveness of hint-based caching, gossip (epidemics), and incorporating supernodes into the b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Management of mobile agent systems using social insect metaphors

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

    The management of mobile agent systems that solve problems in a network is an issue that must be addressed if mobile agents are to be deployed industrially. It is clear that insufficient or excessive numbers of agents can cause the problem solving capabilities of an agent-based system to be impaired. Also, agents being software entities are almost always flawed therefore requiring the upgrade prob... 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.
  • Introspective failure analysis: avoiding correlated failures in peer-to-peer systems

    Publication Year: 2002, Page(s):362 - 367
    Cited by:  Papers (11)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (443 KB) | HTML iconHTML

    Failure independence is an important assumption for many fault tolerance techniques. Unfortunately, real systems exhibit correlated failures. In this paper, we present a framework for online discovery of groups of server nodes that are maximally independent in their failure characteristics. We discuss the framework in detail and provide a preliminary evaluation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of inspection-based preventive maintenance in operational software systems

    Publication Year: 2002, Page(s):286 - 295
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (586 KB) | HTML iconHTML

    Recently, the phenomenon of "software aging", one in which the state of a software system gradually degrades with time and eventually leads to performance degradation or crash/hang failure, has been reported. Preventive maintenance of operational software systems is used specifically to counteract this phenomenon. However preventive maintenance incurs an overhead in terms of downtime and cost and ... 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 (12)  |  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.
  • 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.
  • A unified proof of minimum time complexity for reaching consensus and uniform consensus - an oracle-based approach

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

    In this paper, we offer new proofs to two lower bound results in distributed computing: a minimum of f+1 and f+2 rounds for reaching consensus and uniform consensus respectively when at most f fail-stop faults can happen. Here the computation model is synchronous message passing. Both proofs are based on a novel oracle argument. These two induction proofs are unified in the following sense: the in... View full abstract»

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