摘要
根据广播黑盒子的分类,分析了多端口模型中多消息链式广播算法,深入探讨了算法的理论基础和理论模型;重点研究链式广播算法的时间复杂度,通过与k树算法性能的对比,说明该算法是一种更接近最优广播周期的算法.
Based on the category of broadcasting black boxes, we first analyze a kind of multiple messages broadcasting algorithm, called chain algorithm in the multiport model. After investigating the basis and model of theory, we focus the analysis of this algorithms time complexity in detail. Finally, we point out the excellence of the chain algorithm by comparison with the performance of k_tree algorithm.
出处
《北方交通大学学报》
CSCD
北大核心
2003年第2期42-45,共4页
Journal of Northern Jiaotong University
关键词
广播
多端口模型
广播黑盒子
广播源
broadcasting
multiport model
broadcasting black box
broadcaster
