Sciweavers

46 search results - page 6 / 10
» Dynamic Byzantine Quorum Systems
Sort
View
EUROSYS
2011
ACM
12 years 11 months ago
DepSky: dependable and secure storage in a cloud-of-clouds
The increasing popularity of cloud storage services has lead companies that handle critical data to think about using these services for their storage needs. Medical record databa...
Alysson Neves Bessani, Miguel P. Correia, Bruno Qu...
MOBIHOC
2003
ACM
14 years 1 months ago
PAN: providing reliable storage in mobile ad hoc networks with probabilistic quorum systems
Reliable storage of data with concurrent read/write accesses (or query/update) is an ever recurring issue in distributed settings. In mobile ad hoc networks, the problem becomes e...
Jun Luo, Jean-Pierre Hubaux, Patrick Th. Eugster
ISPAN
2005
IEEE
14 years 1 months ago
P2P Architecture for Self-Atomic Memory
We propose an architecture for self-adjusting and self-healing atomic memory in highly dynamic systems exploiting peer-to-peer (p2p) techniques. Our approach, named SAM, brings to...
Emmanuelle Anceaume, Maria Gradinariu, Vincent Gra...
ATAL
2005
Springer
14 years 1 months ago
Fault tolerance for internet agent systems: in cases of stop failure and byzantine failure
In this demo, we present our two fault-tolerant systems to overcome stop failure and Byzantine failure, respectively, for agent execution platforms such as JADE and Aglets. For bo...
Tadashi Araragi
ISPDC
2006
IEEE
14 years 1 months ago
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
Ivan Frain, Abdelaziz Mzoughi, Jean Paul Bahsoun