The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Jul. 09, 2013
Filed:
Sep. 24, 2010
János Farkas, Kecskemét, HU;
Gábor Tóth, Szigetszentmiklós, HU;
János Farkas, Kecskemét, HU;
Gábor Tóth, Szigetszentmiklós, HU;
Telefonaktiebolaget L M Ericsson (publ), Stockholm, SE;
Abstract
A method for generating spanning trees (ST,ST,ST) in a network (NW). The network has nodes (A-K) interconnected by links (L) and the trees are used for handling link and node failures. For handling link failures there is for each link (L) at least one tree (ST,ST) that does not include that link. For node failures there is for each node (A-K) at least one spanning tree (ST-ST) to which the particular node is connected by a single link (L). The first spanning tree (ST) connects all nodes (A-K) and from each node one link is left unconnected. The second tree (ST) includes all nodes and all the unconnected links. None of the links is included in both the trees (ST,ST). If node B is broken, node A cannot communicate with nodes C and D so the third tree (ST) 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.