This topology is the spanning-tree of the network.
这种拓扑是扩充树的网路。
When the network has stabilized, it has converged and there is one spanning-tree per network.
当网路已经稳定，它已经收敛并且每个网路有一个扩充树。
The simple enumeration methods about the spanning-tree of several types of graphs are obtained.
另外附带地给出了几类图的支撑树的简便计数方法。
It's a spanning tree if there's also at least one path between any two points, i.e., no network nodes are left unconnected.
如果任意两点之间有且只有一条通路，则构成了一棵生成树。即没有网络节点是孤立的。
then bridges find a spanning tree.
最后由网桥支撑起的一棵生成树
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)，以生成一棵全新的生成树，保证网络继续运行。
It is assumed that the routing topology representing all the paths from one routing group to all other routing groups is a spanning tree.
用路由拓扑来表示从一个路由组到其他所有路由组的所有路径，并假定路由拓扑是一棵生成树。
This paper studied the protection mechanism for virtual ring in mesh topology, and analyzed a construction algorithm for a virtual ring based on spanning tree.
文章对网状拓扑中的虚环保护机制进行了研究，并对一种基于生成树的虚环构成算法进行了分析。
The Knowledge Consistency Checker (KCC) was not able to build a spanning tree topology.
知识一致性检查器(KCC)无法来建立跨越树拓扑。
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.
传统上，各个公司是通过第二层机制(如生成树)或第三层路由协议，获得城域以太网的基本弹性。
The paper studies the application layer multicast networks of MSNs, and presents a heuristic BCT algorithm for degree-constrained minimum diameter spanning tree problem.
本文研究了由MSN节点组成的应用层组播网络，提出了度约束最小直径生成树问题，并给出了求解该问题的BCT算法。
At this point Spanning tree has fully converged.
这时生成树成功聚合。
The bridge with the lowest priority will be elected as the root bridge. The root bridge is the "central" bridge in the spanning tree.
最低优先级的网桥将被视为根结点网桥。根网桥是生成树的中心网桥。
In this paper, a parthenogenetic algorithm for solving the degree-constrained minimum spanning tree problem is proposed.
提出了求解度约束最小生成树问题的单亲遗传算法。
The experiment results show that it is effective on solving Degree - constrained Minimum Spanning Tree Problem.
实验结果表明，这种用遗传算法解决度约束的最小生成树问题是有效的。
The capacitated minimum spanning tree problem (CMST), one of the most fundamental problems in telecommunications and in the optimal design of networks, is studied.
研究流量约束最小生成树问题（CMST），它是通讯和网络优化设计中最为基础和重要的问题之一。
A routing protocol for wireless sensor networks was proposed. The protocol used a data aggregation scheme of minimum transmission cost spanning tree.
提出了一种针对无线传感器网络的路由协议，该路由采用最小传输成本生成树的数据汇聚机制。
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组播技术中核心的组播路由协议和算法进行了分析。
The player number decreasing minimum cost spanning tree game.
局中人数目变化的最小费用支撑树对策问题。
The routing is determined on the basis of finding a maximum leaf shortest spanning tree of the network topology.
该协议通过根据网络拓扑图的最多叶子最短生成树来确定路由选择。
The initial clustering structure is constructed by using the minimum spanning tree method.
然后使用最小生成树方法得到聚类的初始结构；
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地址转发表算法的基础上，提出一种新的基于生成树协议的拓扑发现算法。
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地址转发表算法的基础上，提出一种新的基于生成树协议的拓扑发现算法。
应用推荐