Sciweavers

27 search results - page 4 / 6
» Optimal Resilience for Erasure-Coded Byzantine Distributed S...
Sort
View
SASO
2007
IEEE
15 years 3 months ago
e-SAFE: An Extensible, Secure and Fault Tolerant Storage System
With the rapidly falling price of hardware, and increasingly available bandwidth, the storage technology is seeing a paradigm shift from centralized and managed mode to distribute...
Sandip Agarwala, Arnab Paul, Umakishore Ramachandr...
ICDCS
2006
IEEE
15 years 3 months ago
PRINS: Optimizing Performance of Reliable Internet Storages
Distributed storage systems employ replicas or erasure code to ensure high reliability and availability of data. Such replicas create great amount of network traffic that negative...
Qing Yang, Weijun Xiao, Jin Ren
GLOBECOM
2010
IEEE
14 years 7 months ago
Peer-to-Peer Storage Systems: A Practical Guideline to be Lazy
Distributed and peer-to-peer storage systems are foreseen as an alternative to the traditional data centers and in-house backup solutions. In the past few years many peerto-peer st...
Frédéric Giroire, Julian Monteiro, S...
ICDCN
2009
Springer
15 years 4 months ago
Byzantine-Resilient Convergence in Oblivious Robot Networks
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
Zohir Bouzid, Maria Gradinariu Potop-Butucaru, S&e...
95
Voted
WDAG
2010
Springer
230views Algorithms» more  WDAG 2010»
14 years 7 months ago
Implementing Fault-Tolerant Services Using State Machines: Beyond Replication
Abstract—This paper describes a method to implement faulttolerant services in distributed systems based on the idea of fused state machines. The theory of fused state machines us...
Vijay K. Garg