35 search results - page 4 / 7 » Small Byzantine Quorum Systems |
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
In order to enable communication between a dynamic collection of peers with given ID’s, such as “machine.cs.school.edu”, over the Internet, a distributed name service must b...
SOSP
2005
ACM
14 years 4 months ago
2005
ACM
A fault-scalable service can be configured to tolerate increasing numbers of faults without significant decreases in performance. The Query/Update (Q/U) protocol is a new tool t...
ADHOC
2007
13 years 8 months ago
2007
Ensuring the consistency and the availability of replicated data in highly mobile ad hoc networks is a challenging task because of the lack of a backbone infrastructure. Previous ...
JSAC
2010
13 years 6 months ago
2010
Abstract—Random linear network coding can be used in peerto-peer networks to increase the efficiency of content distribution and distributed storage. However, these systems are ...
PODC
2012
ACM
11 years 10 months ago
2012
ACM
In recent years, there have been a few proposals to add a small amount of trusted hardware at each replica in a Byzantine fault tolerant system to cut back replication factors. Th...