Filters








125 Hits in 4.1 sec

SHARING MEMORY WITH SEMI-BYZANTINE CLIENTS AND FAULTY STORAGE SERVERS

HAGIT ATTIYA, AMIR BAR-OR
2006 Parallel Processing Letters  
Combining with our construction for semi-Byzantine clients, we get a simulation of SWMR regular register with semi-Byzantine clients and Byzantine storage servers.  ...  This immediately implies a simulation of SWMR regular register with semi-Byzantine clients and fail-stop storage servers, assuming that at least a majority of the storage servers do not fail.  ...  By applying our simulations to the shared-memory Paxos algorithm, we derive new Paxos algorithms that tolerate semi-Byzantine clients and fail-stop or Byzantine storage servers.  ... 
doi:10.1142/s0129626406002745 fatcat:gbo3gspervc5rgwmclzwqy4xu4

Sharing memory with semi-Byzantine clients and faulty storage servers

H. Attiya, A. Bar-Or
22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings.  
Combining with our construction for semi-Byzantine clients, we get a simulation of SWMR regular register with semi-Byzantine clients and Byzantine storage servers.  ...  This immediately implies a simulation of SWMR regular register with semi-Byzantine clients and fail-stop storage servers, assuming that at least a majority of the storage servers do not fail.  ...  By applying our simulations to the shared-memory Paxos algorithm, we derive new Paxos algorithms that tolerate semi-Byzantine clients and fail-stop or Byzantine storage servers.  ... 
doi:10.1109/reldis.2003.1238090 dblp:conf/srds/AttiyaB03 fatcat:mlkysmm75zft7dwxbq6hrvewkq

Fault Tolerance and Resilience in Cloud Computing Environments [chapter]

Ravi Jhawar, Vincenzo Piuri
2017 Computer and Information Security Handbook  
The increasing demand for flexibility and scalability in dynamically obtaining and releasing computing resources in a cost-effective and device-independent manner, and easiness in hosting applications  ...  Fault tolerance and resilience serve as an effective means to address user's reliability and availability concerns.  ...  This enforcement requirement demands the server replicas to reach an agreement on the ordering of a given set of requests even in the presence of byzantine faulty servers and clients.  ... 
doi:10.1016/b978-0-12-803843-7.00009-0 fatcat:42ea433b6jc3bixlesngbksnea

Fault Tolerance and Resilience in Cloud Computing Environments [chapter]

Ravi Jhawar, Vincenzo Piuri
2013 Computer and Information Security Handbook  
The increasing demand for flexibility and scalability in dynamically obtaining and releasing computing resources in a cost-effective and device-independent manner, and easiness in hosting applications  ...  Fault tolerance and resilience serve as an effective means to address user's reliability and availability concerns.  ...  This enforcement requirement demands the server replicas to reach an agreement on the ordering of a given set of requests even in the presence of byzantine faulty servers and clients.  ... 
doi:10.1016/b978-0-12-394397-2.00007-6 fatcat:vz2fa7vizff3pieob53hmi6n4e

Fault Tolerance and Resilience in Cloud Computing Environments [chapter]

Ravi Jhawar, Vincenzo Piuri
2014 Cyber Security and IT Infrastructure Protection  
The increasing demand for flexibility and scalability in dynamically obtaining and releasing computing resources in a cost-effective and device-independent manner, and easiness in hosting applications  ...  Fault tolerance and resilience serve as an effective means to address user's reliability and availability concerns.  ...  This enforcement requirement demands the server replicas to reach an agreement on the ordering of a given set of requests even in the presence of byzantine faulty servers and clients.  ... 
doi:10.1016/b978-0-12-416681-3.00001-x fatcat:u3kfhz6rabgg5flhpi3cr2inxq

Specification Of Security Enablers For Data Management

Marko Vukolic
2016 Zenodo  
These techniques can be optionally combined with dependability and security components pertaining to fault-tolerant state-machine replication and distributed storage described in the first two parts.  ...  The second part covers SUPERCLOUD distributed storage solutions which we use to manage bulk data.  ...  This kind of solution considers a set of clients interacting with a set of passive servers with a constrained interface, modeled as shared memory objects (called base objects).  ... 
doi:10.5281/zenodo.263831 fatcat:ksk4ze2tuncfbexjzsorjnoabe

BASE

Miguel Castro, Rodrigo Rodrigues, Barbara Liskov
2003 ACM Transactions on Computer Systems  
This paper describes a replication technique, BASE, which uses abstraction to reduce the cost of Byzantine fault tolerance and to improve its ability to mask software errors.  ...  Byzantine fault tolerance allows replicated systems to mask some software errors but it is expensive to deploy.  ...  ACKNOWLEDGMENTS We would like to thank Chandrasekhar Boyapati, João Garcia, Ant Rowstron, and Larry Peterson for their helpful comments on drafts of this paper.  ... 
doi:10.1145/859716.859718 fatcat:kkukkuv33ravdg4s7tn44ymjjq

Building Dependable and Secure Web Services

Louise E. Moser, P. M. Michael Melliar-Smith, Wenbing Zhao
2007 Journal of Software  
However, ensuring that Web Services can satisfy their clients' requests when their clients need them is a real challenge.  ...  Web Services offer great promise for integrating and automating software applications within and between enterprises over the Internet.  ...  The clients communicate with the Web server and invoke operations of the Web Service, which is deployed in a server-side container.  ... 
doi:10.4304/jsw.2.1.14-26 fatcat:bja7hqxscfgddlz3hoza4cqivm

BASE

Rodrigo Rodrigues, Miguel Castro, Barbara Liskov
2001 Proceedings of the eighteenth ACM symposium on Operating systems principles - SOSP '01  
BASE combines proactive recovery [8] with abstraction to counter this problem. Replicas are recovered periodically even if there is no reason to suspect they are faulty.  ...  more, adds unacceptable time delays to the implementation, and does not provide a mechanism to repair faulty replicas.  ...  A C K N O W L E D G M E N T S We would like to thank Chandrasekhar Boyapati, Jo~o Garcia, Ant Rowstron, Larry Peterson (our shepherd), and the anonymous referees for their helpful comments on drafts of  ... 
doi:10.1145/502034.502037 dblp:conf/sosp/RodriguesCL01 fatcat:chxlicbzpjhq5kw4yoetetbucy

On the robustness of (semi) fast quorum-based implementations of atomic shared memory

Chryssis Georgiou, Nicolas Nicolaou, Alexander A. Shvartsman
2008 Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing - PODC '08  
Noteworthy is that the algorithm allows fast read operations even if they are concurrent with other read and write operations.  ...  , it is shown that such implementations are not robust due to the fact that they necessarily require a quorum system with a common intersection between its quorums.  ...  We model server failures by choosing the non-faulty quorum and allowing any server that is not a member of that quorum to fail by crashing.  ... 
doi:10.1145/1400751.1400817 dblp:conf/podc/GeorgiouNS08 fatcat:3e4tfuzq2nfvrjmt5qeit4ccuu

Data protection by means of fragmentation in various different distributed storage systems - a survey [article]

Katarzyna Kapusta, Gerard Memmi
2017 arXiv   pre-print
This paper analyzes various distributed storage systems that use data fragmentation and dispersal as a way of protection.Existing solutions have been organized into two categories: bitwise and structurewise  ...  Those having structured input data with predefined confidentiality level and disposing of a heterogeneous environment in terms of machine trustworthiness were classified as structurewise.  ...  It introduces a new l-b-c scheme, in which up to l servers are leakage-only faulty, up to b are Byzantine faulty and up to c servers can crash.  ... 
arXiv:1706.05960v1 fatcat:eigwwhaegjb7fl4z2yazxbzhjm

MoSQL

Alexander Tomic, Daniele Sciascia, Fernando Pedone
2013 Proceedings of the 28th Annual ACM Symposium on Applied Computing - SAC '13  
We present MoSQL, a MySQL storage engine using a transactional distributed key-value store system for atomicity, isolation and durability and a B+Tree for indexing purposes.  ...  Despite its popularity, MySQL is still without a generalpurpose storage engine providing high availability, serializability, and elasticity.  ...  Acknowledgements This work was supported in part by the Swiss National Science Foundation under grant number 127352 and the Hasler Foundation under grant number 2316. REFERENCES  ... 
doi:10.1145/2480362.2480452 dblp:conf/sac/TomicSP13 fatcat:e4oifxidsjbybgsisdfbettp5m

A Survey of Distributed Consensus Protocols for Blockchain Networks [article]

Yang Xiao, Ning Zhang, Wenjing Lou, Y. Thomas Hou
2019 arXiv   pre-print
The surveyed consensus protocols are analyzed using the five-component framework and compared with respect to different performance metrics.  ...  , drawbacks and trade-offs.  ...  Yonggang Wen, and the anonymous reviewers for their constructive comments on this paper. This work was supported in part by US National Science Foundation under grants CNS-1916902, CNS-1916926.  ... 
arXiv:1904.04098v3 fatcat:gegtpion3jditfhavbgprmfwnm

Edge Computing and Its Convergence with Blockchain in 5G and Beyond: Security, Challenges, and Opportunities

Showkat Ahmad Bhat, Ishfaq Bashir Sofi, Chong-Yung Chi
2020 IEEE Access  
. for different storage servers with diverse operating systems.  ...  Server-trusting client To create secure and lightweight clients for resource scare systems, a bitcoin client API (BCCAPI) is proposed.  ... 
doi:10.1109/access.2020.3037108 fatcat:iksoyfx7nbhfrefnzgf6uxuw4q

Fault tolerance at system level based on RADIC architecture

Marcela Castro-León, Hugo Meyer, Dolores Rexachs, Emilio Luque
2015 Journal of Parallel and Distributed Computing  
. • Fully decentralized and transparent, for applications and communication library. • Protection, detection and recovery functions, implemented at socket API level. • Semi-coordinated vs. uncoordinated  ...  The model consists of detecting failures in the communication socket caused by a faulty node.  ...  A communication is formed by a server socket opened with an accept() and with a client socket which performs a connect().  ... 
doi:10.1016/j.jpdc.2015.08.005 fatcat:shngouhqd5awnm55jfovsccrxi
« Previous Showing results 1 — 15 out of 125 results