摘要
本文提出一种直接运用链路容量进行动态无级网优化与设计的新方法。与过去的方法比较,提高了运算速度,降低了计算时所需的内存空间。还应用这个方法计算一个实际的六节点DNHR网,与静态的无级网比较,它节约大约15.5%的费用。
This paper presents the design and optimization algorithm of DNHR network which minimize the cost of the network, directly changing maximum carried load on links over all hours, instead of traditional proportion of carried load on routes. So it greatly improves computational speed and memory size needed. Applying the algorithm we designed a 6-node DNHR network. Comparing with the conventional nonhierarchical routing (NHR), it saves about 15.5% on the cost of network.
出处
《通信学报》
EI
CSCD
北大核心
1990年第4期78-81,共4页
Journal on Communications
基金
国家自然科学基金