An optimal algorithm for broadcasting multiple messages in trees

被引：1

作者：

Diks, K

Lingas, A

Pelc, A

机构：

[1] Univ Warsaw, Inst Informat, PL-02097 Warsaw, Poland

[2] Univ Lund, Dept Comp Sci, S-22100 Lund, Sweden

[3] Univ Quebec, Dept Informat, Hull, PQ J8X 3X7, Canada

来源：

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 1999年 / 59卷 / 03期

基金：

加拿大自然科学与工程研究理事会;

关键词：

D O I：

10.1006/jpdc.1999.1584

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We consider multiple message broadcasting in tree networks. The source (considered as the root of the tree) has k messages which have to be broadcast to all nodes of the tree. In every time unit each node can send one of its already obtained messages to one of its children. A ii-message broadcasting scheme prescribes in which time unit a given node should send a message to which child. It is k-optimal if it achieves the smallest possible time for broadcasting k messages from the source to all nodes. We give an algorithm to construct a k-optimal broadcasting scheme for an arbitrary n-node tree. The time complexity of our algorithm is O(nk), i.e., the best possible, (C) 1999 Academic Press.

引用

页码：465 / 474

页数：10

共 50 条

[21] Optimal broadcasting in the back to back d-ary trees
Barth, D
INFORMATION PROCESSING LETTERS, 1996, 59 (02) : 85 - 89
[22] An optimal-broadcasting algorithm for pyramid networks
Hsieh, Hsien-Jone
Duh, Dyi-Rong
WMSCI 2005: 9th World Multi-Conference on Systemics, Cybernetics and Informatics, Vol 2, 2005, : 266 - 270
[23] Broadcasting Private Messages Securely
Czap, Laszlo
Prabhakaran, Vinod M.
Diggavi, Suhas
Fragouli, Christina
2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012, : 428 - 432
[24] Efficient broadcasting in an arrangement graph using multiple spanning trees
Chen, YS
Juang, TY
Tseng, EH
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2000, E83A (01) : 139 - 149
[25] Efficient broadcasting in an arrangement graph using multiple spanning trees
Chen, YS
Tseng, EH
Juang, TY
APPLICATIONS OF HIGH-PERFORMANCE COMPUTING IN ENGINEERING VI, 2000, 6 : 191 - 200
[26] A FAST SELECTION ALGORITHM FOR MESHES WITH MULTIPLE BROADCASTING
BHAGAVATHI, D
LOOGES, PJ
OLARIU, S
SCHWING, JL
ZHANG, J
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1994, 5 (07) : 772 - 778
[27] Broadcasting Messages in the Internet of Vehicles
Bujari, Armir
Palazzi, Claudio E.
Vitella, Alessio
2018 IEEE 29TH ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS (PIMRC), 2018, : 58 - 62
[28] On Algorithm for Building of Optimal α-Decision Trees
Alkhalid, Abdulaziz
Chikalov, Igor
Moshkov, Mikhail
ROUGH SETS AND CURRENT TRENDS IN COMPUTING, PROCEEDINGS, 2010, 6086 : 438 - 445
[29] Computing optimal or near-optimal trees for minimum-energy broadcasting in wireless networks
Yuan, D
PROCEEDINGS OF THE THIRD INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC, AND WIRELESS NETWORKS, 2005, : 323 - 331
[30] Nonadaptive Broadcasting in Trees
Harutyunyan, Hovhannes A.
Liestman, Arthur L.
Makino, Kazuhisa
Shermer, Thomas C.
NETWORKS, 2011, 57 (02) : 157 - 168

← 1 2 3 4 5 →