为引述方便，下文中 称该模型的流量路由算法为最小代价路径(Minimal Cost Path, MCP)路由优化算法，其中的路径代价 是路径上所有链路代价之和。
基于18个网页-相关网页
在组播树建立之初，计算好组播节点之间的最小代价路径，以便于出现故障之后寻找最优备用链路；
Using STP algorithm, the least cost paths between nodes are computed when computing the working tree, so the best backup path can be found as soon as the failure occurs.
针对具有时延约束最小代价路径问题，提出一种基于禁忌搜索方法的时延约束的最小代价单播路由算法（TSBDRA）。
A novel algorithm based on Tabu Search for Delay-Constrained Least-Cost Routing (TSBDRA) is proposed to solve delay-constrained least-cost unicast routing problem.
然后它会选取代价最小（对 DB2 10 而言）或是代价稍大但风险较小的路径。
Then it will either pick the cheapest access path or (as of DB2 10) a slightly more costly but less risky path.
应用推荐