Minimum diameter application layer multicast routing with degree constraints has been proved to be a NP-complete problem.
本文研究了带度约束的最小直径应用层网络多播路由问题，提出了解决该问题的启发式遗传算法。
Thus, in multi-layer routing, to reduce the number of vias is an important and urgent problem to be addressed.
因此，在多层布线时，减少通孔数是一个十分重要和迫切需要解决的问题。
Like TRILL, shortest path bridging is designed to address this problem by applying the Layer 3 routing protocol to Layer 2 devices.
像颤音，最短路径连接的目的是解决这个问题通过应用第三层路由协议第2层设备。
应用推荐