- 1、本文档共25页,可阅读全部内容。
- 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
A Tradeoff Between Information and Communication in Broadcast Protocols
A Tradeo Between Information andCommunication in Broadcast Protocols(Revised version)Baruch Awerbuch 1 Oded Goldreich 2 David Peleg 3 Ronen Vainish 2AbstractThis paper concerns the message complexity of broadcast in arbitrary point-to-point communication networks. Broadcast is a task initiated by a single processorthat wishes to convey a message to all processors in the network. We assume thewidely accepted model of communication networks, in which each processor initiallyknows 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 thismodel 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 com-plexity measure. If messages of unbounded length are counted at unit cost, thenbroadcast requires (jV j) messages, where V is the set of processors in the network.We prove that if one counts messages of bounded length then broadcast requires (jEj)messages, where E is the set of edges in the network.Assuming an intermediate model in which each vertex knows the topology of thenetwork in radius 1 from itself, we prove matching upper and lower bounds of(minfjEj; jV j1+(1) g) on the number of messages of bounded length required forbroadcast. Both the upper and the lower bounds hold for both synchronous andasynchronous network models.The same results hold for the construction of spanning trees, and various otherglobal tasks.1Dept. of Math., MIT, Cambridge, MA 02139, baruch@theory.lcs.mit.edu Partially supportedby Air Force contract TNDGAFOSR-86-0078, ARO contract DAAL03-86-K-0171 and NSF contractCCR8611442.2Dept. of Computer Science, Technion, Haifa, 32000, Israel. Partially supported by the NewYork Metropolitan Research Fund.3Dept. of Computer Science, Stanford University, Stanford CA 94305. Partially supported byONR contract N00014-85-C-0731. 1
1 IntroductionBroadcast [DM]
文档评论(0)