International Conference on Dependable Systems and Networks, 2004

28 June-1 July 2004

Filter Results

Displaying Results 1 - 25 of 114
  • 2004 International Conference on Dependable Systems and Networks

    Publication Year: 2004
    Request permission for reuse | PDF file iconPDF (913 KB)
    Freely Available from IEEE
  • DSN 2004 [breaker page]

    Publication Year: 2004, Page(s): 0_2
    Request permission for reuse | PDF file iconPDF (159 KB)
    Freely Available from IEEE
  • [Blank page]

    Publication Year: 2004, Page(s): i
    Request permission for reuse | PDF file iconPDF (154 KB)
    Freely Available from IEEE
  • 2004 International Conference on Dependable Systems and Networks

    Publication Year: 2004, Page(s): ii
    Request permission for reuse | PDF file iconPDF (192 KB)
    Freely Available from IEEE
  • Copyright 2004 by The Institute of Electrical and Electronics Engineers, Inc.

    Publication Year: 2004, Page(s): iii
    Request permission for reuse | PDF file iconPDF (194 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2004, Page(s):v - xiii
    Request permission for reuse | PDF file iconPDF (230 KB)
    Freely Available from IEEE
  • Welcome message from the general chair, vice-general chair and conference coordinator

    Publication Year: 2004, Page(s): xiv
    Request permission for reuse | PDF file iconPDF (217 KB)
    Freely Available from IEEE
  • Conference organizers

    Publication Year: 2004, Page(s):xv - xvii
    Request permission for reuse | PDF file iconPDF (187 KB)
    Freely Available from IEEE
  • Message from the Dependable Computing and Communications Symposium (DCCS) Program Chair

    Publication Year: 2004, Page(s): xviii
    Request permission for reuse | PDF file iconPDF (202 KB)
    Freely Available from IEEE
  • DCCS program committee

    Publication Year: 2004, Page(s): xix
    Request permission for reuse | PDF file iconPDF (179 KB)
    Freely Available from IEEE
  • DCCS reviewers

    Publication Year: 2004, Page(s):xx - xxiv
    Request permission for reuse | PDF file iconPDF (190 KB)
    Freely Available from IEEE
  • W.C. Carter Award

    Publication Year: 2004, Page(s): xxv
    Request permission for reuse | PDF file iconPDF (189 KB)
    Freely Available from IEEE
  • Message from the performance and dependability symposium (PDS) program co-chairs

    Publication Year: 2004, Page(s): xxvi
    Request permission for reuse | PDF file iconPDF (195 KB)
    Freely Available from IEEE
  • PDS program and steering committees

    Publication Year: 2004, Page(s):xxvii - xxviii
    Request permission for reuse | PDF file iconPDF (181 KB)
    Freely Available from IEEE
  • PDS reviewers

    Publication Year: 2004, Page(s): xxix
    Request permission for reuse | PDF file iconPDF (172 KB)
    Freely Available from IEEE
  • Keynote: Recent discoveries from Paxos

    Publication Year: 2004, Page(s): xxx
    Request permission for reuse | PDF file iconPDF (211 KB)
    Freely Available from IEEE
  • Keynote: recent discoveries from Paxos

    Publication Year: 2004, Page(s): 1
    Cited by:  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (211 KB)

    Summary form only given. The rapid decrease in the cost of computing and networks has made fault tolerance much cheaper. The gradual increase in the IQ of system designers is leading to a switch from programming hacks to provably fault-tolerant algorithms. These developments have motivated the resumption of archaeological research on Paxos. Some lower-bound theorems have recently been dug up, alon... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance and dependability of structured peer-to-peer overlays

    Publication Year: 2004, Page(s):9 - 18
    Cited by:  Papers (60)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (541 KB) | HTML iconHTML

    Structured peer-to-peer (P2P) overlay networks provide a useful substrate for building distributed applications. They map object keys to overlay nodes and offer a primitive to send a message to the node responsible for a key. They can implement, for example, distributed hash tables and multicast trees. However, there are concerns about the performance and dependability of these overlays in realist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust aggregation protocols for large-scale overlay networks

    Publication Year: 2004, Page(s):19 - 28
    Cited by:  Papers (19)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (945 KB) | HTML iconHTML

    Aggregation refers to a set of functions that provide global information about a distributed system. These junctions operate on numeric values distributed over the system and can be used to count network size, determine extremal values and compute averages, products or sums. Aggregation allows important basic functionality to be achieved in fully distributed and peer-to-peer networks. For example,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Impact of path diversity on multi-homed and overlay networks

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

    Multi-homed and overlay networks are two widely studied approaches aimed at leveraging the inherent redundancy of the Internet's underlying routing infrastructure to enhance end-to-end application performance and availability. However, the effectiveness of these approaches depends on the natural diversity of redundant paths between two endhosts in terms of physical links, routing infrastructure, a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault detection and isolation techniques for quasi delay-insensitive circuits

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

    This paper presents a circuit fault detection and isolation technique for quasi delay-insensitive asynchronous circuits. We achieve fault isolation by a combination of physical layout and circuit techniques. The asynchronous nature of quasi delay-insensitive circuits combined with layout techniques makes the design tolerant to delay faults. Circuit techniques are used to make sections of the desig... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tolerating hard faults in microprocessor array structures

    Publication Year: 2004, Page(s):51 - 60
    Cited by:  Papers (48)  |  Patents (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (315 KB) | HTML iconHTML

    In this paper, we present a hardware technique, called self-repairing array structures (SRAS), for masking hard faults in microprocessor array structures, such as the reorder buffer and branch history table. SRAS masks errors that could otherwise lead to slow system recoveries. To detect row errors, every write to a row is mirrored to a dedicated "check row". We then read out both the written row ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characterizing the effects of transient faults on a high-performance processor pipeline

    Publication Year: 2004, Page(s):61 - 70
    Cited by:  Papers (196)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (7079 KB) | HTML iconHTML

    The progression of implementation technologies into the sub-100 nanometer lithographies renew the importance of understanding and protecting against single-event upsets in digital systems. In this work, the effects of transient faults on high performance microprocessors is explored. To perform a thorough exploration, a highly detailed register transfer level model of a deeply pipelined, out-of-ord... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic quarantine of Internet worms

    Publication Year: 2004, Page(s):73 - 82
    Cited by:  Papers (26)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (460 KB) | HTML iconHTML

    If we limit the contact rate of worm traffic, can we alleviate and ultimately contain Internet worms? This paper sets out to answer this question. Specifically, we are interested in analyzing different deployment strategies of rate control mechanisms and the effect thereof on suppressing the spread of worm code. We use both analytical models and simulation experiments. We find that rate control at... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • HOURS: achieving DoS resilience in an open service hierarchy

    Publication Year: 2004, Page(s):83 - 92
    Cited by:  Papers (8)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (389 KB) | HTML iconHTML

    Hierarchical systems have been widely used to provide scalable distributed services in the Internet. Unfortunately, such a service hierarchy is vulnerable to DoS attacks. This paper presents HOURS that achieves DoS resilience in an open service hierarchy. HOURS ensures high degree of service accessibility for each surviving node by: 1) augmenting the service hierarchy with hierarchical overlay net... View full abstract»

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