| Patent application number | Description | Published |
|---|
| 20080291822 | Method and Arrangement for Failure Handling in a Network - The invention relates to failure handling in a tree sructure network (NW | 11-27-2008 |
| 20080316917 | Method of Generating Spanning Trees - A method of generating spanning trees in a network in which a plurality of network nodes are interconnected by links. The spanning trees are utilized for handling link and node failures. For link failures, each link has at least one tree that does not include that link. For node failures, each node has at least one tree to which the node is connected by a single link. A first spanning tree connects all of the nodes, and from each node one link is left unconnected. A second spanning tree includes all of the nodes and all of the unconnected links. Thus, none of the links is included in both trees. If a node failure prevents other nodes from communicating, a third spanning tree is needed. The method minimizes the number of required trees in large networks of any topology and can be implemented off-line. | 12-25-2008 |
| 20100020722 | Method for Discovering the Physical Topology Of A Telecommunications Network - A network (NW | 01-28-2010 |
| 20100054157 | Method And Apparatus For Network Tree Management - There is disclosed a manner of managing the active topology, that is the scheme for forwarding data, in a computer network such as an Ethernet local area network. A root bridge is selected from a plurality of bridges in the network; the root bridge calculating at least one spanning tree from a topology database that has been populated by bridge neighbor information gleaned from link state advertising messages. The root bridge may also calculate an alternate topology for implementation in the event a failure condition that affects the primary spanning tree is detected. The root bridge then advertises the spanning tree and remotely configures the port states of the bridges in the spanning tree through tree advertising messages that the bridges are arranged to process and set their ports accordingly. | 03-04-2010 |
| 20100177641 | Fault Localisation in Multiple Spanning Tree Based Architectures - A method of localising a fault in a network is disclosed. The network comprises nodes (SW | 07-15-2010 |
| 20100203893 | ENHANCED FLOW CONTROL IN A CELLULAR TELEPHONY SYSTEM - The invention discloses a method ( | 08-12-2010 |
| 20110013640 | METHOD AD APPARATUS FOR ETHERNET PROTECTION WITH LOCAL RE-ROUTING - A method is provided for use at a first node of a network. The first node (B) has an input path for receiving Ethernet frames destined for a second node of the network. The first node (B) also has a first output (working) path for forwarding the received Ethernet frames towards the second node. A failure along the first output (working) path is detected at the first node. Following such failure detection, the received Ethernet frames are caused, at the first node, to be re-routed along a second output (backup) path, different to the first output (working) path, towards the second node. The re-routing is performed by using (e.g. referring to and/or changing) respective indications (VLAN | 01-20-2011 |
| 20110022725 | METHOD AND APPARATUS FOR LINK-STATE HANDSHAKE FOR LOOP PREVENTION - A network node of a telecommunications network controlled by a link-state protocol includes a network interface which receives a message that contains information on a change in topology of the network. The node includes a processing unit that blocks forwarding of traffic to at least one neighbor node of the network at the network interface, agrees on the change in topology with the neighbor node; and unblocks the forwarding of traffic when the neighbor node has information about the topology which is the same as the information about the topology in a memory. A transient loop prevention method of a network node of a network having a plurality of a network nodes controlled by a link-state protocol includes the steps of receiving a message at a network interface which contains information on a change in topology of the network. There is the step of blocking forwarding of traffic to each neighbor node of the network at the network interface by a processing unit. There is the step of agreeing by the processing unit on the change in topology with the neighbor node. There is the step of unblocking the forwarding of traffic when the neighbor node has information about the topology which is the same as the information about the topology stored in a memory. | 01-27-2011 |
| 20110026438 | METHOD OF GENERATING SPANNING TREES - A method for generating spanning trees (ST | 02-03-2011 |
| 20110080854 | Method And System For Controlled Tree Management - There is disclosed a method and apparatus for facilitating a network, such as an Ethernet LAN, for efficient forwarding of data traffic by collecting neighbor information, generating and distributing link state advertisements, populating a topology database for the network, and calculating trees for each bridge serving as a root bridge. In a preferred embodiment the method and system also prepare one or more backup topologies, and store them for use if they are needed due to a failure condition detected in the network. In a particularly preferred embodiment, probabilities are assigned to various potential failure conditions, and the probability values are used to decide which backup topologies to calculate, store, or use. | 04-07-2011 |
