论文部分内容阅读
本文从分组交换网的网路时延对链路路由变量为凸函数这一性质出发,应用拉格朗日乘子法证明了仅当网中任一节点到相邻节点的边际链路时延相等时才有可能使网路时延达到最佳,从而从理论上统一了链路选路算法。本文所提出的“容量压缩”算法是自适应链路选路算法获得初始解的一个有效的启发式算法,并与最小边际链路时延算法和自动机调整链路路由变量算法相结合,经实例计算,其结果优于流量偏差算法,具有一定的实用价值。
In this paper, starting from the nature that the network delay of the packet switched network is a convex function of the link routing variables, the Lagrange multiplier method is used to prove that only the marginal link delay from any node in the network to the neighboring node When equal, it is possible to achieve the best network delay, which theoretically unifies the link routing algorithm. The “capacity compression” algorithm proposed in this paper is an effective heuristic algorithm to obtain the initial solution for the adaptive link routing algorithm. Combined with the algorithm of the minimum marginal link delay and the algorithm of adjusting the link variable of the automatic machine, Instance calculation, the result is better than the flow deviation algorithm, has some practical value.