Bibliographies thématiques / Byzantine failure

Littérature scientifique sur le sujet « Byzantine failure »

Auteur : Grafiati
Publié le 25 mai 2024

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Sommaire

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Byzantine failure ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "Byzantine failure"

1

Raynal, Michel. « On the Versatility of Bracha’s Byzantine Reliable Broadcast Algorithm ». Parallel Processing Letters 31, no 03 (27 mai 2021) : 2150006. http://dx.doi.org/10.1142/s0129626421500067.

Texte intégral
Résumé :
G. Bracha presented in 1987 a simple and efficient reliable broadcast algorithm for [Formula: see text]-process asynchronous message-passing systems, which tolerates up to [Formula: see text] Byzantine processes. Following an idea recently introduced by Hirt, Kastrato and Liu-Zhang (OPODIS 2020), instead of considering the upper bound on the number of Byzantine processes [Formula: see text], the present short article considers two types of Byzantine behavior: the ones that can prevent the safety property from being satisfied, and the ones that can prevent the liveness property from being satisfied (a Byzantine process can exhibit only one or both types of failures). This Byzantine differentiated failure model is captured by two associated upper bounds denoted [Formula: see text] (for safety) and [Formula: see text] for liveness). The article shows that only the threshold values used in the predicates of Bracha’s algorithm must be modified to obtain an algorithm that works with this differentiated Byzantine failure model.
Styles APA, Harvard, Vancouver, ISO, etc.
2

ABORISADE, D. O., A. S. SODIYA, A. A. ODUMOSU, O. Y. ALOWOSILE et A. A. ADEDEJI. « A SURVIVABLE DISTRIBUTED DATABASE AGAINST BYZANTINE FAILURE ». Journal of Natural Sciences Engineering and Technology 15, no 2 (22 novembre 2017) : 61–72. http://dx.doi.org/10.51406/jnset.v15i2.1684.

Texte intégral
Résumé :
Distributed Database Systems have been very useful technologies in making a wide range of information available to users across the World. However, there are now growing security concerns, arising from the use of distributed systems, particularly the ones attached to critical systems. More than ever before, data in distributed databases are more susceptible to attacks, failures or accidents owing to advanced knowledge explosions in network and database technologies. The imperfection of the existing security mechanisms coupled with the heightened and growing concerns for intrusion, attack, compromise or even failure owing to Byzantine failure are also contributing factors. The importance of survivable distributed databases in the face of byzantine failure, to other emerging technologies is the motivation for this research. Furthermore, It has been observed that most of the existing works on distributed database only dwelled on maintaining data integrity and availability in the face of attack. There exist few on availability or survibability of distributed databases owing to internal factors such as internal sabotage or storage defects. In this paper, an architecture for entrenching survivability of Distributed Databases occasioned by Byzantine failures is proposed. The proposed architecture concept is based on re-creating data on failing database server based on a set threshold value.The proposed architecture is tested and found to be capable of improving probability of survivability in distributed database where it is implemented to 99.6% from 99.2%.
Styles APA, Harvard, Vancouver, ISO, etc.
3

PAQUETTE, MICHEL, et ANDRZEJ PELC. « FAST BROADCASTING WITH BYZANTINE FAULTS ». International Journal of Foundations of Computer Science 17, no 06 (décembre 2006) : 1423–39. http://dx.doi.org/10.1142/s0129054106004492.

Texte intégral
Résumé :
We construct and analyze a fast broadcasting algorithm working in the presence of Byzantine component faults. Such faults are particularly difficult to deal with, as faulty components may behave arbitrarily (even maliciously) as transmitters, by either blocking, rerouting, or altering transmitted messages in a way most detrimental to the broadcasting process. We assume that links and nodes of a communication network are subject to Byzantine failures, and that faults are distributed randomly and independently, with link failure probability p and node failure probability q, these parameters being constant and satisfying the inequality (1 - p)2(1 - q) > 1/2. A broadcasting algorithm, working in an n-node network, is called almost safe if the probability of its correctness is at least 1 - 1/n, for sufficiently large n. Thus the robustness of the algorithm grows with the size of the network. Our main result is the design and analysis of an almost safe broadcasting algorithm working in time O( log 2 n) and using O(n log n) messages in n-node networks. Under a stronger assumption on failure probability parameters, namely (1 - p)2(1 - q)2 > 1/2, our algorithm can be modified to work in time O( log 2 n/ log log n), also using O(n log n) messages. The novelty of our algorithm is that it can cope with the most difficult type of faults, potentially affecting all components of the network (both its links and nodes), and that it is simultaneously robust and efficient.
Styles APA, Harvard, Vancouver, ISO, etc.
4

Wang, Shu-Ching, et Kuo-Qin Yan. « Byzantine Agreement under dual failure mobile network ». Computer Standards & ; Interfaces 28, no 4 (avril 2006) : 475–92. http://dx.doi.org/10.1016/j.csi.2005.03.004.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

FRIEDMAN, ROY, ACHOUR MOSTEFAOUI et MICHEL RAYNAL. « $\diamondsuit {\mathcal P}_{mute}$-BASED CONSENSUS for ASYNCHRONOUS BYZANTINE SYSTEMS ». Parallel Processing Letters 15, no 01n02 (mars 2005) : 169–82. http://dx.doi.org/10.1142/s0129626405002131.

Texte intégral
Résumé :
This paper presents a consensus protocol for asynchronous distributed systems made up of n processes, where up to f<n/4 processes can behave arbitrarily (Byzantine processes). The protocol assumes that the underlying system is equipped with an unreliable failure detector of the class [Formula: see text]. The failure detectors of the class [Formula: see text] ensure that (1) all mute processes are detected (a mute process is a process that, after some time, stops sending protocol messages), and (2) after some unknown but finite time, no correct process is suspected (mute processes are a subset of the Byzantine processes). The proposed protocol enjoys the following properties. It is based on the round coordinator paradigm and its design principle is particularly simple. Its message complexity is O(n2) per round. In addition to a round number, the message size is O(1), except for one message per round (sent by the round coordinator) whose size is O(n). The protocol does not use message "proofs", certificates, or application level signatures. When no process is faulty, all processes propose the same value, and the failure detector makes no mistake, the processes decide in one round (4 communication steps). Finally, when a process decides, it only needs a simple unreliable broadcast mechanism to prevent the other processes from deadlocking. All these features make the protocol attractive to cope with the net effect of Byzantine failures and asynchrony.
Styles APA, Harvard, Vancouver, ISO, etc.
6

Porada, Aleksandra. « Kardynał Bessarion i jego księgozbiór ». Bibliotekarz Podlaski Ogólnopolskie Naukowe Pismo Bibliotekoznawcze i Bibliologiczne 60, no 3 (21 décembre 2023) : 297–324. http://dx.doi.org/10.36770/bp.834.

Texte intégral
Résumé :
Cardinal Bessarion (ca. 1400–1472), a theologian born in Trebizond and educated in Byzantium, made a career in the hierarchy of the Byzantine clergy and attracted the attention of the imperial family. He was one of the most active participants of the Council of Ferrara-Florence (1438–1439). Following the failure of the church union in Constantinople, Bessarion came to work for the papal curia in Rome. As a cardinal he used his income and contacts to help Byzantine refugees and Greeks living under the rule of the Republic of Venice, especially after the fall of Constantinople. Fearing that the loss of statehood could mean that the heritage of Greek culture would fall into oblivion, Bessarion created a great library containing the masterpieces of Ancient Greek literature, the classical philosophical works, and the texts of the Eastern Church Fathers. In 1468, he donated this collection to the Republic of Venice, and in such a manner founded one of the first public libraries in Europe.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Betancourt, Roland. « Faltering images : failure and error in Byzantine manuscript illumination ». Word & ; Image 32, no 1 (2 janvier 2016) : 1–20. http://dx.doi.org/10.1080/02666286.2016.1143766.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Maurer, Alexandre, et Sebastien Tixeuil. « Tolerating Random Byzantine Failures in an Unbounded Network ». Parallel Processing Letters 26, no 01 (mars 2016) : 1650003. http://dx.doi.org/10.1142/s0129626416500031.

Texte intégral
Résumé :
In a context where networks grow larger and larger, their nodes become more likely to fail. Indeed, they may be subject to crashes, attacks, memory corruptions… To encompass all possible types of failure, we consider the most general model of failure: the Byzantine model, where any failing node may exhibit arbitrary (and potentially malicious) behavior. We consider an asynchronous grid-shaped network where each node has a probability λ to be Byzantine. Our metric is the communication probability, that is, the probability that any two nodes communicate reliably. A number of Byzantine-resilient broadcast protocols exist, but they all share the same weakness: when the size of the grid increases, the communication probability approaches zero. In this paper, we present the first protocol that overcomes this difficulty, and ensures a communication probability of [Formula: see text] on a grid that may be as large as we want (for a sufficiently small λ, typically [Formula: see text]). The originality of the approach lies in the fractal definition of the protocol, which, we believe, could be used to solve several similar problems related to scalability. We also extend this scheme to a 3-dimensional grid and obtain a [Formula: see text] communication probability for [Formula: see text].
Styles APA, Harvard, Vancouver, ISO, etc.
9

Karavites, Peter. « Gregory Nazianzinos and Byzantine hymnography ». Journal of Hellenic Studies 113 (novembre 1993) : 81–98. http://dx.doi.org/10.2307/632399.

Texte intégral
Résumé :
Frequent references have been made by several scholars to the use of Gregory's writings as a ‘mine’ for Byzantine hymnography. The discussions have usually stopped with three or four quick citations of the instances that best exemplify the borrowing. To date there has not been any systematic effort to research the topic in greater detail. This failure is understandable. Such a research presupposes knowledge not only of Gregory's writings, a major task in itself since his works occupy four volumes of PG, but also of Byzantine hymnography which is scattered throughout several volumes used by the Orthodox Church in its daily heortologion. Adding the possibilities that might exist among the mss of Grottaferrata and those that might exist in the Vatican Library, one can easily understand the magnitude of the task and its complexities. This paper attempts a limited but still daunting undertaking: the ferreting out of the borrowings from Gregory by the Byzantine hymnographers whose hymns are still used by the Orthodox Church. Beyond the obvious borrowings by the hymnographers from Gregory lies the insoluble problem of what may be directly borrowed and what indirectly. How can one prove that similarities or even identities in the language denote direct borrowing of one author from another? The complexities of such an investigation notwithstanding, the effort should be made, even on a limited scale, because of the interest and the challenge involved.
Styles APA, Harvard, Vancouver, ISO, etc.
10

Honoré, Wolf, Longfei Qiu, Yoonseung Kim, Ji-Yong Shin, Jieung Kim et Zhong Shao. « AdoB : Bridging Benign and Byzantine Consensus with Atomic Distributed Objects ». Proceedings of the ACM on Programming Languages 8, OOPSLA1 (29 avril 2024) : 419–48. http://dx.doi.org/10.1145/3649826.

Texte intégral
Résumé :
Achieving consensus is a challenging and ubiquitous problem in distributed systems that is only made harder by the introduction of malicious byzantine servers. While significant effort has been devoted to the benign and byzantine failure models individually, no prior work has considered the mechanized verification of both in a generic way. We claim this is due to the lack of an appropriate abstraction that is capable of representing both benign and byzantine consensus without either losing too much detail or becoming impractically complex. We build on recent work on the atomic distributed object model to fill this void with a novel abstraction called AdoB. In addition to revealing important insights into the essence of consensus, this abstraction has practical benefits for easing distributed system verification. As a case study, we proved safety and liveness properties for AdoB in Coq, which are the first such mechanized proofs to handle benign and byzantine consensus in a unified manner. We also demonstrate that AdoB faithfully models real consensus protocols by proving it is refined by standard network-level specifications of Fast Paxos and a variant of Jolteon.
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Thèses sur le sujet "Byzantine failure"

1

Del, Pozzo Antonella. « Building distributed computing abstractions in the presence of mobile byzantine failures ». Thesis, Paris 6, 2017. http://www.theses.fr/2017PA066159/document.

Texte intégral
Résumé :
Dans cette thèse on s’intéresse à un modèle de faute Byzantins Mobiles. Jusqu’à présent, seulement le problème du Consensus a été résolu en présente de faute Byzantines Mobiles et plusieurs variations de ce modèle de faute ont été proposé. Pour chacun de ces modelés ont été prouvées les bornes inferieures du nombre de processus correct nécessaire et des solutions asymptotiquement optimales ont été proposées. Notre première contribution porte sur les registres repartis dans ce modèle. Les registres repartis sont l’abstraction à la base du stockage reparti. Ces résultats préconisent donc notre deuxième contribution principale, un modèle de faute Byzantine Mobile généralisé. Notre troisième contribution est un ensemble de preuves de nécessité et d’impossibilité pour les registres repartis dans ces modèles. En particulier on prouve qu’il n’est pas possible d’implémenter la spécification plus faible des registres dans un système asynchrone. Par contre, pour les systèmes synchrones, on prouve des bornes inferieures et propose des protocoles asymptotiquement optimaux pour le registrer régulier. Pour conclure, notre dernière contribution porte sur le problème d’accord approximé, une forme affaiblie du consensus. On résout ce problème dans le modèle basé sur ronde, le même du consensus. En outre, il est intéressant de noter qua dans le modèle statique, la borne inferieure sur le nombre de répliques est la même pour le consensus et pour le problème d’accord approximé. Le même invariant s’applique avec les fautes byzantine mobiles. De plus, on accompagne ces bornes inferieures avec une solution asymptotiquement optimale pour le problème d’accord approximé
In this thesis we consider a model where Byzantine failures are not fixed, we consider the so called Mobile Byzantine failures. So far, only Consensus problem has been solved in presence of Mobile Byzantine failures and interestingly different variations of this failure model have been proposed. For each of them have been proved lower bounds on the number of required processes and have been proposed tight solutions. Our first contribution concerns distributed Registers in such strong model. Distributed Registers are the basic abstraction for Distributed Storages. This advocates our second and main contribution, a general Mobile Byzantine Failure Model. Our main focus is about Distributed Registers, so our third contribution comes, we prove necessities and impossibilities in those models. In particular we prove that is it not possible to solve the weakest register specification in an asynchronous system. On the other side we prove lower bounds for the synchronous system, with respect to the proposed hierarchy models, and tight protocols to solve the Regular Register problem. To conclude, our last contribution is about the Approximate Agreement problem, a weaker form of Consensus. We solve such problem in the same round-based models as Consensus so far. The interesting result is the following, in presence of static Byzantine failures, lower bounds on the number of correct replicas does not change between consensus and approximate agreement. The same invariant still holds in presence of Mobile Byzantine failure. Moreover, along with lower bounds we propose a tight solution to solve approximate agreement
Styles APA, Harvard, Vancouver, ISO, etc.
2

Del, Pozzo Antonella. « Building distributed computing abstractions in the presence of mobile byzantine failures ». Electronic Thesis or Diss., Paris 6, 2017. http://www.theses.fr/2017PA066159.

Texte intégral
Résumé :
Dans cette thèse on s’intéresse à un modèle de faute Byzantins Mobiles. Jusqu’à présent, seulement le problème du Consensus a été résolu en présente de faute Byzantines Mobiles et plusieurs variations de ce modèle de faute ont été proposé. Pour chacun de ces modelés ont été prouvées les bornes inferieures du nombre de processus correct nécessaire et des solutions asymptotiquement optimales ont été proposées. Notre première contribution porte sur les registres repartis dans ce modèle. Les registres repartis sont l’abstraction à la base du stockage reparti. Ces résultats préconisent donc notre deuxième contribution principale, un modèle de faute Byzantine Mobile généralisé. Notre troisième contribution est un ensemble de preuves de nécessité et d’impossibilité pour les registres repartis dans ces modèles. En particulier on prouve qu’il n’est pas possible d’implémenter la spécification plus faible des registres dans un système asynchrone. Par contre, pour les systèmes synchrones, on prouve des bornes inferieures et propose des protocoles asymptotiquement optimaux pour le registrer régulier. Pour conclure, notre dernière contribution porte sur le problème d’accord approximé, une forme affaiblie du consensus. On résout ce problème dans le modèle basé sur ronde, le même du consensus. En outre, il est intéressant de noter qua dans le modèle statique, la borne inferieure sur le nombre de répliques est la même pour le consensus et pour le problème d’accord approximé. Le même invariant s’applique avec les fautes byzantine mobiles. De plus, on accompagne ces bornes inferieures avec une solution asymptotiquement optimale pour le problème d’accord approximé
In this thesis we consider a model where Byzantine failures are not fixed, we consider the so called Mobile Byzantine failures. So far, only Consensus problem has been solved in presence of Mobile Byzantine failures and interestingly different variations of this failure model have been proposed. For each of them have been proved lower bounds on the number of required processes and have been proposed tight solutions. Our first contribution concerns distributed Registers in such strong model. Distributed Registers are the basic abstraction for Distributed Storages. This advocates our second and main contribution, a general Mobile Byzantine Failure Model. Our main focus is about Distributed Registers, so our third contribution comes, we prove necessities and impossibilities in those models. In particular we prove that is it not possible to solve the weakest register specification in an asynchronous system. On the other side we prove lower bounds for the synchronous system, with respect to the proposed hierarchy models, and tight protocols to solve the Regular Register problem. To conclude, our last contribution is about the Approximate Agreement problem, a weaker form of Consensus. We solve such problem in the same round-based models as Consensus so far. The interesting result is the following, in presence of static Byzantine failures, lower bounds on the number of correct replicas does not change between consensus and approximate agreement. The same invariant still holds in presence of Mobile Byzantine failure. Moreover, along with lower bounds we propose a tight solution to solve approximate agreement
Styles APA, Harvard, Vancouver, ISO, etc.
3

Farina, Giovanni. « Tractable Reliable Communication in Compromised Networks ». Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS310.

Texte intégral
Résumé :
Une communication fiable est une primitive fondamentale dans les systèmes distribués sujets aux pannes Byzantines (c'est-à-dire arbitraires et éventuellement malveillants) pour garantir l'intégrité, l’authenticité et la livraison des messages échangés entre les processus. Son adoption pratique dépend fortement des hypothèses du système. Plusieurs solutions ont été proposées jusqu'à présent dans la littérature mettant en œuvre une telle primitive, mais certaines manquent d'évolutivité et / ou exigent des conditions de réseau topologiques difficiles à vérifier. Cette thèse vise à étudier et à résoudre certains des problèmes et défis ouverts implémentant une telle primitive de communication. Plus précisément, nous analysons comment une primitive de communication fiable peut être implémentée dans 1) un système distribué statique où un sous-ensemble de processus est compromis, 2) un système distribué dynamique où une partie des processus est Byzantiné, et 3) un système distribué statique où chaque processus peut être compromis et récupérer. Nous définissons plusieurs protocoles plus efficaces et nous caractérisons des conditions de réseau alternatives garantissant leur exactitude
Reliable communication is a fundamental primitive in distributed systems prone to Byzantine (i.e. arbitrary, and possibly malicious) failures to guarantee the integrity, delivery, and authorship of the messages exchanged between processes. Its practical adoption strongly depends on the system assumptions. Several solutions have been proposed so far in the literature implementing such a primitive, but some lack in scalability and/or demand topological network conditions computationally hard to be verified. This thesis aims to investigate and address some of the open problems and challenges implementing such a communication primitive. Specifically, we analyze how a reliable communication primitive can be implemented in 1) a static distributed system where a subset of processes is compromised, 2) a dynamic distributed system where part of the processes is Byzantine faulty, and 3) a static distributed system where every process can be compromised and recover. We define several more efficient protocols and we characterize alternative network conditions guaranteeing their correctness
Styles APA, Harvard, Vancouver, ISO, etc.
4

Maurer, Alexandre. « Communication fiable dans les réseaux multi-sauts en présence de fautes byzantines ». Thesis, Paris 6, 2014. http://www.theses.fr/2014PA066347/document.

Texte intégral
Résumé :
A mesure que les réseaux s'étendent, ils deviennent de plus en plus susceptibles de défaillir. En effet, leurs nœuds peuvent être sujets à des attaques, pannes, corruptions de mémoire... Afin d'englober tous les types de fautes possibles, nous considérons le modèle le plus général possible : le modèle Byzantin, où les nœuds fautifs ont un comportement arbitraire (et donc, potentiellement malveillant). De telles fautes sont extrêmement dangereuses : un seul nœud Byzantin, s'il n'est pas neutralisé, peut déstabiliser l'intégralité du réseau.Nous considérons le problème d'échanger fiablement des informations dans un réseau multi-Sauts malgré la présence de telles fautes Byzantines. Des solutions existent mais nécessitent un réseau dense, avec un grand nombre de voisins par nœud. Dans cette thèse, nous proposons des solutions pour les réseaux faiblement connectés, tels que la grille, où chaque nœud a au plus 4 voisins. Dans une première partie, nous acceptons l'idée qu'une minorité de nœuds corrects échouent à communiquer fiablement. En contrepartie, nous proposons des solutions qui tolèrent un grand nombre de fautes Byzantines dans les réseaux faiblement connectés. Dans une seconde partie, nous proposons des algorithmes qui garantissent une communication fiable entre tous les nœuds corrects, pourvu que les nœuds Byzantins soient suffisamment distants. Enfin, nous généralisons des résultats existants à de nouveaux contextes : les réseaux dynamiques, et les réseaux de taille non-Bornée
As modern networks grow larger and larger, they become more likely to fail. Indeed, their nodes can be subject to attacks, failures, memory corruptions... In order to encompass all possible types of failures, we consider the most general model of failure: the Byzantine model, where the failing nodes have an arbitrary (and thus, potentially malicious) behavior. Such failures are extremely dangerous, as one single Byzantine node, if not neutralized, can potentially lie to the entire network. We consider the problem of reliably exchanging information in a multihop network despite such Byzantine failures. Solutions exist but require a dense network, where each node has a large number of neighbors. In this thesis, we propose solutions for sparse networks, such as the grid, where each node has at most 4 neighbors. In a first part, we accept that some correct nodes fail to communicate reliably. In exchange, we propose quantitative solutions that tolerate a large number of Byzantine failures, and significantly outperform previous solutions in sparse networks. In a second part, we propose algorithms that ensure reliable communication between all correct nodes, provided that the Byzantine nodes are sufficiently distant from each other. At last, we generalize existing results to new contexts: dynamic networks, and networks with an unbounded diameter
Styles APA, Harvard, Vancouver, ISO, etc.
5

Maurer, Alexandre. « Communication fiable dans les réseaux multi-sauts en présence de fautes byzantines ». Electronic Thesis or Diss., Paris 6, 2014. http://www.theses.fr/2014PA066347.

Texte intégral
Résumé :
A mesure que les réseaux s'étendent, ils deviennent de plus en plus susceptibles de défaillir. En effet, leurs nœuds peuvent être sujets à des attaques, pannes, corruptions de mémoire... Afin d'englober tous les types de fautes possibles, nous considérons le modèle le plus général possible : le modèle Byzantin, où les nœuds fautifs ont un comportement arbitraire (et donc, potentiellement malveillant). De telles fautes sont extrêmement dangereuses : un seul nœud Byzantin, s'il n'est pas neutralisé, peut déstabiliser l'intégralité du réseau.Nous considérons le problème d'échanger fiablement des informations dans un réseau multi-Sauts malgré la présence de telles fautes Byzantines. Des solutions existent mais nécessitent un réseau dense, avec un grand nombre de voisins par nœud. Dans cette thèse, nous proposons des solutions pour les réseaux faiblement connectés, tels que la grille, où chaque nœud a au plus 4 voisins. Dans une première partie, nous acceptons l'idée qu'une minorité de nœuds corrects échouent à communiquer fiablement. En contrepartie, nous proposons des solutions qui tolèrent un grand nombre de fautes Byzantines dans les réseaux faiblement connectés. Dans une seconde partie, nous proposons des algorithmes qui garantissent une communication fiable entre tous les nœuds corrects, pourvu que les nœuds Byzantins soient suffisamment distants. Enfin, nous généralisons des résultats existants à de nouveaux contextes : les réseaux dynamiques, et les réseaux de taille non-Bornée
As modern networks grow larger and larger, they become more likely to fail. Indeed, their nodes can be subject to attacks, failures, memory corruptions... In order to encompass all possible types of failures, we consider the most general model of failure: the Byzantine model, where the failing nodes have an arbitrary (and thus, potentially malicious) behavior. Such failures are extremely dangerous, as one single Byzantine node, if not neutralized, can potentially lie to the entire network. We consider the problem of reliably exchanging information in a multihop network despite such Byzantine failures. Solutions exist but require a dense network, where each node has a large number of neighbors. In this thesis, we propose solutions for sparse networks, such as the grid, where each node has at most 4 neighbors. In a first part, we accept that some correct nodes fail to communicate reliably. In exchange, we propose quantitative solutions that tolerate a large number of Byzantine failures, and significantly outperform previous solutions in sparse networks. In a second part, we propose algorithms that ensure reliable communication between all correct nodes, provided that the Byzantine nodes are sufficiently distant from each other. At last, we generalize existing results to new contexts: dynamic networks, and networks with an unbounded diameter
Styles APA, Harvard, Vancouver, ISO, etc.
6

Abid, Muhammad Zeeshan. « A Multi-leader Approach to Byzantine Fault Tolerance : Achieving Higher Throughput Using Concurrent Consensus ». Thesis, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-170553.

Texte intégral
Résumé :
Byzantine Fault Tolerant protocols are complicated and hard to implement.Today’s software industry is reluctant to adopt these protocols because of thehigh overhead of message exchange in the agreement phase and the high resourceconsumption necessary to tolerate faults (as 3 f + 1 replicas are required totolerate f faults). Moreover, total ordering of messages is needed by mostclassical protocols to provide strong consistency in both agreement and executionphases. Research has improved throughput of the execution phase by introducingconcurrency using modern multicore infrastructures in recent years. However,improvements to the agreement phase remains an open area. Byzantine Fault Tolerant systems use State Machine Replication to tolerate awide range of faults. The approach uses leader based consensus algorithms for thedeterministic execution of service on all replicas to make sure all correct replicasreach same state. For this purpose, several algorithms have been proposed toprovide total ordering of messages through an elected leader. Usually, a singleleader is considered to be a bottleneck as it cannot provide the desired throughputfor real-time software services. In order to achieve a higher throughput there is aneed for a solution which can execute multiple consensus rounds concurrently. We present a solution that enables multiple consensus rounds in parallel bychoosing multiple leaders. By enabling concurrent consensus, our approach canexecute several requests in parallel. In our approach we incorporate applicationspecific knowledge to split the total order of events into multiple partial orderswhich are causally consistent in order to ensure safety. Furthermore, a dependencycheck is required for every client request before it is assigned to a particular leaderfor agreement. This methodology relies on optimistic prediction of dependenciesto provide higher throughput. We also propose a solution to correct the course ofexecution without rollbacking if dependencies were wrongly predicted. Our evaluation shows that in normal cases this approach can achieve upto 100% higher throughput than conventional approaches for large numbers ofclients. We also show that this approach has the potential to perform better incomplex scenarios
Styles APA, Harvard, Vancouver, ISO, etc.
7

FARINA, GIOVANNI. « Tractable reliable communication in compromised networks ». Doctoral thesis, 2020. http://hdl.handle.net/11573/1479204.

Texte intégral
Résumé :
Reliable communication is a fundamental primitive in distributed systems prone to Byzantine (i.e. arbitrary, and possibly malicious) failures to guarantee the integrity, delivery, and authorship of the messages exchanged between processes. Its practical adoption strongly depends on the system assumptions. Several solutions have been proposed so far in the literature implementing such a primitive, but some lack in scalability and/or demand topological network conditions computationally hard to be verified. This thesis aims to investigate and address some of the open problems and challenges implementing such a communication primitive. Specifically, we analyze how a reliable communication primitive can be implemented in 1) a static distributed system where a subset of processes is compromised, 2) a dynamic distributed system where part of the processes is Byzantine faulty, and 3) a static distributed system where every process can be compromised and recover. We define several more efficient protocols and we characterize alternative network conditions guaranteeing their correctness.
Styles APA, Harvard, Vancouver, ISO, etc.

Livres sur le sujet "Byzantine failure"

1

Lenski, Noel Emmanuel. Failure of empire : Valens and the Roman state in the fourth century A.D. Berkeley : University of California Press, 2002.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Failure of empire : Valens and the Roman state in the fourth century A.D. Berkeley : University of California Press, 2002.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Lenski, Noel. Failure of Empire : Valens and the Roman State in the Fourth Century A.D. University of California Press, 2014.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Lenski, Noel. Failure of Empire : Valens and the Roman State in the Fourth Century A.D. University of California Press, 2003.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Lenski, Noel. Failure of Empire : Valens and the Roman State in the Fourth Century A. D. University of California Press, 2003.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Chapitres de livres sur le sujet "Byzantine failure"

1

Doudou, Assia, Benoît Garbinato et Rachid Guerraoui. « Encapsulating Failure Detection : From Crash to Byzantine Failures ». Dans Lecture Notes in Computer Science, 24–50. Berlin, Heidelberg : Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-48046-3_3.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Bazzi, Rida A., et Maurice Herlihy. « Enhanced Fault-Tolerance through Byzantine Failure Detection ». Dans Lecture Notes in Computer Science, 129–43. Berlin, Heidelberg : Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10877-8_12.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Gupta, Anuj, Prasant Gopal, Piyush Bansal et Kannan Srinathan. « Authenticated Byzantine Generals in Dual Failure Model ». Dans Distributed Computing and Networking, 79–91. Berlin, Heidelberg : Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11322-2_12.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Le Brun, Matthew Alan, et Ornela Dardha. « MAG$$\pi $$ : Types for Failure-Prone Communication ». Dans Programming Languages and Systems, 363–91. Cham : Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30044-8_14.

Texte intégral
Résumé :
AbstractMultiparty Session Types (MPST) are a typing discipline for communication-centric systems, guaranteeing communication safety, deadlock freedom and protocol compliance. Several works have emerged which model failures and introduce fault-tolerance techniques. However, such works often make assumptions on the underlying network, e.g., assuming TCP-based communication where messages are guaranteed to be delivered; or adopting centralised reliable nodes and ad-hoc notions of reliability; or only addressing a single kind of failure, such as node crashes. In this work, we develop MAG$$\pi $$ π —a Multiparty, Asynchronous and Generalised $$\pi $$ π -calculus, which is the first language and type system to accommodate in unison: (i) the widest range of non-Byzantine faults, including message loss, delays and reordering; crash and link failures; and network partitioning; (ii) a novel and most general notion of reliability, taking into account the viewpoint of each participant in the protocol; (iii) a spectrum of network assumptions from the lowest UDP-based network programming to the TCP-based application level. We prove subject reduction and session fidelity; process properties (deadlock freedom, termination, etc.); failure-handling safety and reliability adherence.
Styles APA, Harvard, Vancouver, ISO, etc.
5

Dolev, Shlomi, Chryssis Georgiou, Ioannis Marcoullis et Elad M. Schiller. « Self-stabilizing Byzantine Tolerant Replicated State Machine Based on Failure Detectors ». Dans Lecture Notes in Computer Science, 84–100. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94147-9_7.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Altmann, Bernd, Matthias Fitzi et Ueli Maurer. « Byzantine Agreement Secure against General Adversaries in the Dual Failure Model ». Dans Lecture Notes in Computer Science, 123–39. Berlin, Heidelberg : Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48169-9_9.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Raynal, Michel. « Consensus Despite Byzantine Failures ». Dans Fault-tolerant Agreement in Synchronous Message-passing Systems, 125–41. Cham : Springer International Publishing, 2010. http://dx.doi.org/10.1007/978-3-031-02001-8_8.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Imbs, Damien, Michel Raynal et Julien Stainer. « Are Byzantine Failures Really Different from Crash Failures ? » Dans Lecture Notes in Computer Science, 215–29. Berlin, Heidelberg : Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-53426-7_16.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Hamada, Yukihiro, Aohan Mei, Feng Bao et Yoshihide Igarashi. « Broadcasting in star graphs with Byzantine failures ». Dans Concurrency and Parallelism, Programming, Networking, and Security, 162–71. Berlin, Heidelberg : Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0027789.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Okun, Michael, et Amnon Barak. « Renaming in Message Passing Systems with Byzantine Failures ». Dans Lecture Notes in Computer Science, 16–30. Berlin, Heidelberg : Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11864219_2.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Byzantine failure"

1

Dalmas, Marcelo, Higor Rachadel, Gustavo Silvano et Carlos Dutra. « Improving PTP robustness to the byzantine failure ». Dans 2015 IEEE International Symposium on Precision Clock Synchronization for Measurement, Control, and Communication (ISPCS). IEEE, 2015. http://dx.doi.org/10.1109/ispcs.2015.7324693.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Sota, Norihiro, et Hiroaki Higaki. « Byzantine failure detection in wireless ad-hoc networks ». Dans 2015 36th IEEE Sarnoff Symposium. IEEE, 2015. http://dx.doi.org/10.1109/sarnof.2015.7324664.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Greve, F., M. S. de Lima, L. Arantes et P. Sens. « A Time-Free Byzantine Failure Detector for Dynamic Networks ». Dans 2012 Ninth European Dependable Computing Conference (EDCC). IEEE, 2012. http://dx.doi.org/10.1109/edcc.2012.28.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Zhang, Mingyue, Zhi Jin, Jian Hou et Renwei Luo. « Resilient Mechanism Against Byzantine Failure for Distributed Deep Reinforcement Learning ». Dans 2022 IEEE 33rd International Symposium on Software Reliability Engineering (ISSRE). IEEE, 2022. http://dx.doi.org/10.1109/issre55969.2022.00044.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Stanev, Kamen. « THE FIFTH SLAVIC SIEGE OF THESSALONIKI ». Dans THE PATH OF CYRIL AND METHODIUS – SPATIAL AND CULTURAL HISTORICAL DIMENSIONS. Cyrillo-Methodian Research Centre – Bulgarian Academy of Sciences, 2023. http://dx.doi.org/10.59076/2815-3855.2023.33.16.

Texte intégral
Résumé :
The fifth Slavic siege of Thessaloniki took place in 676 – 678 and it shows that the relationship between the Slavic tribes and Byzantium, as well as between the Slavic tribes themselves, is much more complex than is traditionally presented in the historiography. The hostile actions of the slavs against the city can be divided into two periods. In the first stage participated the Rhynchines, Strymonites and Sagudates. During this period, in Thessaloniki, as Byzantine allies, there was also a Slavic squad, without specifying which tribe it was from. The fact that the Dragovites, who lived west of the city during this period, are not among the tribes fighting with Thessaloniki shows that perhaps it is from them the slavs in question, allies of the Byzanatines.This is also the reason why the first two years there is no real siege, only separate attacks on land and sea. At one point, the Slavic squad, which was helping Thessaloniki, turned against the Byzantines. This is the moment when the Draguvites appear among the tribes invading the city and at the same time move to a classic siege using siege machines. After the failure of the siege, the Draguvites fell into some form of dependence on the empire, and over the next two centuries there was no evidence of hostilities between them and the Byzantines. In contrast, the Strymonites and Rhynchines continued their raids for another decade.
Styles APA, Harvard, Vancouver, ISO, etc.
6

de Lima, Murilo Santos, Fabiola Greve, Luciana Arantes et Pierre Sens. « The time-free approach to Byzantine failure detection in dynamic networks ». Dans 2011 IEEE/IFIP 41st International Conference on Dependable Systems and Networks Workshops (DSN-W). IEEE, 2011. http://dx.doi.org/10.1109/dsnw.2011.5958855.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Sota, Norihiro, et Hiroaki Higaki. « Ad-Hoc routing and data transmission protocol with Byzantine failure detection and isolation ». Dans 2015 International Conference on Advanced Technologies for Communications (ATC). IEEE, 2015. http://dx.doi.org/10.1109/atc.2015.7388322.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Rjazanovs, Dmitrijs, Ernests Petersons, Aleksandrs Ipatovs, Loreta Juskaite et Roman Yeryomin. « Byzantine Failures and Vehicular Networks ». Dans 2021 IEEE Microwave Theory and Techniques in Wireless Communications (MTTW). IEEE, 2021. http://dx.doi.org/10.1109/mttw53539.2021.9607266.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Guerraoui, Rachid, Florian Huc et Anne-Marie Kermarrec. « Highly dynamic distributed computing with byzantine failures ». Dans the 2013 ACM symposium. New York, New York, USA : ACM Press, 2013. http://dx.doi.org/10.1145/2484239.2484263.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Uehara, Minoru. « Evaluations of Stateful NMR with Byzantine Failures ». Dans 2011 International Conference on Broadband, Wireless Computing, Communication and Applications (BWCCA). IEEE, 2011. http://dx.doi.org/10.1109/bwcca.2011.48.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Rapports d'organisations sur le sujet "Byzantine failure"

1

Liang, Guanfeng, et Nitin Vaidya. Error-Free Multi-Valued Consensus with Byzantine Failures. Fort Belvoir, VA : Defense Technical Information Center, janvier 2011. http://dx.doi.org/10.21236/ada555083.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Vous pouvez également être intéressé par les bibliographies sur le sujet « Byzantine failure » pour d’autres types de sources :
Articles de revues
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie