Where results make sense

About us   |   Why use us?   |   Reviews   |   PR   |   Contact us

Topic: Fault-tolerance

    Note: these results are not from the primary (high quality) database.

Ads by Google

In the News (Sat 19 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

Byzantine fault tolerance - Wikipedia, the free encyclopedia 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 theTwo Generals' Problem. Byzantine fault tolerance can be achieved if the loyal generals have a strategy to compare notes with each other such that conflicting information is disregarded. A second solution requires unforgeable signatures (in modern computer systems, this may be achieved through public key cryptography), but maintains Byzantine Fault Tolerance in the presence of an arbitrary number of traitorous generals. en.wikipedia.org /wiki/Byzantine_fault_tolerance   (580 words)

Fault-tolerant system - Wikipedia, the free encyclopedia Fault Handling and Fault Tolerance - Articles about software and hardware fault tolerance techniques. Implementing Fault Tolerance on Windows Networks - a high-level survey of the different fault tolerant technologies available for Windows Server 2003 Lockstep fault tolerant machines are most easily made fully synchronous, with each gate of each replication making the same state transition on the same edge of the clock, and the clocks to the replications being exactly in phase. en.wikipedia.org /wiki/Fault-tolerance   (945 words)

Byzantine Fault Tolerance and Beyond High Throughput Byzantine Fault Tolerance Ramakrishna Kotla, Mike Dahlin, In proceedings of the International Conference on Dependable Systems and Networks (DSN 2004), DCC Symposium, Florence, Italy, June 2004. Almost all lightweight Byzantine fault-tolerant protocols use the quorums approach. In this case, the traditional Byzantine model is no longer appropriate and a new model is needed to take into account the fact that the participants may deviate from the protocol when acting in their self-interest. www.cs.utexas.edu /users/dahlin/projects/bft   (1316 words)

Castro BFT is also the first to recover Byzantine-faulty replicas proactively. As a result, it can tolerate any number of faults over the lifetime of the system provided less than 1/3 of the replicas become faulty within a small window of vulnerability. 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.cs.cornell.edu /colloquium/Spring00/castro.htm   (229 words)

byzantine.ppt Tolerates malicious faults where the faulty component can behave in any arbitrary manner. Various Byzantine Agreement Algorithms used to arrive at a consensus among the processors. Byzantine Resilience built into hardware - consists of a Byzantine resilient hard-core network. euler.ecs.umass.edu /ece655/byzantine.ppt   (617 words)

MIT World » : Practical Byzantine Fault Tolerance 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. 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. mitworld.mit.edu /video/43   (177 words)

LCS Publication - MIT-LCS-TR-817 Byzantine faults such as software bugs, operatormistakes, and malicious attacks are the major cause of service interruptions. Therefore, webelieve that the BFT library can be used to build practical systems that tolerate Byzantine faults. BFT works in asynchronous environments like the Internet, it incorporatesmechanisms to defend against Byzantine-faulty clients, and it recovers replicas proactively. www.lcs.mit.edu /publications/specpub.php?id=1354   (226 words)

fault tolerance There are many levels of fault tolerance, the lowest being the ability to... Fault Tolerance White Papers: Search or browse to find Fault Tolerance white papers, case studies, webcasts and product literature... This page describes the term fault tolerance and lists other pages on the Web where you can find additional information. www.pconly.com /software/fault-tolerance.php   (446 words)

Permanent Web Publishing The conventional approach to fault tolerance through a limited number of replicas is brilliantly illustrated by Miguel Castro and Barbara Liskov, who built a replicated, fault-tolerant implementation of NFS that benchmarked only 3% slower than the baseline implementation when no failures were encountered and, of course, infinitely faster when they were. Broader applications of the underlying model of fault tolerance through massive replication and "sloppy" elections are harder to see. It tolerates faults; if the participant with the shortest random delay fails before transmitting its repair another will take its place. lockss.stanford.edu /freenix2000/freenix2000.html   (7518 words)

Ian Wehrman Building on the Castro and Liskov Byzantine Fault Tolerance protocol for unreplicated clients (CLBFT), we present a practical algorithm for Byzantine fault-tolerant execution of long-running distributed applications in which replicated deterministic clients invoke operations on replicated deterministic servers. The algorithm supports both synchronous and asynchronous clients, provides fault isolation between client and server groups with respect to both correctness and performance, and uses a novel architecture that accommodates externally requested software upgrades for long-running evolvable client applications. Byzantine agreement protocols for replicated deterministic state machines guarantee that externally requested operations continue to execute correctly even if a bounded number of replicas fail in arbitrary ways. www.cs.wustl.edu /~iwehrman/pub.html   (793 words)

W&B Scientific - A Case for Byzantine Fault Tolerance indeed, information retrieval systems and Byzantine fault tolerance have a long history of connecting in this manner. Homepage -> Miscellaneous -> A Case for Byzantine Fault Tolerance The improvement of lambda calculus is a typical question. wbsci.org /Miscellaneous/194/A-Case-for-Byzantine-Fault-Tolerance.html   (1653 words)

AgileStore Rabin M., Efficient dispersal of information for security, load balancing and fault tolerance. Fault Detection for Byzantine Quorum Systems - Alvisi, Malkhi, Pierce and Reiter, IEEE Transactions on Parallel and Distributed Systems, Sept 2001. Data confidentiality in the presence of malicious faults: www.ece.gatech.edu /research/labs/agile_store/links.html   (199 words)

Practical Byzantine Fault Tolerance - Castro, Liskov (ResearchIndex) 19 Authenticated Byzantine Fault Tolerance Without Public-Key C.. Abstract: This paper describes a new replication algorithm that is able to tolerate Byzantine faults. We believe that Byzantinefault -tolerant algorithms will be increasingly important in the future because malicious attacks and software errors are increasingly common and can cause faulty nodes to exhibit arbitrary behavior. citeseer.ist.psu.edu /364696.html   (802 words)

FORMATS-FTRTFT 2004 - A Unified Fault-Tolerance Protocol Davies and Wakerly show that Byzantine fault tolerance can be achieved by a cascade of broadcasts and middle value select functions. Presented at Formal Modelling and Analysis of Timed Systems - Formal Techniques in Real-Time and Fault Tolerant System (FORMATS-FTRTFT 2004), Grenoble, France, September 22-24, 2004 www-formats-ftrtft.imag.fr /accepted/64.html   (160 words)

BFT project homepage The BFT code uses the SFS cryptography library. For convenience we provide the version of SFS that is used by BFT. There is a patent pending on the BFT algorithm. www.pmg.lcs.mit.edu /bft   (523 words)

Fault-Scalable Byzantine Fault-Tolerant Services 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%. A fault-scalable service can be configured to tolerate increasing numbers of faults without significant decreases in performance. The optimistic quorum-based nature of the Q/U protocol allows it to provide better throughput and fault-scalability than replicated state machines using agreement-based protocols. www.pdl.cmu.edu /PDL-FTP/PASIS/sosp05_abs.html   (152 words)

CS590 Fall 2004: Insider Threats to Information Systems 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. 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. homes.cerias.purdue.edu /~crisn/courses/cs590T   (1338 words)

Fault-tolerance bibliography Probability Model for Faults in Large-Scale Multicomputer Systems - shows a method for calculating the probability of a mesh network given the probability of failure of individual nodes Efficient fault tolerant algorithms for resource allocation in distributed systems Separating Agreement from Execution for Byzantine Fault Tolerant Services www.eecs.umich.edu /~ppadala/research/bibs/ft_bib.html   (489 words)

DBLP: Barbara Liskov Miguel Castro, Barbara Liskov: Practical byzantine fault tolerance and proactive recovery. Miguel Castro, Barbara Liskov: Practical Byzantine Fault Tolerance. Miguel Castro, Rodrigo Rodrigues, Barbara Liskov: Using Abstraction To Improve Fault Tolerance. www.vldb.org /dblp/db/indices/a-tree/l/Liskov:Barbara.html   (1195 words)

MING LI developed algorithms for practical Byzantine fault tolerance that use fewer than 3f+1 replicas being active, and others as standby spares that are used only for reconfigurations. Ming Li and Yuval Tamir, "Practical Byzantine Fault Tolerance Using Fewer than 3f+1 Active Replicas," 17th ISCA International Conference on Parallel and Distributed Computing Systems, San Francisco, CA (September 2004). The development of such a system involves close investigations and solutions to many problems raised in fault-tolerant distributed systems, such as state machine replication, asynchronous consensus, reliable atomic multicast, Byzantine fault-tolerance, distributed diagnosis, recovery and reconfiguration. www.cs.ucla.edu /~mli   (498 words)

DBLP: Michael Dahlin Ramakrishna Kotla, Michael Dahlin: High Throughput Byzantine Fault Tolerance. Jian Yin, Jean-Philippe Martin, Arun Venkataramani, Lorenzo Alvisi, Michael Dahlin: Towards a Practical Approach to Confidential Byzantine Fault Tolerance. Jian Yin, Jean-Philippe Martin, Arun Venkataramani, Lorenzo Alvisi, Michael Dahlin: Separating agreement from execution for byzantine fault tolerant services. informatik.uni-trier.de /~ley/db/indices/a-tree/d/Dahlin:Michael.html   (719 words)

Find in a Library: Self-adjusting quorum systems for Byzantine fault tolerance Find in a Library: Self-adjusting quorum systems for Byzantine fault tolerance WorldCat is provided by OCLC Online Computer Library Center, Inc. on behalf of its member libraries. To find this item in a library, enter a postal code, state, province, or country in the field above. worldcatlibraries.org /wcpa/ow/7dac219fda02f7a3a19afeb4da09e526.html   (46 words)

Publications on Dependable Middleware Systems [MEAD, Starfish, Eternal, Immune] This includes our work on Byzantine fault-tolerance for middleware, updatable intrusion detection systems, and failure prediction. Initial Joint Submission on Fault Tolerance for CORBA (Response to the OMG's Re quest for Proposals on fault-tolerant CORBA), Eternal: Fault Tolerance and Live Upgrades for Distributed Object Systems www.cs.cmu.edu /~priya/publications.html   (1098 words)

Software Engineering Lab - Projects At this stage, integration of fault tolerance means identifying the need for fault tolerance, finding the places where it is needed, and specifying what degree of fault tolerance must be achieved. It makes it possible to state the required level of fault tolerance precisely and then choose the appropriate models, design and infrastructure to achieve it. At this stage, the design process must be augmented in such a way that it leads to a solution that additionally fulfills the fault tolerance requirements. www.cs.mcgill.ca /~joerg/sel/sel_projects.html   (1870 words)

d219_berg_p.doc Fault Tolerance The definition of Fault Tolerance is the ability to mask or recover from erroneous conditions in a system once an error has been detected. Determining the Level of Fault Tolerance for Your System The degree of fault tolerance implementation is defined by your system level requirements i.e. Fault Tolerant State Machine Implementation The main objective of a fault tolerant state machine is to be able to detect an error (a flipped bit in the current state registers) and have a deterministic response within a deterministic time frame. klabs.org /mapld04/papers/d/d219_berg_p.doc   (4449 words)

ubicomp.doc Fault tolerance in measurements by a group of sensors, was first studied by Marzullo [Mar90]. Although fault tolerance has been studied for several decades in computer and VLSI systems, tremendous intrinsic reliability of VLSI integrated circuits technology and operation in well-conditioned environments restricted the importance of fault tolerance in a great majority of computing systems. Fault tolerance as a computer related research concept has been studied for almost half a century. www.cs.ucla.edu /~sascha/sensor_networks/COMSENS/ubicomp.doc   (8302 words)

Network Fault-Tolerance with Interval Routing Devices - Vounckx, Deconinck, Cuyvers, Lauwereins, Peperstraete (ResearchIndex) On the Realisation of a Fault Tolerance Concept.. Vounckx, G. Deconinck, R. Cuyvers, R. Lauwereins, J.A. Peperstraete, "Network Fault-Tolerance with Interval Routing Devices", Proc. @misc{ vounckx93network, author = "J. Vounckx and G. Deconinck and R. Cuyvers and R. Lauwereins and J. Peperstraete", title = "Network Fault-Tolerance with Interval Routing Devices", text = "J. Vounckx, G. Deconinck, R. Cuyvers, R. Lauwereins, J.A. Peperstraete, Network Fault-Tolerance with Interval Routing Devices, Proc. citeseer.ist.psu.edu /vounckx93network.html   (8302 words)

Srikant Sharma's Resume Duplex: Fault Tolerance Extension for NADs: This research provides a fault tolerance extension framework for Network Access Devices, such as, firewalls, bandwidth controllers, etc. This framework minimizes fault-tolerance implementational efforts for these devices by providing a generic mechanism towards fault-tolerance. In essence, the traffic engineering application is mapped to the spanning tree state of the network. The key contribution of this research is the demonstration of feasibility and usage of complex mechanism like traffic engineering in metro Ethernet networks that leverages upon the programmable capabilities of networks. www.ecsl.cs.sunysb.edu /~srikant/resume.html   (1817 words)

Fault tolerant memory system - Patent 5553231 Another level of fault tolerance is provided by utilizing redundant clocks which are maintained in synchronization, with voting circuits serving to select one of a plurality of matching clock signals for use in various parts of the system, thereby preventing a faulty clock from being used to the detriment of system performance. Yet another novel fault tolerance feature of this invention is achieved by dividing data bit storage into a plurality of modules, each having a bit size which is capable of being corrected by the error correction code being used. Furthermore, prior art fault tolerant memory systems provide some level of fault tolerance with respect to errors in individual memory chip data storage and retrieval, but do not provide fault tolerance with respect to associated logic in the memory system, including data drivers, memory address circuitry, and the like. www.freepatentsonline.com /5553231.html   (8932 words)

Try your search on: Qwika (all wikis)

About us   |   Why use us?   |   Reviews   |   Press   |   Contact us   Copyright © 2005-2007 www.factbites.com Usage implies agreement with terms.