Gotowa bibliografia na temat „Byzantine failure”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Byzantine failure”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Byzantine failure"
Raynal, Michel. "On the Versatility of Bracha’s Byzantine Reliable Broadcast Algorithm". Parallel Processing Letters 31, nr 03 (27.05.2021): 2150006. http://dx.doi.org/10.1142/s0129626421500067.
Pełny tekst źródłaABORISADE, D. O., A. S. SODIYA, A. A. ODUMOSU, O. Y. ALOWOSILE i A. A. ADEDEJI. "A SURVIVABLE DISTRIBUTED DATABASE AGAINST BYZANTINE FAILURE". Journal of Natural Sciences Engineering and Technology 15, nr 2 (22.11.2017): 61–72. http://dx.doi.org/10.51406/jnset.v15i2.1684.
Pełny tekst źródłaPAQUETTE, MICHEL, i ANDRZEJ PELC. "FAST BROADCASTING WITH BYZANTINE FAULTS". International Journal of Foundations of Computer Science 17, nr 06 (grudzień 2006): 1423–39. http://dx.doi.org/10.1142/s0129054106004492.
Pełny tekst źródłaWang, Shu-Ching, i Kuo-Qin Yan. "Byzantine Agreement under dual failure mobile network". Computer Standards & Interfaces 28, nr 4 (kwiecień 2006): 475–92. http://dx.doi.org/10.1016/j.csi.2005.03.004.
Pełny tekst źródłaFRIEDMAN, ROY, ACHOUR MOSTEFAOUI i MICHEL RAYNAL. "$\diamondsuit {\mathcal P}_{mute}$-BASED CONSENSUS for ASYNCHRONOUS BYZANTINE SYSTEMS". Parallel Processing Letters 15, nr 01n02 (marzec 2005): 169–82. http://dx.doi.org/10.1142/s0129626405002131.
Pełny tekst źródłaPorada, Aleksandra. "Kardynał Bessarion i jego księgozbiór". Bibliotekarz Podlaski Ogólnopolskie Naukowe Pismo Bibliotekoznawcze i Bibliologiczne 60, nr 3 (21.12.2023): 297–324. http://dx.doi.org/10.36770/bp.834.
Pełny tekst źródłaBetancourt, Roland. "Faltering images: failure and error in Byzantine manuscript illumination". Word & Image 32, nr 1 (2.01.2016): 1–20. http://dx.doi.org/10.1080/02666286.2016.1143766.
Pełny tekst źródłaMaurer, Alexandre, i Sebastien Tixeuil. "Tolerating Random Byzantine Failures in an Unbounded Network". Parallel Processing Letters 26, nr 01 (marzec 2016): 1650003. http://dx.doi.org/10.1142/s0129626416500031.
Pełny tekst źródłaKaravites, Peter. "Gregory Nazianzinos and Byzantine hymnography". Journal of Hellenic Studies 113 (listopad 1993): 81–98. http://dx.doi.org/10.2307/632399.
Pełny tekst źródłaHonoré, Wolf, Longfei Qiu, Yoonseung Kim, Ji-Yong Shin, Jieung Kim i Zhong Shao. "AdoB: Bridging Benign and Byzantine Consensus with Atomic Distributed Objects". Proceedings of the ACM on Programming Languages 8, OOPSLA1 (29.04.2024): 419–48. http://dx.doi.org/10.1145/3649826.
Pełny tekst źródłaRozprawy doktorskie na temat "Byzantine failure"
Del, Pozzo Antonella. "Building distributed computing abstractions in the presence of mobile byzantine failures". Thesis, Paris 6, 2017. http://www.theses.fr/2017PA066159/document.
Pełny tekst źródłaIn 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
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.
Pełny tekst źródłaIn 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
Farina, Giovanni. "Tractable Reliable Communication in Compromised Networks". Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS310.
Pełny tekst źródłaReliable 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
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.
Pełny tekst źródłaAs 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
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.
Pełny tekst źródłaAs 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
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.
Pełny tekst źródłaFARINA, GIOVANNI. "Tractable reliable communication in compromised networks". Doctoral thesis, 2020. http://hdl.handle.net/11573/1479204.
Pełny tekst źródłaKsiążki na temat "Byzantine failure"
Lenski, Noel Emmanuel. Failure of empire: Valens and the Roman state in the fourth century A.D. Berkeley: University of California Press, 2002.
Znajdź pełny tekst źródłaFailure of empire: Valens and the Roman state in the fourth century A.D. Berkeley: University of California Press, 2002.
Znajdź pełny tekst źródłaLenski, Noel. Failure of Empire: Valens and the Roman State in the Fourth Century A.D. University of California Press, 2014.
Znajdź pełny tekst źródłaLenski, Noel. Failure of Empire: Valens and the Roman State in the Fourth Century A.D. University of California Press, 2003.
Znajdź pełny tekst źródłaLenski, Noel. Failure of Empire: Valens and the Roman State in the Fourth Century A. D. University of California Press, 2003.
Znajdź pełny tekst źródłaCzęści książek na temat "Byzantine failure"
Doudou, Assia, Benoît Garbinato i Rachid Guerraoui. "Encapsulating Failure Detection: From Crash to Byzantine Failures". W Lecture Notes in Computer Science, 24–50. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-48046-3_3.
Pełny tekst źródłaBazzi, Rida A., i Maurice Herlihy. "Enhanced Fault-Tolerance through Byzantine Failure Detection". W 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.
Pełny tekst źródłaGupta, Anuj, Prasant Gopal, Piyush Bansal i Kannan Srinathan. "Authenticated Byzantine Generals in Dual Failure Model". W Distributed Computing and Networking, 79–91. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11322-2_12.
Pełny tekst źródłaLe Brun, Matthew Alan, i Ornela Dardha. "MAG$$\pi $$: Types for Failure-Prone Communication". W Programming Languages and Systems, 363–91. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30044-8_14.
Pełny tekst źródłaDolev, Shlomi, Chryssis Georgiou, Ioannis Marcoullis i Elad M. Schiller. "Self-stabilizing Byzantine Tolerant Replicated State Machine Based on Failure Detectors". W Lecture Notes in Computer Science, 84–100. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94147-9_7.
Pełny tekst źródłaAltmann, Bernd, Matthias Fitzi i Ueli Maurer. "Byzantine Agreement Secure against General Adversaries in the Dual Failure Model". W Lecture Notes in Computer Science, 123–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48169-9_9.
Pełny tekst źródłaRaynal, Michel. "Consensus Despite Byzantine Failures". W 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.
Pełny tekst źródłaImbs, Damien, Michel Raynal i Julien Stainer. "Are Byzantine Failures Really Different from Crash Failures?" W 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.
Pełny tekst źródłaHamada, Yukihiro, Aohan Mei, Feng Bao i Yoshihide Igarashi. "Broadcasting in star graphs with Byzantine failures". W Concurrency and Parallelism, Programming, Networking, and Security, 162–71. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0027789.
Pełny tekst źródłaOkun, Michael, i Amnon Barak. "Renaming in Message Passing Systems with Byzantine Failures". W Lecture Notes in Computer Science, 16–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11864219_2.
Pełny tekst źródłaStreszczenia konferencji na temat "Byzantine failure"
Dalmas, Marcelo, Higor Rachadel, Gustavo Silvano i Carlos Dutra. "Improving PTP robustness to the byzantine failure". W 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.
Pełny tekst źródłaSota, Norihiro, i Hiroaki Higaki. "Byzantine failure detection in wireless ad-hoc networks". W 2015 36th IEEE Sarnoff Symposium. IEEE, 2015. http://dx.doi.org/10.1109/sarnof.2015.7324664.
Pełny tekst źródłaGreve, F., M. S. de Lima, L. Arantes i P. Sens. "A Time-Free Byzantine Failure Detector for Dynamic Networks". W 2012 Ninth European Dependable Computing Conference (EDCC). IEEE, 2012. http://dx.doi.org/10.1109/edcc.2012.28.
Pełny tekst źródłaZhang, Mingyue, Zhi Jin, Jian Hou i Renwei Luo. "Resilient Mechanism Against Byzantine Failure for Distributed Deep Reinforcement Learning". W 2022 IEEE 33rd International Symposium on Software Reliability Engineering (ISSRE). IEEE, 2022. http://dx.doi.org/10.1109/issre55969.2022.00044.
Pełny tekst źródłaStanev, Kamen. "THE FIFTH SLAVIC SIEGE OF THESSALONIKI". W 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.
Pełny tekst źródłade Lima, Murilo Santos, Fabiola Greve, Luciana Arantes i Pierre Sens. "The time-free approach to Byzantine failure detection in dynamic networks". W 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.
Pełny tekst źródłaSota, Norihiro, i Hiroaki Higaki. "Ad-Hoc routing and data transmission protocol with Byzantine failure detection and isolation". W 2015 International Conference on Advanced Technologies for Communications (ATC). IEEE, 2015. http://dx.doi.org/10.1109/atc.2015.7388322.
Pełny tekst źródłaRjazanovs, Dmitrijs, Ernests Petersons, Aleksandrs Ipatovs, Loreta Juskaite i Roman Yeryomin. "Byzantine Failures and Vehicular Networks". W 2021 IEEE Microwave Theory and Techniques in Wireless Communications (MTTW). IEEE, 2021. http://dx.doi.org/10.1109/mttw53539.2021.9607266.
Pełny tekst źródłaGuerraoui, Rachid, Florian Huc i Anne-Marie Kermarrec. "Highly dynamic distributed computing with byzantine failures". W the 2013 ACM symposium. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2484239.2484263.
Pełny tekst źródłaUehara, Minoru. "Evaluations of Stateful NMR with Byzantine Failures". W 2011 International Conference on Broadband, Wireless Computing, Communication and Applications (BWCCA). IEEE, 2011. http://dx.doi.org/10.1109/bwcca.2011.48.
Pełny tekst źródłaRaporty organizacyjne na temat "Byzantine failure"
Liang, Guanfeng, i Nitin Vaidya. Error-Free Multi-Valued Consensus with Byzantine Failures. Fort Belvoir, VA: Defense Technical Information Center, styczeń 2011. http://dx.doi.org/10.21236/ada555083.
Pełny tekst źródła