Maximizable routing metrics
Maximizable routing metrics
复制标题
DOI：
10.1109/icnp.1998.723727
复制
发表时间：
1998-10
期刊：
影响因子：
--
通讯作者：
M. Gouda;Marco Schneider
中科院分区：
文献类型：
--
作者：
M. Gouda;Marco Schneider
我们开发了一个理论，决定，对于任何路由度量和任何网络，在这个网络中的消息是否可以被路由沿着路径的度量值是最大的。为了使网络中的消息沿着度量值最大的路径沿着路由，网络需要具有相对于路由度量最大的有根生成树。我们确定了路由度量的两个重要属性：有界性和单调性，并表明这两个属性是必要的和充分的，以确保任何网络有一个最大的树相对于任何（有界和单调）度量。我们还讨论了如何将联合收割机的两个（或更多）路由度量到一个单一的复合度量，如果原来的度量是有界和单调，那么复合度量是有界和单调。最后，我们证明了在EIGRP（网关间路由协议）和EIGRP（增强型EIGRP）的复合路由度量是有界的，但不是单调的。
We develop a theory for deciding, for any routing metric and any network, whether the messages in this network can be routed along paths whose metric values are maximum. In order for the messages in a network to be routed along paths whose metric values are maximum, the network needs to have a rooted spanning tree that is maximal with respect to the routing metric. We identify two important properties of routing metrics: boundedness and monotonicity, and show that these two properties are both necessary and sufficient to ensure that any network has a maximal tree with respect to any (bounded and monotonic) metric. We also discuss how to combine two (or more) routing metrics into a single composite metric such that if the original metrics are bounded and monotonic, then the composite metric is bounded and monotonic. Finally we show that the composite routing metrics used in IGRP (inter-gateway routing protocol) and EIGRP (enhanced IGRP) are bounded but not monotonic.