Skip to main content

A tradeoff between information and communication in broadcast protocols

  • Distributed Computing
  • Conference paper
  • First Online:
VLSI Algorithms and Architectures (AWOC 1988)

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

Included in the following conference series:

Abstract

This paper concerns the message complexity of broadcast in arbitrary point-to-point communication networks. Broadcast is a task initiated by a single processor that wishes to convey a message to all processors in the network. We assume the widely accepted model of communication networks, in which each processor initially knows the identity of its neighbors, but does not know the entire network topology. Although it seems obvious that the number of messages required for broadcast in this model equals the number of links, no proof of this basic fact has been given before.

We show that the message complexity of broadcast depends on the exact complexity measure. If messages of unbounded length are counted at unit cost, then broadcast requires Θ(|V|) messages, where V is the set of processors in the network. We prove that if one counts messages of bounded length then broadcast requires Θ(|E|) messages, where E is the set of edges in the network.

Assuming an intermediate model in which each node knows the topology of the network in radius ρ ≥ 0 from itself, we prove tight upper and lower bounds of Θ(min{|E|, |V|1+Θ(1)/ρ}) on the number of messages of bounded length required for broadcast. Both the upper and the lower bounds hold for both synchronous and asynchronous network models.

The same results hold for the construction of spanning trees, and various other global tasks.

Partially supported by Air Force contract TNDGAFOSR-86-0078, ARO contract DAAL03-86-K-0171 and NSF contract CCR8611442.

Partially supported by the New York Metropolitan Research Fund.

Partially supported by ONR contract N00014-85-C-0731.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Awerbuch, “Complexity of Network Synchronization”, Jour. of ACM, Vol. 32, No. 4, 1985, pp. 804–823.

    Article  MATH  MathSciNet  Google Scholar 

  2. B. Awerbuch, O. Goldreich and R. Vainish, “On the Message Complexity of Broadcast: Basic Lower Bound”, Technical memo, MIT/LCS/TM-325, April 1987.

    Google Scholar 

  3. B. Bollobas, Extremal Graph Theory, Academic Press, 1978.

    Google Scholar 

  4. J.E. Burns, “A Formal Model for Message Passing Systems”, TR-91, Indiana University, (1980).

    Google Scholar 

  5. Y.K. Dalal and R. Metcalfe, “Reserve Path Forwarding of Broadcast Packets”, Comm. ACM, Vol. 21, No. 12, pp. 1040–1048, 1978.

    Article  MATH  Google Scholar 

  6. S. Even, Graph Algorithms, Computer Science Press, 1979.

    Google Scholar 

  7. G.R. Frederickson and N.A. Lynch, “The Impact of Synchronous Communication on the Problem of Electing a Leader in a Ring”, Proc. 16th ACM Symp. on Theory of Computing, 1984, pp. 493–503.

    Google Scholar 

  8. R.G. Gallager, P.A. Humblet and P.M. Spira, “A Distributed Algorithm for Minimum Weight Spanning Tree”, ACM Trans. on Program. Lang. and Systems, Vol. 5, 1983, pp. 66–77.

    Article  MATH  Google Scholar 

  9. R.L. Graham, B.L. Rothschild and J.H. Spencer, Ramsey Theory, John Wiley & Sons, 1980.

    Google Scholar 

  10. D. Peleg and A. Schäffer, Graph Spanners, Manuscript, Sept. 1987.

    Google Scholar 

  11. R. Reischuk and M. Koshors “Lower bound for Synchronous Systems and the Advantage of Local Information” Proc. 2nd International Workshop on Distributed Algorithms, Amsterdam, June 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

John H. Reif

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Awerbuch, B., Goldreich, O., Peleg, D., Vainish, R. (1988). A tradeoff between information and communication in broadcast protocols. In: Reif, J.H. (eds) VLSI Algorithms and Architectures. AWOC 1988. Lecture Notes in Computer Science, vol 319. Springer, New York, NY. https://doi.org/10.1007/BFb0040404

Download citation

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

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-96818-6

  • Online ISBN: 978-0-387-34770-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics