The least cost routing path is also used if a message cannot be delivered to the target site. 如果无法将邮件传递到目标站点,也将使用开销最少的路由路径。
In this case, message delivery queues at the Hub Transport servers in the closest reachable site along the least cost routing path of the target site. 在这种情况下,邮件传递沿着目标站点开销最少的路由路径,在最接近站点的集线器传输服务器上排队。
With the multi-constraint QoS routing algorithm, least cost QoS routing path satisfying two or more constrained conditions can be found based on Lagrange Relaxation. 提出了一个有效的求解多约束的QoS路由算法,该算法使用拉格朗日松弛求解满足两个以上约束条件下的最小代价QoS路径。
To solve the problem of delay and delay-variation constrained least cost multicast routing, an algorithm based on dynamic penalty function and tabu search is proposed, which is also proved of holding better performances on the cost 、 delay and delay variation of the multicast tree. 针对时延和时延抖动约束最小代价组播路由问题,提出了基于动态罚函数和禁忌搜索的算法,算法所得组播树的代价、时延和时延抖动比较理想。
A Multi-Constrained Dynamic Least Cost Multicast Routing Algorithm 一种多受限最小代价的动态组播路由算法