摘要
求解计算机网络最小平均迟延和流量分配的本质是一个联合优化问题。进一步分析得出，它可近似为一个二次型优化问题。利用一种具有全局收敛性质的神经网络模型来解决这个问题，计算结果表明这种方法是可行且有效的。
In this paper,the delay of a computer communication network as the average end-to-end delay of packets in the network is investigated.The issue of computing the minimum delay and flow assignment of a computer network is combinatorial-optimization problem.Further analysis shows that it can approximate to a quadratic programming problem.To solve the problem a new neural network model featuring global convergence is used.The simulation results demonstrate the new method is feasible and effective.
出处
《通信学报》
EI
CSCD
北大核心
1995年第6期1-8,共8页
Journal on Communications
