Abstract: A method implemented for a link aggregation group is disclosed. The link aggregation group contains a local interface and a remote interface. The local interface is a logical interface formed by a plurality of network elements including a local network element and a peer network element. The local network element communicates with the peer network element through an inter-peer link. The method starts with determining that the local network element is active by checking that an aggregate state of the links coupled to the local network element is active. The method continues with detecting an anomaly of the active links and sending a notification to the peer network element about the anomaly. Then method continues with receiving an activation confirmation that the peer network element is ready for switching and switching traffic from the active links to the inter-peer link in response to receiving the activation confirmation.

Abstract: 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.

Abstract: 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.

Abstract: 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.