## 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. 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, is assumed. 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. It is shown 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 Θ1990 messages, where V is the set of processors in the network. It is proved 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 vertex knows the topology of the network in radius ρ ≥ 1 from itself, matching upper and lower bounds of Θ(min{↿E↾, ↿V↾^{1+Θ(l)/ρ}}) is proved on the number of messages of bounded length required for broadcast. Both the upper and 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.

Original language | English |
---|---|

Pages (from-to) | 238-256 |

Number of pages | 19 |

Journal | Journal of the ACM |

Volume | 37 |

Issue number | 2 |

DOIs | |

State | Published - 4 Jan 1990 |

Externally published | Yes |