Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
341
Secure routing for structured peer-to-peer overlay networks
, 2002
"... Structured peer-to-peer overlay networks provide a sub-strate for the construction of large-scale, decentralized applications, including distributed storage, group com-munication, and content distribution. These overlays are highly resilient; they can route messages correctly even when a large fract ..."
Abstract
-
Cited by 473 (12 self)
- Add to MetaCart
fraction of the nodes crash or the network partitions. But current overlays are not secure; even a small fraction of malicious nodes can prevent correct message delivery throughout the overlay. This prob-lem is particularly serious in open peer-to-peer systems, where many diverse, autonomous parties
SpeedLog -- The key architectural element to support efficient recovery from node crashes
"... Logging is an indispensable mechanism to provide fault tolerance in computer based systems. Our approach on logging focuses on providing a general-purpose logging tool to support various kinds of applications and system level services. Flexible logging mechanisms usually decreases the performance in ..."
Abstract
- Add to MetaCart
efficiently. The main idea behind is to support fast recovery after a node crash by minimizing the amount of log information to be retrieved during restart. To achieve this, we periodically discard obsolete log information in a very effective manner without consulting the log user.
A Generic Log-Service - The key architectural element to support efficient recovery from node crashes
"... this paper we will use this case to illustrate our logging model. However, the general treatment of this aspect is beyond the scope of this paper. Managing a log should also allow the determination of obsolete information at any time during ongoing computations. One of the main achievements of our ..."
Abstract
- Add to MetaCart
approach presented in this paper is that this can be done efficiently by the log management itself. In general, considering performance issues the log represents a key part of the system during normal processing as well as during restart after node crash. During normal processing every update of a
Fast Crash Recovery in RAMCloud
- In Proc. of SOSP’11
, 2011
"... RAMCloud is a DRAM-based storage system that provides inexpensive durability and availability by recovering quickly after crashes, rather than storing replicas in DRAM. RAMCloud scatters backup data across hundreds or thousands of disks, and it harnesses hundreds of servers in parallel to reconstruc ..."
Abstract
-
Cited by 83 (3 self)
- Add to MetaCart
RAMCloud is a DRAM-based storage system that provides inexpensive durability and availability by recovering quickly after crashes, rather than storing replicas in DRAM. RAMCloud scatters backup data across hundreds or thousands of disks, and it harnesses hundreds of servers in parallel
FOBr: A Version-Based Recovery Protocol For Replicated Databases
"... Within the field of databases that are deployed in distributed environments there is a need to guarantee consistency among replicas and availability among nodes despite of network disconnections and node crashes. ..."
Abstract
- Add to MetaCart
Within the field of databases that are deployed in distributed environments there is a need to guarantee consistency among replicas and availability among nodes despite of network disconnections and node crashes.
Resilience of the internet to random breakdowns
- Physical Review Letters
, 2000
"... A common property of many large networks, including the Internet, is that the connectivity of the various nodes follows a scale-free power-law distribution, P(k) = ck −α. We study the stability of such networks with respect to crashes. Our approach, based on percolation theory, leads to a general c ..."
Abstract
-
Cited by 180 (10 self)
- Add to MetaCart
A common property of many large networks, including the Internet, is that the connectivity of the various nodes follows a scale-free power-law distribution, P(k) = ck −α. We study the stability of such networks with respect to crashes. Our approach, based on percolation theory, leads to a general
The Fault Span of Crash Failures
- Journal of the ACM
, 2000
"... A crashing network protocol is an asynchronous protocol whose memory does not survive crashes. We show that a crashing network protocol that works over unreliable links can be driven to arbitrary global states, where each node is in a state reached in some (possibly different) execution, and each li ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
A crashing network protocol is an asynchronous protocol whose memory does not survive crashes. We show that a crashing network protocol that works over unreliable links can be driven to arbitrary global states, where each node is in a state reached in some (possibly different) execution, and each
Crash Faults Identification in Wireless Sensor Networks
- Computer Communications
, 2002
"... In this paper we consider the problem of identifying faulty (crashed) nodes in a wireless sensor network. ..."
Abstract
-
Cited by 36 (0 self)
- Add to MetaCart
In this paper we consider the problem of identifying faulty (crashed) nodes in a wireless sensor network.
Results 1 - 10
of
341
