Filters








3,363 Hits in 3.6 sec

Rapid almost-complete broadcasting in faulty networks

Rastislav Královič, Richard Královič
2009 Theoretical Computer Science  
This paper studies the problem of broadcasting in synchronous point-to-point networks, where one initiator owns a piece of information that has to be transmitted to all other vertices as fast as possible  ...  As the main result we show that in complete graphs and hypercubes it is possible to inform all but a constant number of vertices, exhibiting only a logarithmic slowdown, i.e. in time O(D log n) where D  ...  In general, the relationship between the almost complete and complete broadcast in various models is worth studying. We have also not considered non-constant values of α.  ... 
doi:10.1016/j.tcs.2008.12.023 fatcat:lokegbzslrglrou5q4p27n52tu

Rapid Almost-Complete Broadcasting in Faulty Networks [article]

Rastislav Královič, Richard Královič
2007 arXiv   pre-print
This paper studies the problem of broadcasting in synchronous point-to-point networks, where one initiator owns a piece of information that has to be transmitted to all other vertices as fast as possible  ...  As the main result we show that in complete graphs and hypercubes it is possible to inform all but a constant number of vertices, exhibiting only a logarithmic slowdown, i.e. in time O(D n) where D is  ...  Our main motivation to study almost complete broadcasts is the fact that in large faulty networks it is often vital to finish a communication task fast, even subject to some small error.  ... 
arXiv:cs/0703122v1 fatcat:x6do5bqmmbfpllmntjcpxadihm

Rapid Almost-Complete Broadcasting in Faulty Networks [chapter]

Rastislav Královič, Richard Královič
Structural Information and Communication Complexity  
This paper studies the problem of broadcasting in synchronous point-to-point networks, where one initiator owns a piece of information that has to be transmitted to all other vertices as fast as possible  ...  As the main result we show that in complete graphs and hypercubes it is possible to inform all but a constant number of vertices, exhibiting only a logarithmic slowdown, i.e. in time O(D log n) where D  ...  In general, the relationship between the almost complete and complete broadcast in various models is worth studying. We have also not considered non-constant values of α.  ... 
doi:10.1007/978-3-540-72951-8_20 dblp:conf/sirocco/KralovicK07 fatcat:3icvtfcmvfchrn2fd37izzg2te

Stable and Consistent Membership at Scale with Rapid [article]

Lalith Suresh, Dahlia Malkhi, Parikshit Gopalan, Ivan Porto Carreiro, Zeeshan Lokhandwala
2018 arXiv   pre-print
To complete the design, Rapid contains a leaderless consensus protocol that converts multi-process cut detections into a view-change decision.  ...  We present evidence that our strategy suffices to drive unanimous detection almost-everywhere, even when complex network conditions arise, such as one-way reachability problems, firewall misconfigurations  ...  Then we can recurse using the set F' = F \ T of faulty processes. In the end, we obtain almost everywhere Detection of all processes in F.  ... 
arXiv:1803.03620v1 fatcat:upeuvymggjdypexjvmznyzt4lq

Experimental performance comparison of Byzantine Fault-Tolerant protocols for data centers

Guanfeng Liang, Benjamin Sommer, Nitin Vaidya
2012 2012 Proceedings IEEE INFOCOM  
[1]; (2) Digest: A simplified version of the seminal practical BFT protocol PBFT by Castro and Liskov [2]; and (3) NCBA: a network coding based BFT protocol that we propose in this paper.  ...  To the best of our knowledge, this is the first implementation of BFT with network coding.  ...  ACKNOWLEDGMENT This research is supported in part by Army Research Office grant W-911-NF-0710287 and National Science Foundation award 1059540.  ... 
doi:10.1109/infcom.2012.6195507 dblp:conf/infocom/LiangSV12 fatcat:d6vqqogidbbo7dk7ybvgbaygj4

Hybrid Fault-Tolerant Consensus in Asynchronous and Wireless Embedded Systems

Wenbo Xu, Signe Rüsch, Bijun Li, Rüdiger Kapitza, Michael Wagner
2018 International Conference on Principles of Distributed Systems  
Based on this model, we propose a randomized binary consensus algorithm that executes in complete asynchrony, rather than in partial synchrony required by deterministic algorithms.  ...  Byzantine fault-tolerant (BFT) consensus in an asynchronous system can only tolerate up to n−1 3 faulty processes in a group of n processes.  ...  Especially with the rapid growth of wireless embedded devices in recent years, systems tend to work cooperatively to achieve a common goal [16, 11, 14] .  ... 
doi:10.4230/lipics.opodis.2018.15 dblp:conf/opodis/XuRLK18 fatcat:adkfm37hqbhvvosr5x5equ4atq

A Fault-Tolerant Protocol for Energy-Efficient Permutation Routing in Wireless Networks

A. Datta
2005 IEEE transactions on computers  
Hence, any protocol designed for a WN should work well even when some of the stations are faulty. The permutation routing problem is an abstraction of many routing problems in a wireless network.  ...  Wireless sensor networks have received increasing interest in recent years due to their usage in monitoring and data collection in a wide variety of environments like remote geographic locations, industrial  ...  Each station knows the slot when to broadcast its ID and the faulty stations do not broadcast.  ... 
doi:10.1109/tc.2005.172 fatcat:s4ru4dyulnddjg5cg6im77kbfa

Adaptive Neuro-Fuzzy Inference System Based On-Demand Fault Tolerant Routing Protocol (ANFIS-ODFTR) for MANETs

Suneel Kumar Duvvuri, S. Ramakrishna
2021 International Journal of Computer Networks And Applications  
The research challenge of designing the effective fault tolerant routing protocol for MANET is addressed in this study.  ...  Thereby the performance of the network diminished drastically. Devising an efficient on-demand routing protocol with fault tolerance is a challenging task.  ...  The major challenge is to create a highly reliable routing system which can cope up with faulty nodes in the network.  ... 
doi:10.22247/ijcna/2021/210721 fatcat:qoqvooaiovh5vnczwwkc44ptmy

Efficient Randomized Byzantine Fault-Tolerant Replication Based on Special Valued Coin Tossing

Junya NAKAMURA, Tadashi ARARAGI, Shigeru MASUYAMA, Toshimitsu MASUZAWA
2014 IEICE transactions on information and systems  
in a network where replicas communicate with each other at high speed.  ...  Thus, even a faulty replica cannot send different values to different replicas in the broadcast.  ... 
doi:10.1587/transinf.e97.d.231 fatcat:aiylubijzzhkxcn4fyyafbzjiq

Overcoming Adversaries in Sensor Networks: A Survey of Theoretical Models and Algorithmic Approaches for Tolerating Malicious Interference

Maxwell Young, Raouf Boutaba
2011 IEEE Communications Surveys and Tutorials  
Consequently, many of the standard cryptographic techniques for thwarting such attacks in the wired domain cannot be employed in sensor networks.  ...  In the presence of antagonistic interference, reliable communication in sensor networks becomes an extremely challenging problem that, in recent years, has attracted significant attention from the research  ...  Nodes, correct or faulty, cannot spoof other nodes in the network.  ... 
doi:10.1109/surv.2011.041311.00156 fatcat:n2dspej4vfck7krz5owzyda5wu

Fault Location, Isolation, and Service Restoration (FLISR) Technique using IEC 61850 GOOSE

Sounak Jasu
2019 International Journal for Research in Applied Science and Engineering Technology  
Distribution network's "self-healing" nature is getting interested in the industry.  ...  Also, the standardized automation system based on IEC 61850 is increasing in the market.  ...  It can be seen from the figure that with the rapid FLISR action (within one minute), the total outage time can be reduced almost. 3-4 hours per outage.  ... 
doi:10.22214/ijraset.2019.4076 fatcat:tlryk4pfy5hnhmkygwloyjmt2q

Strategies for Digital Television: DTT in Italy

Nicola Matteucci
2010 JMM - The International Journal on Media Management  
Italian broadcasting has long been terrestrial.  ...  Its main shortcomings (spectrum chaos, nonenforcement of the law and market concentration) were considered not conducive to a rapid and reliable diffusion of digital terrestrial television (DTT).  ...  FTA -mainly as a network operator.  ... 
doi:10.1080/14241277.2010.527315 fatcat:uvubbun3jjduzfeo4u2aunttgu

SoK: Understanding BFT Consensus in the Age of Blockchains [article]

Gang Wang
2021 IACR Cryptology ePrint Archive  
At the core of Dumbo-MVBA is an asynchronous provable dispersal broadcast (APDB) in which each input can be split and dispersed to every party and later recovered in an efficient way.  ...  Byzantine fault-tolerant (BFT) state machine replication (SMR) is regarded as an ideal candidate that can tolerate arbitrary faulty behaviors.  ...  The consensus component exchanges hash to complete the reliable broadcast and execute the subsequent steps.  ... 
dblp:journals/iacr/Wang21c fatcat:wggbkbi25fg43fieebp4qzlk3m

The Honey Badger of BFT Protocols

Andrew Miller, Yu Xia, Kyle Croman, Elaine Shi, Dawn Song
2016 Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security - CCS'16  
We base our solution on a novel atomic broadcast protocol that achieves optimal asymptotic efficiency.  ...  liveness when the network behaves as expected.  ...  This work was done in part while a subset of the authors were visiting the Simons Institute for the Theory of Computing, supported by the Simons Foundation and by the DIMACS/Simons Collaboration in Cryptography  ... 
doi:10.1145/2976749.2978399 dblp:conf/ccs/MillerXCSS16 fatcat:kk2amjhimjgo7fsqxhxao3zjfi

uDIREC

Ritesh Parikh, Valeria Bertacco
2013 Proceedings of the 46th Annual IEEE/ACM International Symposium on Microarchitecture - MICRO-46  
network-on-chip (NoC).  ...  Upon in-field transistor failures, uDIREC leverages a fine-resolution diagnosis mechanism to disable faulty components very sparingly.  ...  Also, both uDIREC and uDI-REC_nv show an almost similar probability of a completely connected network (overlapped lines in Figure 11 ).  ... 
doi:10.1145/2540708.2540722 dblp:conf/micro/ParikhB13 fatcat:wxwh6oqx7ra3pbc25ui36uby44
« Previous Showing results 1 — 15 out of 3,363 results