Filters








7,021 Hits in 6.7 sec

Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits [article]

Damien Imbs, Matthieu Perrin, Michel Raynal
2017 arXiv   pre-print
This paper introduces a new communication abstraction, called Set-Constrained Delivery Broadcast (SCD-broadcast), whose aim is to provide its users with an appropriate abstraction level when they have  ...  After having presented an algorithm implementing SCD-broadcast, the paper investigates its programming power and its computability limits.  ...  ANR project 16-CE40-0023-03 DESCARTES (devoted to layered and modular structures in distributed computing).  ... 
arXiv:1706.05267v1 fatcat:h2fexyzcenbb7ovtlvun77adv4

Set-Constrained Delivery Broadcast

Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal
2018 Proceedings of the 19th International Conference on Distributed Computing and Networking - ICDCN '18  
This paper introduces a new communication abstraction, called Set-Constrained Delivery Broadcast (SCD-broadcast) , whose aim is to provide its users with an appropriate abstraction level when they have  ...  After having presented an algorithm implementing SCD-broadcast, the paper investigates its programming power and its computability limits.  ...  ANR project 16-CE40-0023-03 DESCARTES (devoted to layered and modular structures in distributed computing).  ... 
doi:10.1145/3154273.3154296 dblp:conf/icdcn/ImbsMPR18 fatcat:6z3pafgne5hr3m6pabdi4qehsm

Byzantine-Tolerant Set-Constrained Delivery Broadcast

Alex Auvolat, Michel Raynal, François Taïani, Michael Wagner
2020 International Conference on Principles of Distributed Systems  
Set-Constrained Delivery Broadcast (SCD-broadcast) , recently introduced at ICDCN 2018, is a high-level communication abstraction that captures ordering properties not between individual messages but between  ...  ACM Subject Classification Theory of computation → Distributed algorithms; Software and its engineering → Abstraction, modeling and modularity  ...  The computability and messages/time complexities of this algorithm are the ones of the underlying Byzantine reliable broadcast algorithm. 6:20 Byzantine-Tolerant Set-Constrained Delivery Broadcast  ... 
doi:10.4230/lipics.opodis.2019.6 dblp:conf/opodis/AuvolatRT19 fatcat:kvcrta7tafgo5fjavryj7miphy

Scalable Byzantine Reliable Broadcast (Extended Version) [article]

Rachid Guerraoui and Petr Kuznetsov and Matteo Monti and Matej Pavlovic and Dragos-Adrian Seredinschi and Yann Vonlanthen
2020 arXiv   pre-print
Existing broadcast protocols for this setting scale poorly, as they typically build on quorum systems with strong intersection guarantees, which results in linear per-process communication and computation  ...  We obtain the first Byzantine reliable broadcast protocol with logarithmic per-process communication and computation complexity.  ...  We note that Definition 7 is well defined: indeed, both A pcb and A cob are finite sets, and therefore admit a maximum for the adversarial power. Definition 8 (Optimal set of adversaries).  ... 
arXiv:1908.01738v2 fatcat:tew2gp5odbgdrolwzzijs3avie

Self-stabilizing Uniform Reliable Broadcast [article]

Oskar Lundström and Michel Raynal and Elad M. Schiller
2020 arXiv   pre-print
We study a well-known communication abstraction called Uniform Reliable Broadcast (URB).  ...  deliveries.  ...  We simply need to study one problem at a time (and its non-self-stabilizing state-of-the-art) until we have an algorithmic toolkit that is sufficiently generic.  ... 
arXiv:2001.03244v1 fatcat:zafvw2usdrhyhg3nzemaojseyi

Fault-tolerant broadcast in anonymous systems

Ernesto Jiménez, Sergio Arévalo, Jian Tang
2015 Journal of Supercomputing  
In this paper we study the definition and implementability of the fault-tolerant broadcast service in anonymous asynchronous systems, that is, in asynchronous systems where all processes have the same  ...  A basic broadcast service does not impose any delivery guarantee in a system with failures.  ...  Introduction One of the most important communication abstractions for distributed systems is the broadcast service. This abstraction sends a message to all the processes of the system.  ... 
doi:10.1007/s11227-015-1512-y fatcat:52ukyafgyvbqxetpf6tpthxruu

A Local Broadcast Layer for the SINR Network Model

Magnus M. Halldórsson, Stephan Holzer, Nancy Lynch
2015 Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing - PODC '15  
We give an efficient algorithm to implement the modified specification, and use it to derive efficient algorithms for higher-level problems of global broadcast and consensus.  ...  This work demonstrates that one can develop efficient algorithms for solving high-level problems in the SINR model, using graph-based algorithms over a local broadcast abstraction layer that hides the  ...  Acknowledgments: We thank Sebastian Daum, Mohsen Ghaffari, Fabian Kuhn and Calvin Newport for answering questions concerning their earlier work and helpful discussions.  ... 
doi:10.1145/2767386.2767432 dblp:conf/podc/HalldorssonHL15 fatcat:ymqcflj55fanvoqixwf5bnt7ie

Total order broadcast and multicast algorithms

Xavier Défago, André Schiper, Péter Urbán
2004 ACM Computing Surveys  
Total order broadcast and multicast (also called atomic broadcast/multicast) present an important problem in distributed systems, especially with respect to fault-tolerance.  ...  This article proposes a classification of total order broadcast and multicast algorithms based on their ordering mechanisms, and addresses a number of other important issues.  ...  Schlichting, Tatsuhiro Tsuchiya, and Matthias Wiesmann, as well as Fred B. Schneider, and the anonymous reviewers. We are also thankful to Judith Steeh for proofreading this text.  ... 
doi:10.1145/1041680.1041682 fatcat:hl2evvvb2zfrlhzzcrnyctdcfe

Broadcasting with Least Redundancy in Wireless Sensor Networks

Ruiqin Zhao, Xiaohong Shen, Zhe Jiang, Haiyan Wang
2012 International Journal of Distributed Sensor Networks  
Due to the limited energy supply of each sensor node, it has become a crucial issue to minimize energy consumption and maximize the network lifetime in the design of broadcast protocols.  ...  By identifying the optimized number of induced forwarders as 2, BALR establishes a weighted sum model, taking both rebroadcast efficiency and residual energy into consideration, as a new metric to compute  ...  An efficient broadcast strategy should be able to effectively reduce the broadcast redundancy, for both energy and bandwidth efficiency, especially in a band and power limited sensor networks.  ... 
doi:10.1155/2012/957606 fatcat:dl62juvgd5aqvddqviayc3eg4q

Wired wireless broadcast emulation

D. Havey, R. Chertov, K. Almeroth
2009 2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks  
We use the same experimental methodology to explore the implications of various assumptions and simplifications that are commonly made in traffic modeling.  ...  We propose a representation of wireless workload patterns as large, sparse matrices and provide a method for stochastically generating experimental workloads from a given matrix.  ...  Our simulations resemble multi-hop mesh networks of the kind that are increasingly studied and deployed for delivery of broadband access in residential, corporate and conference settings.  ... 
doi:10.1109/wiopt.2009.5291574 dblp:conf/wiopt/HaveyCA09 fatcat:fobkrnuaobdl7ndccztkm3dcze

A Local Broadcast Layer for the SINR Network Model [article]

Magnus M. Halldorsson, Stephan Holzer, Nancy Lynch
2015 arXiv   pre-print
We give an efficient algorithm to implement the modified specification, and use it to derive efficient algorithms for higher-level problems of global broadcast and consensus.  ...  broadcast in that model.  ...  Acknowledgments: We thank Sebastian Daum, Mohsen Ghaffari, Fabian Kuhn and Calvin Newport for answering questions concerning their earlier work and helpful discussions.  ... 
arXiv:1505.04514v1 fatcat:j6cerborlzfgjk5xmdofchaesa

RT-ByzCast: Byzantine-Resilient Real-Time Reliable Broadcast

David Kozhaya, Jeremie Decouchant, Paulo Esteves-Verissimo
2019 IEEE transactions on computers  
We first prove that it is impossible to implement RTBRB using traditional distributed computing paradigms, e.g., where the error/failure detection mechanisms of processes are decoupled from the broadcast  ...  algorithm itself, even with the help of the most powerful failure detectors.  ...  The GE model, for instance, has been used to model losses in wireless media IEEE 802.11 [10], wired power line networks [11] and other hybrid networks [12], [13].  ... 
doi:10.1109/tc.2018.2871443 fatcat:g2hfxqkn7jgwvfi3nnovitari4

RT-ByzCast: Byzantine-Resilient Real-Time Reliable Broadcast [article]

David Kozhaya and Jérémie Decouchant and Paulo Esteves-Verissimo
2018 arXiv   pre-print
We first prove that it is impossible to implement RTBRB using traditional distributed computing paradigms, e.g., where the error/failure detection mechanisms of processes are decoupled from the broadcast  ...  algorithm itself, even with the help of the most powerful failure detectors.  ...  For simplicity, we provide the definition of RTBRB as an abstraction that allows at most one message to be delivered/broadcast.  ... 
arXiv:1807.01226v1 fatcat:j6kws4jy5ndlhbm2wgi7bdj6pa

Reliable Broadcast in Practical Networks: Algorithm and Evaluation [article]

Yingjian Wu, Haochen Pan, Saptaparni Kumar, Lewis Tseng
2020 arXiv   pre-print
We also identify the fundamental trade-offs of Byzantine Reliable Broadcast protocols with respect to resilience (number of nodes), local computation, round complexity, and bit complexity.  ...  In particular, we use cryptographic hash functions and erasure coding to reduce communication and computation complexity and simplify the protocol design.  ...  Any opinions, findings, and conclusions or recommendations expressed here are those of the authors and do not necessarily reflect the views of the funding agencies or the U.S. government.  ... 
arXiv:2007.14990v1 fatcat:ejxfn2nuvnghrndqi2ihu3z62q

Theorising African communications: The bad news signalled by broadcast digital migration policy

Guy Berger
2012 Communicatio  
Abstract: Broadcasting digital migration (BDM) in Africa reflects deadlines agreed by the continent at the International Telecommunications Union (ITU).  ...  Also missed is the value of democratic and interactive communications, meaning that the BDM Set Top Boxes (STBs) are seen merely as decoders of one-way content flows.  ...  Introduction and Definitions The notion of an "African theory of communications" suggests a distinctive body of abstract propositions about a particular dimension of human activity (in this case, communication  ... 
doi:10.1080/02500167.2012.717344 fatcat:z5mrnn64hrddtfs6kxtar756xu
« Previous Showing results 1 — 15 out of 7,021 results