Inventors list

Assignees list

Classification tree browser

Top 100 Inventors

Top 100 Assignees


János Farkas, Kecskemet HU

János Farkas, Kecskemet HU

Patent application numberDescriptionPublished
20100020722Method for Discovering the Physical Topology Of A Telecommunications Network - A network (NW01-28-2010
20100054157Method 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
20110013640METHOD 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 (VLAN01-20-2011
20110022725METHOD 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
20110080854Method 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
20110116418Multiple Tree Registration Protocol - A registration protocol for setting up and updating a tree that defines the active topology in an Ethernet network includes a plurality of application components and a plurality of attribute declaration components corresponding to the application components, wherein the application components declare and register attribute values and the corresponding attribute declaration components make and withdraw registration of the attributes.05-19-2011
20110205884Method and Arrangement for Failure Handling in a Network - A method and arrangement for failure handling in a tree-structured communications network having interconnected edge nodes and switching nodes. VLANs may be established by using spanning trees to provide connectivity in case of a failure in the network. Emitters in the edge nodes periodically broadcast alive messages on the VLANs, and notifiers note the alive messages. A missing alive message indicates a failure on one of the VLANs, and the notifier broadcasts corresponding failure messages on the VLANs. When the alive messages are restored, the notifier broadcasts corresponding repair messages. If a notifier fails to note a failure, one of the edge nodes performs a similar function although somewhat slower.08-25-2011
20110310904L2 METHOD FOR PARTIAL VLAN SERVICE MIGRATION - An upgraded edge node (e.g., enhanced PBB edge node, enhanced IP/MPLS edge node) and a method are described herein for providing a VLAN service for a customer in a metro network. In addition, a metro network is described herein which includes the upgraded edge nodes, traditional PB edge nodes, and a PB domain that has PB core nodes located therein.12-22-2011