1810 search results - page 38 / 362 » BASE: Using Abstraction to Improve Fault Tolerance |
101
click to vote
ICDCS
1995
IEEE
15 years 1 months ago
1995
IEEE
One of the mostsoughtaftersoftware innovation of thisdecade is the construction of systems using off-the-shelf workstations that actually deliver, and even surpass, the power and ...
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
For hypercube networks which have faulty nodes, a few ecient dynamic routing algorithms have been proposed by allowing each node to hold the status of neighbors. We propose two im...
HOTDEP
2008
15 years 19 hour ago
2008
Database systems are a key component behind many of today's computer systems. As a consequence, it is crucial that database systems provide correct and continuous service des...
108
click to vote
NETWORKING
2004
14 years 11 months ago
2004
We present an efficient authenticated and fault-tolerant protocol (AFTD) for tree-based key agreement. Our approach is driven by the insight that when a Diffie-Hellman blinded key ...
NETWORKS
2010
14 years 8 months ago
2010
Maˇnuch and Stacho [7] introduced the problem of designing f-tolerant routings in optical networks, i.e., routings which still satisfy the given requests even if f failures occur...