最小成本广播路由
有没有什么方法可以让我们在不使用生成树算法的情况下获得最小成本的广播路由方案？
任何指导我这方面的参考资料对我来说都会很有用。
Is there any method where we can get a minimum cost broadcast routing scheme without using the spanning tree algorithm?
Any references to guide me on this will be of great use to me.
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（3）
任何实现最小成本广播（或多播）路由方案的算法最终都可以归结为构建表示网络的完整图的最小成本生成树（以多播源为根）。
有多种算法可用于计算最小成本生成树。
IP 组播路由协议（例如 PIM）依赖于由 IGP（OSPF 或 ISIS）使用 Dijkstra 算法计算的最低成本生成树。
较旧的协议（例如 DVMRP）依赖距离矢量协议来计算生成树。
理论上可以使用其他算法来计算最低成本生成树（例如 Bellman-Ford），尽管我知道在实践中没有这样做的实现。
Any algorithm for implementing a minimum cost broadcast (or multicast) routing scheme in the end boils down to constructing a least-cost spanning tree (rooted at the multicast source) of the full graph which represents the network.
There are various algorithms for computing the least-cost spanning tree.
IP multicast routing protocols such as PIM rely on least-cost spanning tree which is computed by the IGP (OSPF or ISIS) using the Dijkstra algorithm.
Older protocols, such as DVMRP, rely on a distance-vector protocol to compute the spanning tree.
One could theoretically use other algorithms to compute the least-cost spanning tree (e.g. Bellman-Ford) although I know of no implementation that does so in practice.
补充一下 Cayle，考虑到您提到了生成树，我假设您不是在谈论第 3 层（pim、dvmrp、ospf、isis、rip、bgp 等），而是在谈论第 2 层。TRILL 是一种新的标准化协议，它执行几乎最低成本的广播路由（假设您的源位于分发树的根部）。 IEEE 802.1aq 是一个仍在标准化的协议，它具有类似的路由方案。
To add to Cayle, considering you mentioned spanning tree I assume you are not talking about layer 3 (pim, dvmrp, ospf, isis, rip, bgp, etc) and you are instead talking about layer 2. TRILL is a new standardized protocol that does nearly minimum cost broadcast routing (assuming your source is at a root of a distribution tree). IEEE 802.1aq is a protocol still be standardized that does a similar routing scheme.
Trill（大量链接的透明互连）是对抗STP的最佳选择。因为在stp中，从源到目的地有一条最短的专用路径。当Trill用于多路径时。因此使用Trill我们可以使用网络的最大带宽。 Trill也在进行研究。Trill通常使用ISIS协议进行内部路由，使用Dijkstra算法进行最短路径。
Trill 基本上适用于 L2 和 L3。如果您正在寻找 trill 的实现，您必须参考 RFC，例如 6325,6326,7177 等。
如果您正在寻找实现了Trill的交换机。Cisco、juniperNetwork、华为和许多其他公司在交换机中部分实现了它。
谢谢
Trill(Transparent Interconnection of Lots of links ) is the best option against STP.Because in stp there is a shortest dedicated path from source to destination.When Trill is used for multipathing.So using Trill we can use maximum bandwidth of the network.The research is also going on Trill.Trill usually use ISIS protocol for internal routing and Dijkstra algorithm for shortest path.
Trill basically work on L2 as well as on L3.If you are looking for implementation of trill you have to refer RFCs like 6325,6326,7177 and many more.
If you are looking for switches with Trill implemented.Cisco,juniperNetwork, Huawei and many other companies implemented it partially in the switches.
Thanks