Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Fundamentals of Computation Theory

FCT 1997: Fundamentals of Computation Theory pp 150–156Cite as

A note on broadcasting with linearly bounded transmission faults in constant degree networks

  • Technical Contributions
  • Conference paper
  • First Online:

  • 94 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1279))

Abstract

We consider the problem of broadcasting in the presence of linearly bounded number of transient faults. For some fixed 0 < α < 1 we assume that at most ai faulty transmissions can occur during the first i time units of the broadcasting algorithm execution, for every natural i. In a unit of time every node can communicate with at most one neighbor. We prove that some bounded degree networks are robust with respect to linearly bounded transmission faults for any 0 < α < 1, and give examples of such networks with logarithmic broadcast time, thus solving the open problem from [3].

Supported by the grant KBN 8T11C01208.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.A. Aslam and A. Dhagat, Searching in the presence of linearly bounded errors, Proc. of the 23rd Annual ACM Symposium on Theory of Computing (1991), 486–493.

    Google Scholar 

  2. B.S. Chlebus, K. Diks and A. Pelc, Broadcasting in synchronous networks with dynamic faults, Networks 27 (1996), 309–318.

    Article  Google Scholar 

  3. L. Gasieniec and A. Pelc, Broadcasting with linearly bounded transmission faults, Disc. Appl. Math., to appear.

    Google Scholar 

  4. A. Pelc, Fault-tolerant broadcasting and gossiping in communication networks, Networks 28 (1996), 143–156.

    Article  Google Scholar 

  5. A. Pelc, Searching with known error probability, Theoretical Computer Science 63 (1989), 185–202. *** DIRECT SUPPORT *** A0008123 00005

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instytut Informatyki, Uniwersytet Warszawski, Banacha 2, 02-097, Warszawa, Poland

    Krzysztof Ciebiera & Adam Malinowski

Authors
  1. Krzysztof Ciebiera
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Adam Malinowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bogdan S. Chlebus Ludwik Czaja

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ciebiera, K., Malinowski, A. (1997). A note on broadcasting with linearly bounded transmission faults in constant degree networks. In: Chlebus, B.S., Czaja, L. (eds) Fundamentals of Computation Theory. FCT 1997. Lecture Notes in Computer Science, vol 1279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036179

Download citation

  • DOI: https://doi.org/10.1007/BFb0036179

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63386-0

  • Online ISBN: 978-3-540-69529-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation