000149873 001__ 149873
000149873 005__ 20190316234823.0
000149873 037__ $$aPOST_TALK
000149873 245__ $$aIndependent Faults in the Cloud
000149873 269__ $$a2010
000149873 260__ $$c2010
000149873 336__ $$aTalks
000149873 520__ $$aByzantine fault tolerant (BFT) protocols are replication-based solutions to the problem of tolerating the arbitrary failures of software and hardware components. The essential assumption for replication is independence of failures. In this paper, we categorize four different failure independence levels that could be obtained from the cloud. Not surprisingly, providing more level of independence comes with the cost of more delays and less bandwidth. We report on our experiments to identifying the most appropriate BFT protocol for each level.
000149873 6531_ $$aDistributed Algorithms
000149873 6531_ $$aConsensus
000149873 6531_ $$aBFT
000149873 6531_ $$aIndependent faults
000149873 6531_ $$aCloud computing
000149873 6531_ $$aEnd-to-End argument
000149873 700__ $$0240335$$g105326$$aGuerraoui, Rachid
000149873 700__ $$aYabandeh, Maysam$$g179583$$0242991
000149873 7112_ $$dJuly 28-29, 2010$$cZurich, Switzerland$$aThe 4th ACM SIGOPS/SIGACT Workshop on Large Scale Distributed Systems and Middleware (LADIS'10)
000149873 8564_ $$uhttp://ladisworkshop.org/node/10$$zURL
000149873 8564_ $$uhttps://infoscience.epfl.ch/record/149873/files/ladis-camera-ready.pdf$$zn/a$$s239381
000149873 8564_ $$uhttps://infoscience.epfl.ch/record/149873/files/ladis-cameraready.pdf$$zn/a$$s265635
000149873 909C0 $$xU10407$$0252114$$pDCL
000149873 909CO $$ooai:infoscience.tind.io:149873$$qGLOBAL_SET$$ppresentation$$pIC
000149873 917Z8 $$x179583
000149873 917Z8 $$x179583
000149873 937__ $$aEPFL-TALK-149873
000149873 973__ $$sPUBLISHED$$aEPFL
000149873 980__ $$aTALK