Method of generating spanning trees to handle link and node failures in a network
US8483097B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Sep 24, 2010 |
| Grant date | Jul 9, 2013 |
| Priority date | — |
| Expiry date | Sep 29, 2031 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/484
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.