不同的接口和网桥可能有不同的速度，当选择链路时这个值将用做参考。快速的接口应该具有较小的代价。
Each interface in a bridge could have a different speed and this value is used when deciding which link to use. Faster interfaces should have lower costs.
例如，企业能以几条t - 1链路的代价建立一条t - 3或oc - 3链接，把增加的带宽在整个机构内进行分配。
For example, the enterprise could establish a T-3 or OC-3 connection forth cost of several T-1 links and distribute incremental bandwidth throughout the organization.
研究具有时延约束的最小代价组播路由问题，提出一种基于链路优化的组播路由算法求解该问题。
Delay-constrained least-cost multicast routing problem is studied, and a multicast routing algorithm based on link optimizing is proposed to solve the problem.
路由选择采用K条最短路径算法进行，备选路由集中首选最佳路由时考虑链路的代价、跳数和每一个链路上不可用波长数。
We adopt K shortest paths into routing and choose the best route in them considering link costs, links hops and the number of noutilized wavelength in a link.
用这种方法对甚短距离光传输系统VSR_1的色散功率代价做了计算分析，所得结果可作为最坏情况下VSR_1链路功率预算分析的参考。
The dispersion penalty of VSR-1 optical link was calculated by this approach. The result can be used as the reference for the worst-case VSR-1 link budget analysis.
这些特征的代价仅为每帧3字节的额外开销，链路建立是的一些协商帧，以及一些复杂的实现。
The price we pay for all these features is 3 bytes of additional overhead per frame, a few frames of negotiation when the link is established, and a more complex implementation.
在组播树建立之初，计算好组播节点之间的最小代价路径，以便于出现故障之后寻找最优备用链路；
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.
首先模拟计算了链路中引入SOA后的功率代价；
首先模拟计算了链路中引入SOA后的功率代价；
应用推荐