Telefonaktiebolaget Lm Ericsson (publ)

Lars Ernström

Pramodh D'Souza

Evgeny Tantsura

Alfred C Lindem, Iii

Jakob Heitz

Reda Haddad

Zoltán Tóth

Alfred C Iii Lindem

A method is disclosed that is implemented by a router for executing an internet protocol fast reroute process in response to a network event invalidating a current route to a destination node without degrading forwarding plane functionality or performance caused by indirect forwarding information base lookups. The method comprises a set steps including receiving or generating the network event by the router, the network event associated with a network event identifier and looking up the network event identifier in an event table to determine routes that are affected by the network event. The method further includes determining whether a route with a fast reroute forwarding object is affected by the network event in the routing information base and overwriting a current next hop forwarding object using a backup next hop forwarding object in the forwarding information base.

Method and apparatus for IP/MPLS fast reroute

A network device, is to be deployed in a network between a first network domain and a second network domain, and is to be configured for fast reroute. The network device includes a first traffic forwarder control module, corresponding to the first network domain, which is to determine a primary next hop in the first network domain. The control plane includes a second traffic forwarder control module, corresponding to the second network domain, which is to determine a backup next hop in the second network domain. The backup next hop is to be used as a fast reroute for the primary next hop in response to a failure associated with the primary next hop. The control plane includes a controller module, in communication with the first and second traffic forwarder control modules, which is to configure a forwarding structure of the forwarding plane with the primary and backup next hops.

Inter-domain fast reroute methods and network devices

A method is implemented by a network element to improve efficiency of loop free alternative (LFA) path computation by caching data from a shortest path first calculation for use in the LFA path calculation. The shortest path first calculation determines a shortest path from a source vertex to each vertex in a network topology graph representing the network in which the network element operates, where an endpoint for each shortest path is the shortest path vertex, and where each shortest path determined by the shortest path first calculation is stored.

High performance LFA path algorithms

A method in a network element of a packet data network classifies a data packet for application of a packet data network policy. A root node compound bit mask is applied to bits of a received data packet. The data packet has data in a plurality of fields. The compound bit mask has a plurality of bit masks each having bits in a different data packet field. The masked bits of the compound bit mask are applied to root node bit tables, one for each bit mask of the compound bit mask. A branch node from the root node is selected based on a bit table look up.

Growing community of inventors

Palo Alto, CA, United States of America

Lars Ernström