实现了17章规定的快速生成树协议。
Implement the Rapid Spanning Tree Protocol, as specified in Clause 17.
理解生成树协议STP的配置及原理。
Understanding Spanning Tree Protocol STP configuration and principle.
如果没有生成树协议，可能会给网络带来灾难性后果。
There might be a disaster in a large scale switching LAN without spanning tree protocol.
结合第三层交换机的应用环境，实现了快速生成树协议。
The rapid spanning tree protocol has been implemented in the application environment of the layer 3 switch.
最短路径连接，接受IEEE的标准化过程，旨在取代生成树协议（STP）。
Shortest path bridging, which is undergoing IEEE's standardization process, is meant to replace the spanning tree protocol (STP).
生成树协议是交换网络中很重要的一个协议，尤其在大规模交换网络中更为重要。
Spanning tree protocol is a very important protocol in switching LAN, especially in a large scale switching LAN.
生成树协议在一般的桥接网络中可以从逻辑上切断冗余的网络连接，避免出现网络环路。
The standard spanning tree protocol is frequently employed in a bridged network in order to deactivate redundant network connections and is intended for private local area network.
在分析原有基于MAC地址转发表算法的基础上，提出一种新的基于生成树协议的拓扑发现算法。
Based on the analysis of the existing algorithm of MAC address forwarding table, it presents a kind of new physical topology discovery algorithm depended on spanning tree protocol.
如果有一个活动链接失效了，就再执行一次生成树协议(spanningtree protocol,STP)，以生成一棵全新的生成树，保证网络继续运行。
If one of the active connections fails, the spanning tree protocol (STP) is executed again to create a new spanning tree so the network keeps running.
传统上，各个公司是通过第二层机制(如生成树)或第三层路由协议，获得城域以太网的基本弹性。
Companies traditionally have gained basic resiliency for their metropolitan Ethernet networks through a Layer 2 mechanism such as Spanning Tree or Layer 3 routing protocols.
本文作者分析讨论了组播路由协议的生成树构建方法，在此基础上进一步对IP组播技术中核心的组播路由协议和算法进行了分析。
This paper intends to discuss the way to construct the spanning tree, on which the algorithm for routing protocol, which is the kernel of the IP multicasting, shall be analyzed.
提出了一种针对无线传感器网络的路由协议，该路由采用最小传输成本生成树的数据汇聚机制。
A routing protocol for wireless sensor networks was proposed. The protocol used a data aggregation scheme of minimum transmission cost spanning tree.
该协议通过根据网络拓扑图的最多叶子最短生成树来确定路由选择。
The routing is determined on the basis of finding a maximum leaf shortest spanning tree of the network topology.
在适合数据融合的生成树算法的基础上，分析能够有效延长网络生命的最小代价生成树路由协议的原理和特点。
Consider the too much redundant data and the non-balanced energy consumption of the routing protocol based on the minimum cost, proposed a new algorithm——MHEP routing algorithm.
在适合数据融合的生成树算法的基础上，分析能够有效延长网络生命的最小代价生成树路由协议的原理和特点。
Consider the too much redundant data and the non-balanced energy consumption of the routing protocol based on the minimum cost, proposed a new algorithm——MHEP routing algorithm.
应用推荐