Elsevier

Journal of Algorithms

Volume 22, Issue 2, February 1997, Pages 199-211
Journal of Algorithms

Regular Article
Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures

https://doi.org/10.1006/jagm.1996.0810Get rights and content

Abstract

Broadcasting is a process of transmitting a message held in one node of a communication network to all other nodes. Links of the network are subject to randomly and independently distributed faults with probability0<q<12; faults are permanent and Byzantine, while all nodes are fault-free. In a unit of time, each node can communicate with at most one other node. We present a broadcasting algorithm which works fornnodes in timeO(log n) with probability of correctness exceeding 1  1/n, for sufficiently largen.

References (19)

  • D. Bienstock

    Broadcasting with random faults

    Discrete Appl. Math.

    (1988)
  • T. Hagerup et al.

    A guided tour of Chernoff bounds

    Inform. Process. Lett.

    (1990)
  • E.R. Scheinerman et al.

    Optimal and near-optimal broadcast in random graphs

    Discrete Appl. Math.

    (1989)
  • S. Assaf et al.

    Fault-tolerant sorting networks

    SIAM J. Discrete Math.

    (1991)
  • K.A. Berman et al.

    Telephone problems with failures

    SIAM J. Algebra Discrete Methods

    (1986)
  • P. Berman, A. Pelc, 1992, Efficient Broadcasting and Gossiping with Byzantine Link Failures, Université du Québec à...
  • D.M. Blough et al.

    Optimal communication in networks with randomly distributed Byzantine faults

    Networks

    (1993)
  • B. S. Chlebus, K. Diks, A. Pelc, Sparse networks supporting efficient reliable broadcasting, Proceedings ICALP-93,...
  • B.S. Chlebus et al.

    Optimal broadcasting in faulty hypercubes

    Digest of Papers, FTCS-21

    (1991)
There are more references available in the full text version of this article.

Cited by (23)

  • On fractional dynamic faults with thresholds

    2008, Theoretical Computer Science
  • Broadcasting with locally bounded Byzantine faults

    2005, Information Processing Letters
  • Packet Routing in Fixed-Connection Networks: A Survey

    1998, Journal of Parallel and Distributed Computing
  • Fast broadcasting with byzantine faults

    2006, International Journal of Foundations of Computer Science
View all citing articles on Scopus
*

Partly supported by NSERC International Fellowship and Grant KBN 2-2043-92-03.

Partly supported by NSERC Grant OGP 0008136.

View full text