知搜-全球专利检索

  1. Login
  2. Sign Up
Invention Grant
US08483097B2 Method of generating spanning trees to handle link and node failures in a network 有权
生成生成树来处理网络中链路和节点故障的方法

Method of generating spanning trees to handle link and node failures in a network
Abstract:
A method for generating spanning trees (ST1,ST2,ST3) in a network (NW2). The network has nodes (A-K) interconnected by links (L2) and the trees are used for handling link and node failures. For handling link failures there is for each link (L2) at least one tree (ST1,ST2) that does not include that link. For node failures there is for each node (A-K) at least one spanning tree (ST1-ST3) to which the particular node is connected by a single link (L2). The first spanning tree (ST1) connects all nodes (A-K) and from each node one link is left unconnected. The second tree (ST2) includes all nodes and all the unconnected links. None of the links is included in both the trees (ST1,ST2). If node B is broken, node A cannot communicate with nodes C and D so the third tree (ST3) is needed. The method has the advantage of giving a low number of trees also for big networks of any topology and can be implemented off-line.
Abstract(Chinese):

一种用于在网络（NW2）中生成生成树（ST1，ST2，ST3）的方法。 网络具有通过链路（L2）互连的节点（A-K），树用于处理链路和节点故障。 为了处理链路故障，每个链路（L2）至少有一个树（ST1，ST2）不包括该链路。 对于节点故障，对于每个节点（A-K），至少一个生成树（ST1-ST3），特定节点通过单个链路（L2）连接到该生成树。 第一个生成树（ST1）连接所有节点（A-K），并且从每个节点连接一个链路未连接。 第二树（ST2）包括所有节点和所有未连接的链路。 两个树中都没有链接（ST1，ST2）。 如果节点B断开，则节点A不能与节点C和D通信，所以需要第三棵树（ST3）。 该方法具有为任何拓扑的大网络提供少量树的优点，并且可以离线实现。

Public/Granted literature
Information query
Espacenet
Patent Agency Ranking
0/0