Understanding Spanning Tree Protocol STP configuration and principle.
理解生成树协议STP的配置及原理。
Implement the Rapid Spanning Tree Protocol, as specified in Clause 17.
实现了17章规定的快速生成树协议。
The rapid spanning tree protocol has been implemented in the application environment of the layer 3 switch.
结合第三层交换机的应用环境，实现了快速生成树协议。
Spanning tree protocol is a very important protocol in switching LAN, especially in a large scale switching LAN.
生成树协议是交换网络中很重要的一个协议，尤其在大规模交换网络中更为重要。
Shortest path bridging, which is undergoing IEEE's standardization process, is meant to replace the spanning tree protocol (STP).
最短路径连接，接受IEEE的标准化过程，旨在取代生成树协议（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.
如果有一个活动链接失效了，就再执行一次生成树协议(spanningtree protocol,STP)，以生成一棵全新的生成树，保证网络继续运行。
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.
在分析原有基于MAC地址转发表算法的基础上，提出一种新的基于生成树协议的拓扑发现算法。
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.
生成树协议在一般的桥接网络中可以从逻辑上切断冗余的网络连接，避免出现网络环路。
The degree and delay constrained routing problem in overlay multicast was studied, and a new overlay multicast routing protocol called delay bounded tree protocol (DBTP) was proposed.
研究有度和延时约束的覆盖多播路由问题，提出了一个新的覆盖多播路由协议-延时受限的树协议（DBTP）。
ASTR combines the merits of proactive routing protocol and on-demand routing protocol because subarea tree has the function of routing selection.
由于分区树具有路由选择功能，所以ASTR结合了先应式路由协议和按需路由协议的优点。
Combined with complete binary tree architecture, a new identity-based group key agreement protocol is proposed in this paper.
文中结合完全二叉树结构，提出了一种新的基于身份的群密钥协商协议。
The protocol can search multiple feasible tree branches, and select the optimal or near optimal branch for connecting the new receiver to the multicast tree if it exists.
该协议可搜索多条可行树枝，并能选择一条最优(或近优)树枝将新成员连接到多播树。
Two-phase locking protocol and tree locking protocol can be implemented on this system.
在此基础上可以实现二阶段锁协议和树协议。
In order to decrease the storage cost of group key distribution protocol, a secure group key distribute protocol based on the status key tree is proposed.
为了减少群组密钥分发协议的存储代价，提出了一种基于状态密钥树的群组密钥分发协议。
The features of DSALM mainly includes: (1) Easy to implement, it doesn't have to construct and maintain a complex multicast tree, and also doesn't have to deploy multicast communication protocol.
DSALM的优点主要包括：1易于实现：不需要构建和维护复杂的结构化覆盖网络，也不需要部署特殊的组播通讯协议。
Based on tree and threshold idea Wang et al. proposed an efficient group key agreement protocol (TTS) and claimed that their protocol is secure.
基于树结构与门限的思想，王志伟等人提出了一个高效的组密钥协商协议(TTS协议)，并认为他们的协议是安全的。
A decision tree classifier was applied and a scalar product protocol was added, so that the need of privacy preserving is satisfied as well as the advantage of decision tree is retained.
在传统的决策树算法中引入标量积协议，既保持决策树算法本身的优点，又满足了保持隐私的需求。
KTR is a dynamic wireless routing protocol based on the tree structure.
核心树路由协议是一种基于树状路由结构的动态无线路由协议。
A routing protocol for wireless sensor networks was proposed. The protocol used a data aggregation scheme of minimum transmission cost spanning tree.
提出了一种针对无线传感器网络的路由协议，该路由采用最小传输成本生成树的数据汇聚机制。
Based on the self developing asynchronous parallel communication card the system, adopts a tree or hierarchical topology structure and develops a real time communication protocol.
该系统基于自行设计的异步并行通讯卡，采用树型分级拓扑结构，并开发了相应的实时通讯协议。
ASTR belongs to hierarchical routing protocol: it divides the whole network into many subareas logically through establishing subarea trees and each subarea is composed of a tree.
ASTR属于分级路由协议，通过建立分区树，在逻辑上将网络划分为多个分区，每个分区由一棵树组成。
In the third part, basing on the actual requirements of the project, a tree based energy efficient routing protocol TREES is designed.
第三部分根据项目的实际需求，设计了一种基于树型结构网络的能量高效的无线传感器网络路由协议TREES。
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.
本文作者分析讨论了组播路由协议的生成树构建方法，在此基础上进一步对IP组播技术中核心的组播路由协议和算法进行了分析。
And we mainly focus on the distributed key management framework: IGKMP and lolus , the rekeying protocol based on key tree , and periodical rekeying strategies.
其中重点讨论了目前流行的组播密钥管理框架，密钥树，分隙密钥更新方案。
Moreover, for the sake of proving the generalization of the tree model, we modify the ALMI protocol, and design the T-ALMI (topology-aware ALMI) overlay construction algorithms.
考虑到网络结构模型的通用性，在新协议设计的同时，本文对已有的almi协议的重叠网构建过程进行了改进，设计了T - ALMI重叠网构建算法。
Finally, this paper presents a new secure tree-based data aggregation protocol which includes homomorphic encryption algorithm and the new result-checking algorithm.
最后，基于同态加密和新的结果验证算法，提出一种新的树形数据融合协议。
Finally, this paper presents a new secure tree-based data aggregation protocol which includes homomorphic encryption algorithm and the new result-checking algorithm.
最后，基于同态加密和新的结果验证算法，提出一种新的树形数据融合协议。
应用推荐