摘要
本文提出了树型结构计算机网络优化设计的一个新方法:以路径时延作为约束条件,在拓扑优化过程中同时考虑流量及容量分配。所得结果优于一般方法。计算复杂性为O(kn^2)。
In this paper a new kind of optimal design method for computer networks with tree structure is proposed: the link flow and capacity assignments are considered jointly in the process of topology optimization, using the path time delay as the constraint parameter. The results are better than the ordinary methods. The computational complexity is O(kn2).
出处
《通信学报》
EI
CSCD
北大核心
1993年第1期1-7,共7页
Journal on Communications
基金
国家自然科学基金
四川省应用基础研究资助
