
	Where results make sense

Topic: Byzantine fault tolerance

Related Topics

P2P

Byzantine

Anonymous P2P

JXTA

Greek Fire

Collecting society

Cake

Monophysitism

Servent

In the News (Sat 30 Aug 08)

Gordon Brown

Derby County

Mike Huckabee

Lute Olson

Pearl Harbor

Sonia Gandhi

Ricky Hatton

Narendra Modi

Jesus Christ

Rudy Giuliani

	Reference.com/Encyclopedia/Byzantine fault tolerance
		Byzantine fault tolerance is the name given to a sub-field of error tolerance research, inspired by The Byzantine Generals' Problem, which is a generalized version of the Two Generals' Problem.
		A Byzantine failure (or Byzantine fault) is an arbitrary fault that occurs during the execution of an algorithm by a distributed system.
		Byzantine fault tolerance can be achieved if the loyal (non-faulty) generals have a unanimous agreement on their strategy.
	www.reference.com /browse/wiki/Byzantine_Fault_Tolerance (882 words)

	CSAIL Research Abstract
		Second, to handle Byzantine failures, HRDB uses voting---any response obtained by a client to a SQL statement in a committed transaction is guaranteed to have received a majority vote from among 2f + 1 replicas.
		Fail-stop faults are easy to detect and the replica manager replays transactions to bring the replica up to date.
		Byzantine faults that result in scheduling errors, particularly on the primary, can be very hard to detect.
	nms.csail.mit.edu /projects/hrdb (1193 words)

	Byzantine fault tolerance in TutorGig Encyclopedia
		In general, a Byzantine fault is one in which a component of some system not only behaves erroneously, but also fails to behave consistently when interacting with multiple other components.
		The object of Byzantine Fault Tolerance is to be able to defend against a Byzantine failure.
		The Byzantine Generals problem describes a group of generals, each commanding a division of the Byzantine army, encircling a city.
	www.tutorgig.com /ed/Byzantine_Fault_Tolerance (630 words)

	Object Computing, Inc. - CORBA News Brief - January 2003
		Faults are reported to a notification service that in turn distributes fault reports to participating FT CORBA components and other interested parties.
		Fault tolerant services interact with the replication manager to create object groups, manage an object group's properties, control an object group's membership, and so forth.
		Fault Analyzers may perform a variety of functions including identifying and analyzing related faults to identify a common root cause, aggregating multiple faults into a single fault report, filtering selected faults under certain circumstances, and so forth.
	www.ociweb.com /cnb/CORBANewsBrief-200301.html (4308 words)

	Ross Shaull Project Proposal « CS140 Logic Programming
		Tolerance of faults is sometimes also called the masking of faults.
		Another is the performance cost; the agreement protocol in BFT is synchronous since in the worst case every non-faulty node must be consulted before a reliable response can be sent to the client.
		Fault detection, on the other hand, allows load to be distributed among the processes in a network, and can operate in an asynchronous environment.
	www.cs.brandeis.edu /~rshaull/cs140/proposal (1114 words)

	:: CyLab
		It is important for distributed mission-critical applications to be able to quantify their survivability, and also for application developers to be able to compare different fault-tolerance approaches with each other, in the interests of selecting the best one.
		At this initial stage of research, we have categorized a variety of benign and malicious faults that we intend to inject, and we have also identified interception points in the Linux operating system where these faults might be injected.
		The results from this should be rather interesting â“ for one, apart from providing an objective way to compare BFT to Immune in terms of their implementation (independent of the underlying algorithms), we might be able to report on how accurately each system follows it fault model (i.e., the faults that it claims to handle).
	www.cylab.cmu.edu /default.aspx?id=1990 (1382 words)

	U of U School of Computing - Faculty Recruiting (Site not responding. Last check: 2007-11-04)
		Byzantine fault tolerance techniques can elegantly provide reliability without overly increasing the complexity of the system and have recently earned the attention of the system community.
		In the first part this talk I discuss some of the contributions I have made toward practical Byzantine fault tolerance---in particular, how to reduce the cost of replication and how to reconcile replication with confidentiality.
		In the second part of the talk I argue that Byzantine fault-tolerance alone is not sufficient to deal with cooperative services under multiple administrative domain, where nodes may deviate from their specification not just because they are broken or compromised, but also because they are selfish.
	www.cs.utah.edu /dept/colloq/05-06colloq/martin.html (222 words)

	[No title] (Site not responding. Last check: 2007-11-04)
		Deficiencies: I was very impressed with the paper overall, but I would have liked data on the performance of replication groups that could tolerate two or three node faults, which more clearly demonstrate the scalability of the system.
		Conclusions: This paper demonstrated that Byzantine fault tolerance can be practical in a real system, and using it as a powerful building block for servers, can be competitive with non-fault-tolerant implementations of the same service.
		A fault tolerant system was built employing many clever optimizations such as MACs, direct client broadcasts for read only requests, and hash function only replies in the common case to decrease network load.
	www.ece.cmu.edu /~ganger/712.fall01/summaries/castro.txt (365 words)

	FARGOS/SolidState Byzantine Fault-tolerant Web Services
		An important, but much rarer level of reliability in which a well-behaved fault can be tolerated without affecting the correct operation of the system and is very rare compared to highly-available system.
		Highly available systems provide a means to return the system to an operational state within a period of time shorter than that required to repair the fault in question; however, they do not guarantee that work in progress at the time the fault occurred will be preserved.
		Toleration of such faults preserves the investment of effort made by customers when shopping at a given site and retains the revenue streams that otherwise would have been lost.
	www.fargos.net /solidstate.html (879 words)

	Practical Byzantine Fault Tolerance - Castro, Liskov (ResearchIndex) (Site not responding. Last check: 2007-11-04)
		Byzantine faults such as software bugs, operator mistakes, and malicious attacks are the major cause of service interruptions.
		This thesis describes a new replication algorithm, BFT, that can be used to build highly-available systems that tolerate Byzantine faults.
		235 Practical Byzantine Fault Tolerance - Castro, Liskov - 1999 ACM DBLP
	citeseer.ist.psu.edu /castro01practical.html (1404 words)

	CS 548: Internet and Distributed Systems Seminar
		IBM S/390 Parallel Enterprise Server G5 fault tolerance: A historical perspective.
		Miguel Castro and Barbara Liskov, Practical Byzantine Fault Tolerance.
		By using cryptographically-signed messages, Byzantine agreement is fast enough to implement a Byzantine-fault-resistant NFS server.
	roc.cs.berkeley.edu /294fall01/readings.shtml (591 words)

	Dependable Middleware Research (Real-Time Fault-Tolerant Survivable Middleware)
		Eternal is a transparent infrastructure that I developed to provide strong fault tolerance to CORBA applications, without requiring any modification to the application, to the operating system, or to the ORB itself.
		The key contributions of this research work are the support for strong replica consistency, the sanitization of non-deterministic multithreading, and most importantly, the transparency of the fault tolerance.
		This also leads to considerable savings in terms of development time because, as soon as the application logic is ready, fault tolerance is available to be deployed "out-of-the-box" at run-time.
	www.cs.cmu.edu /~priya/research.html (623 words)

	Mathematics or metal? (Site not responding. Last check: 2007-11-04)
		Our goal here is to use techniques such as threshold decryption and Byzantine fault tolerance, as implemented in Rampart [Rei94].
		Byzantine fault tolerance means, for example, that with seven copies of the data we can resist a conspiracy of any two bad sysadmins, or the accidental destruction of four systems, and still make a complete recovery.
		Using Byzantine mechanisms alone, incomplete recovery would be possible after the destruction of up to six systems, but then there would be no guarantee of integrity (as such a `recovery' could be made by a bad sysadmin from bogus data).
	www.cl.cam.ac.uk /users/rja14/eternity/node10.html (419 words)

	CS5223 Assignment 2 (Site not responding. Last check: 2007-11-04)
		The Byzantine agreement is the problem of getting an agreement among a set of processes under malicious/faulty channels/processes.
		The third paper discusses achieving fault tolerance in a faulty Byzantine environment.
		The papers describe various aspects that are important for fault tolerant distributed systems.
	www.comp.nus.edu.sg /~cs5223/assignment2_06.html (825 words)

	vsevcosmos: Byzantine Fault Tolerance for Nondeterministic Applications. [cs.DC/0701134]
		When such applications are replicated to achieve Byzantine fault tolerance (BFT), their nondeterministic operations must be sanitized to ensure replica consistency.
		To the best of our knowledge, only two types of replica nondeterminism have been studied under the Byzantine fault model, which we refer to as wrappable nondeterminism and verifiable pre-determinable nondeterminism.
		Some of them require the collaboration of all correct replicas, while others require a post-determination of a consistent set of nondeterministic values after the execution of a request at a particular replica.
	vsevcosmos.livejournal.com /22617375.html (223 words)

	MIT World » : Practical Byzantine Fault Tolerance
		This talk will describe a new replication technique that allows services to withstand such Byzantine failures; the system is not only resilient to malicious attacks, but it also can continue to operate correctly in the presence of software bugs.
		The new algorithm is of interest for a number of reasons.
		It is the first approach that allows correct functioning over the lifetime of the system provided the number of Byzantine faults occurring in some small time window (e.g., 5 minutes) is bounded.
	mitworld.mit.edu /video/43 (177 words)

	College of Computer and Information Science
		In the first part of his talk JP discusses some contributions toward practical Byzantine fault tolerance---in particular, how to reduce the cost of replication and how to reconcile replication with confidentiality.
		In the second part of the talk, JP argues that Byzantine fault-tolerance alone is not sufficient to deal with cooperative services under multiple administrative domain, where nodes may deviate from their specification not just because they are broken or compromised, but also because they are selfish.
		To address this challenge, JP proposes BAR, a new failure model that combines concepts from Byzantine fault-tolerance and Game Theory.
	www.ccs.neu.edu /colloquium/MartinJe.html (214 words)

	GeneralPapers
		Fault Injection for Dependability Validation: A Methodology and some Applications.
		Faults, Symptoms, and Software Fault Tolerance in the Tandem GUARDIAN Operating System.
		Data replication strategies for fault tolerance and availability on commodity clusters.
	www.cs.uiuc.edu /class/fa05/cs598yyz/generalpapers.htm (900 words)

	HQ Replication: A Hybrid Quorum Protocol for Byzantine Fault Tolerance
		``HQ Replication: A Hybrid Quorum Protocol for Byzantine Fault Tolerance'' by James Cowling, Daniel Myers, Barbara Liskov, Rodrigo Rodrigues, and Liuba Shrira.
		There are currently two approaches to providing Byzantine-fault-tolerant state machine replication: a replica-based approach, e.g., BFT, that uses communication between replicas to agree on a proposed ordering of requests, and a quorum-based approach, such as Q/U, in which clients contact replicas directly to optimistically execute operations.
		HQ employs a lightweight quorum-based protocol when there is no contention, but uses BFT to resolve contention when it arises.
	www.cs.brandeis.edu /~liuba/pubs/HQ-OSDI-abstract.html (301 words)

	From:
		BFT can be used to build replicated systems that work correctly and remain
		This talk describes the algorithms used by BFT and the implementation of
		BFT and BFS -- a Byzantine-fault-tolerant NFS service built using BFT.
	www.securityoffice.net /mssecrets/mailarchive/Microsoft%20Research%20Seminer%20Notice/20.htm (199 words)

	CSAIL Biography
		Liskov, B., "BASE: Using Abstraction to Improve Fault Tolerance," ACM Transactions on Computer Systems 21(3), August 2003, 236-269 (with R. Rodrigues and M. Castro)
		Tolerating Byzantine Faulty Clients in a Quorum System.
		HQ Replication: A Hybrid Quorum Protocol for Byzantine Fault Tolerance.
	www.csail.mit.edu /biographies/PI/bioprint.php?PeopleID=30 (422 words)

	ResearchChannel - Practical Byzantine Fault Tolerance
		The growing reliance of our society on computers demands that we provide systems with improved reliability, availability, and security.
		This talk describes BFT -- a new software Byzantine fault tolerance toolkit that addresses these issues.
		BFT can be used to build replicated systems that work correctly and remain available even when some of their replicas behave arbitrarily due to malicious attacks, software errors, or hardware failures.
	www.researchchannel.org /prog/displayevent.aspx?rID=2128&fID=569 (94 words)

	CS590 Fall 2004: Insider Threats to Information Systems
		The Byzantine Generals Problem ACM Transactions on Programming Languages and Systems 4(3):382-401, July 1982.
		D. Dolev The Byzantine generals strike again, Journal of Algorithms 3(1):14-30, 1982.
		Providing Intrusion Tolerance With ITUA M. Cukier, T. Courtney, J. Lyons, H. Ramasamy, W. Sanders, M. Seri, M. Atighetchi, P. Rubel, C. Jones, F. Webber, P. Pal.
	homes.cerias.purdue.edu /~crisn/courses/cs590T (1338 words)

	Fault-Scalable Byzantine Fault-Tolerant Services
		A fault-scalable service can be configured to tolerate increasing numbers of faults without significant decreases in performance.
		A prototype service built using the Q/U protocol outperforms the same service built using a popular replicated state machine implementation at all system sizes in experiments that permit an optimistic execution.
		Moreover, the performance of the Q/U protocol decreases by only 36% as the number of Byzantine faults tolerated increases from one to five, whereas the performance of the replicated state machine decreases by 83%.
	www.pdl.cmu.edu /PDL-FTP/PASIS/sosp05_abs.html (152 words)

	DBLP: Barbara Liskov
		Miguel Castro, Rodrigo Rodrigues, Barbara Liskov: BASE: Using abstraction to improve fault tolerance.
		Miguel Castro, Barbara Liskov: Practical byzantine fault tolerance and proactive recovery.
		Miguel Castro, Rodrigo Rodrigues, Barbara Liskov: Using Abstraction To Improve Fault Tolerance.
	www.informatik.uni-trier.de /~ley/db/indices/a-tree/l/Liskov:Barbara.html (1400 words)

	NASA LaRC Formal Methods Program: SPIDER
		Mahyar R. Malekpour, "A Byzantine-Fault Tolerant Self-Stabilizing Protocol for Distributed Clock Synchronization Systems", NASA/TM-2006-214322, August 2006.
		A New On-line Diagnosis Protocol for the SPIDER Family of Byzantine Fault Tolerant Architectures.
		From Anonymity to Ubiquity: A Study of Our Increasing Reliance on Fault Tolerant Computing.
	shemesh.larc.nasa.gov /fm/spider/spider_pubs.html (498 words)

	Schedule (Site not responding. Last check: 2007-11-04)
		Separating Agreement from Execution in Byzantine Fault-Tolerant Systems.
		Fault-scalable Byzantine Fault-Tolerant Services, Michael Abd-El-Malek, G. Ganger, G. Goodson, M. Reiter, J. Wylie
		Acknowledgement: The material for this class liberally borrows from material for a similar class taught by Lorenzo Alvisi at UT Austin.
	www.cs.umass.edu /~arun/cs677/schedule.html (387 words)

	People in CIAS
		Lorenzo Alvisi -- Software reliability, distributed computing, fault tolerance, Byzantine replication, incentive-based systems
		Michael D. Dahlin -- trustworthy large-scale systems, distributes systems, file systems, Byzantine fault tolerance, incentive-based systems
		Anna Gal -- computational complexity, fault tolerance, randomness, private computation
	www.cias.utexas.edu /people.html (294 words)

	[No title]
		Practical byzantine fault tolerance Castro and Liskov What is this paper about?
		message are received at some point - keep retransmitting - network, client, and server will heal at some point Why 3f+1 nodes to tolerate f failures?
		- is IS going to run BFS to deal with byzantine failures?
	pdos.csail.mit.edu /6.824-2001/lecnotes/byzantine.txt (753 words)

Try your search on: Qwika (all wikis)