Abstract: In an embodiment, a method comprises: receiving, at a data packet router, a path advertisement comprising information about an available path; determining whether the path advertisement comprises an originator identifier of an originator of the available path; in response to determining that the path advertisement comprises the originator identifier of the originator of the available path, determining whether the originator identifier of the available path is a router identifier of the data packet router, and in response to determining that the originator identifier of the available path is the router identifier of the data packet router, not accepting the path advertisement; wherein the method is performed by one or more processors of the data packet router.

Abstract: In an embodiment, a method comprises receiving a path advertisement comprising information about an available path and a well-known community value associated with the available path. A modified best path calculation is performed in response to receiving the available path either from a higher-ranked device or from a device that is not participating in diverse path calculation, resulting in creating a particular best path. The particular best path is advertised to other routers with or without a restriction indicator based on whether it is a client learned path or non-client iBGP peer learned path and based on whether the advertisement is directed to a client or a non-client iBGP peer.

Abstract: Techniques are disclosed for providing fast convergence on Autonomous System Border Routers (ASBRs). In an embodiment, an ASBR receives first Virtual Private Network (VPN) route information including a first route target, a first route distinguisher, and a first network prefix and second VPN route information including a second route target, a second route distinguisher and a second network prefix. The second route distinguisher received by the ASBR is different than the first route distinguisher. The ASBR compares the first route target to the second route target and the first network prefix with the second network prefix. In response to determining that the first route target matches the second route target and the first network prefix matches the second network prefix, the ASBR associates, in a routing table, a first path based on the first VPN route information with a second path based on the second VPN route information.

Abstract: In an embodiment, a method comprises receiving a path advertisement comprising information about an available path and a well-known community value associated with the available path. A modified best path calculation is performed in response to receiving the available path either from a higher-ranked device or from a device that is not participating in diverse path calculation, resulting in creating a particular best path. The particular best path is advertised to other routers with or without a restriction indicator based on whether it is a client learned path or non-client iBGP peer learned path and based on whether the advertisement is directed to a client or a non-client iBGP peer.

Abstract: A core network aggregates control information and generates forwarding information at a route controller distinct from each of a plurality of provider edge (PE) routers along the edge of the core network. A network controller generates forwarding state indicative of a next hop router along the edge. Message traffic traversing the core identifies a destination PE, or exit interface, router from forwarding state pushed to the PE routers by the network controller. Aggregation of the forwarding information at the router controller and generating the forwarding state at the network controller removes control plane from the edge (PE) routers of the core to eliminate the need for BGP at the edge routers and provide a BGP free edge. This simplifies the edge architecture as well as directly accelerates the new service delivery by any given autonomous system.

Abstract: In an embodiment, a method comprises receiving a path advertisement comprising information about an available path and a well-known community value associated with the available path. A modified best path calculation is performed in response to receiving the available path either from a higher-ranked device or from a device that is not participating in diverse path calculation, resulting in creating a particular best path. The particular best path is advertised to other routers with or without a restriction indicator based on whether it is a client learned path or non-client iBGP peer learned path and based on whether the advertisement is directed to a client or a non-client iBGP peer.

Abstract: In one embodiment, an angular distance calculation technique may enable an intermediate node, such as a route reflector, to render customized best path selection decisions to destination address prefixes and advertise those decisions to its intermediate peering nodes, i.e., route reflector clients, in an autonomous system of a computer network. That is, the route reflector may execute a routing protocol, such as BGP, to select and advertise a next hop (e.g., an address prefix of an egress point of the autonomous system) associated with a customized best path to a route reflector client based on an angular distance between the route reflector client and the egress point. In this manner, the route reflector client may route data traffic destined to a destination address prefix utilizing the egress point associated with the customized best path to that prefix.

Abstract: A method performed by a network device may include establishing performance-based Bidirectional Forwarding Detection (BFD) sessions for each link of a primary traffic engineering Label Switched Path (TE-LSP) and establishing performance-based BFD sessions for each link of a secondary TE-LSP. The method may also include, monitoring performance of the primary TE-LSP based on the performance-based BFD sessions for each link of the primary TE-LSP and monitoring performance of the secondary TE-LSP based on the performance-based BFD sessions for each link of the secondary TE-LSP. The method may further include determining that the performance of the primary TE-LSP is degraded based on the monitoring of the performance of the primary TE-LSP and automatically switching a flow of data unit traffic from the primary TE-LSP to the secondary TE-LSP when the performance of the primary TE-LSP is degraded.

Abstract: Techniques are disclosed for providing fast convergence on Autonomous System Border Routers (ASBRs). In an embodiment, an ASBR receives first Virtual Private Network (VPN) route information including a first route target, a first route distinguisher, and a first network prefix and second VPN route information including a second route target, a second route distinguisher and a second network prefix. The second route distinguisher received by the ASBR is different than the first route distinguisher. The ASBR compares the first route target to the second route target and the first network prefix with the second network prefix. In response to determining that the first route target matches the second route target and the first network prefix matches the second network prefix, the ASBR associates, in a routing table, a first path based on the first VPN route information with a second path based on the second VPN route information.

Abstract: In an embodiment, a method comprises: receiving, at a data packet router, a path advertisement comprising information about an available path; determining whether the path advertisement comprises an originator identifier of an originator of the available path; in response to determining that the path advertisement comprises the originator identifier of the originator of the available path, determining whether the originator identifier of the available path is a router identifier of the data packet router, and in response to determining that the originator identifier of the available path is the router identifier of the data packet router, not accepting the path advertisement; wherein the method is performed by one or more processors of the data packet router.

Abstract: In an embodiment, a method comprises receiving a path advertisement comprising information about an available path and a well-known community value associated with the available path. A modified best path calculation is performed in response to receiving the available path either from a higher-ranked device or from a device that is not participating in diverse path calculation, resulting in creating a particular best path. The particular best path is advertised to other routers with or without a restriction indicator based on whether it is a client learned path or non-client iBGP peer learned path and based on whether the advertisement is directed to a client or a non-client iBGP peer.

Abstract: A technique is provided for dynamically discovering shared risk node group (SRNG) memberships of a plurality of interconnected edge devices in a computer network. According to the technique, each edge device “learns” the identities of its directly-attached peer devices situated in neighboring routing domains, e.g., by establishing an interior or exterior gateway routing protocol session with each peer. Thereafter, each edge device advertises the identities of its learned peers to the other interconnected edge devices. Preferably, the peer identities are distributed in novel “peer-router” extended community attributes transported in Border Gateway Protocol (BGP) messages. After an edge device has learned the identity of its own peers and received the identities of the other edge devices' peers, the device can automatically detect SRNG memberships in the computer network. Specifically, edge devices that advertise the same peer are determined to participate in the same SRNG.

Abstract: In one embodiment, a network device determines identities of each peer device in a second routing domain attached to edge devices in a first routing domain. The network device associates each address prefix reachable in the second routing domain with an identity of each peer device in the second routing domain that advertised the address prefix and with an identity of one or more edge devices in the first routing domain to which that peer device is attached. The network device determines an address prefix is associated with a same identity of a peer device in the second routing domain but with different edge devices in the first routing domain. The network device assigns the different edge devices in the first routing domain associated with the determined address prefix to a shared risk node group (SRNG).

Abstract: A method performed by a network device may include establishing performance-based Bidirectional Forwarding Detection (BFD) sessions for each link of a primary traffic engineering Label Switched Path (TE-LSP) and establishing performance-based BFD sessions for each link of a secondary TE-LSP. The method may also include, monitoring performance of the primary TE-LSP based on the performance-based BFD sessions for each link of the primary TE-LSP and monitoring performance of the secondary TE-LSP based on the performance-based BFD sessions for each link of the secondary TE-LSP. The method may further include determining that the performance of the primary TE-LSP is degraded based on the monitoring of the performance of the primary TE-LSP and automatically switching a flow of data unit traffic from the primary TE-LSP to the secondary TE-LSP when the performance of the primary TE-LSP is degraded.

Abstract: A method performed by a network device may include establishing performance-based Bidirectional Forwarding Detection (BFD) sessions for each link of a primary traffic engineering Label Switched Path (TE-LSP) and establishing performance-based BFD sessions for each link of a secondary TE-LSP. The method may also include, monitoring performance of the primary TE-LSP based on the performance-based BFD sessions for each link of the primary TE-LSP and monitoring performance of the secondary TE-LSP based on the performance-based BFD sessions for each link of the secondary TE-LSP. The method may further include determining that the performance of the primary TE-LSP is degraded based on the monitoring of the performance of the primary TE-LSP and automatically switching a flow of data unit traffic from the primary TE-LSP to the secondary TE-LSP when the performance of the primary TE-LSP is degraded.

Abstract: An apparatus and method as described for constructing a repair path for use in the event of failure of an inter-routing domain connection between respective components in first and second routing domains of a data communications network. The apparatus is arranged to assign a propagatable repair address for use in the event of failure of the inter-routing domain connection and to propagate the repair address via data communications network components other than the inter-routing domain connection.

Abstract: In one embodiment, a node receives traffic sent from one or more sources toward one or more destinations (e.g., Multipoint-to-Point, MP2P traffic). The node may detect a burst of received traffic based on one or more characteristics of the burst traffic, and, in response, may dynamically apply traffic shaping to the burst traffic. The traffic shaping is adapted to forward burst traffic received below a configurable threshold at a configurable pace and to drop burst traffic received above the configurable threshold. In addition, the node may also store the burst traffic dropped by traffic shaping, and forwards the stored burst traffic toward its destination after a configurable delay.

Abstract: A system receives a packet at a first node. The packet is destined for a second node. The system identifies a full routing node from a plurality of network devices. The full routing node is capable of providing routing information for each of the nodes within the plurality of network devices. The plurality of network devices comprises a subset of nodes, and a subset of full routing nodes. The subset of nodes is not capable of providing routing information for each of the nodes within the plurality of network devices. The system transmits the packet to the full routing node for future transmission to the second node.

Abstract: In one embodiment, a loss of communication is detected between a first edge device of a computer network and a neighboring routing domain. A data packet is received at the first edge device, where the received data packet contains a destination address that is reachable via the neighboring routing domain. A determination is made whether a service label is located in a Multi-Protocol Label Switching (MPLS) label stack included in the received data packet. A service label in the MPLS label stack indicates that the received data packet was previously rerouted in accordance with fast reroute (FRR) operations. In response to a determination that the received data packet does not include a service label in the MPLS label stack, the received data packet is rerouted to a second edge device of the computer network for forwarding to the neighboring routing domain.

Abstract: An apparatus for providing reachability in a routing domain of a data communications network having as components nodes and links therebetween for a routing domain external destination address is provided. The apparatus is arranged to advertise destination address reachability internally to nodes in the routing domain and associate a reachability category with the internal advertisement of the destination address reachability.