RIP使用跳数（Hop Count）来权衡达到信宿机的距离，称为路由权（Routing Cost）。在RIP中，路由器到与它直接相连收集的跳数为0,经由过程一个路由器可达的收集的跳数为1,其余依此类推。
基于20个网页-相关网页
routing-link cost 路由链接成本 ; 路由链接本钱
least cost routing 最小成本路径法 ; 选择 ; 最经济路由设定 ; 最节省花费的路由选择
minimum routing cost spanning tree 最小路由代价生成树
automatic least cost routing 最低费用路由自动安排
LCR Least Cost Routing 最低成本路由选择
Leaset Cost Routing 最低成本路由
least-cost routing algorithm 最少成本择路法则
cost routing 最低成本工作安排
Minimum Battery Cost Routing 最小电池开销路由协议 ; 最小电池耗费路由
Compared with the traditional algorithm, the results obtained by NS2 show that the routing cost is decreased by 50% and the packet delivery ratio is increased by 5%.
在NS2平台下的仿真结果表明,与传统算法相比,改进算法的路由开销减少约50%,包投递率增加约5%。
参考来源 - AODV路由协议的本地修复算法·2,447,543篇论文数据，部分数据来源于NoteExpress
The DataPower XM70 enables you to rapidly deploy LLM routing rules that you can configurable via an intuitive interface without the need for programming, greatly reducing cost and complexity.
DataPower XM 70允许您快速部署llm路由规则，这些路由规则可以通过一个直观的界面进行配置，无需进行编程，这将极大降低成本和复杂性。
Programming individual applications to handle routing is not cost-effective.
编写单独的应用程序来解决路由问题并不经济有效。
From a cost perspective, the great advantage of packet routing is that it shares resources: Packets from many conversations travel in the same wire.
从成本角度出发，包路由的巨大优势是其共享资源：很多通话的包都是在同一条电线上传输。
应用推荐