.png){kind=icon}
返回
An optimal algorithm for broadcasting multiple messages in trees
.png){kind=icon}
PRE
AI
DOI：10.1006/jpdc.1999.1584.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
COMMUNICATION-NETWORKS
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
引用论文
.png){kind=icon}
L1 syndrome diagnosis complemented with functional analysis of L1CAM variants located to the two N‐terminal Ig‐like domainsL1 综合征诊断与位于两个n端ig-like结构域的 L1CAM 变体的功能分析
PREAI
分享收藏