摘要
随着计算机网络技术的飞速发展，如何使信息以最快的速度在网络中传播出去，并使用户最快地获取所需信息，已成为一个实际而且紧迫的问题．文中设计了一个网络中的最快广播站点的选择算法（逆向推进法），并给出了实现该算法的主要数据结构．以此方法在网络中选择一点作为起始结点，可使信息最快地传遍全网．
With the rapid development of network technology, Internet has become an indivisible part of everyday life. How to transport information with highest speed and how quickly to get the information which users needed is an urgent and practical problem. In it, how to select a broadcasting station from which the information can run through the network most quickly is a conspicuous problem.In this paper, a reverse progress algorithm for selecting an optimum (minimum time) broadcasting station is discussed. The main data structure for implementing this algorithm is also given.
出处
《上海交通大学学报》
EI
CAS
CSCD
北大核心
1998年第10期127-129,共3页
Journal of Shanghai Jiaotong University
关键词
计算机网络
广播系统
最优化算法
逆向推进算法
computer networks
broadcasting systems
optimization algorithms
reverse progress algorithm
minimum time
