Abstract: Systems and methods include, at a first Border Gateway Protocol (BGP) speaker node which interconnects two autonomous systems, receiving an advertisement containing available bandwidth on one or more links between the two autonomous systems from a second BGP speaker node; and, for a BGP best path calculation between the two autonomous systems at the first BGP speaker node, selecting a link of the one or more links based on the available bandwidth on the link from the advertisement. At the first BGP speaker node, the systems and methods can further include determining bandwidth on the one or more links; and transmitting an updated advertisement based on the determined bandwidth. The bandwidth can be determined based on a configurable sampling interval. The transmitted update can be provided if the determined bandwidth has changed from a previous value by more than a configurable threshold.

Abstract: Systems and methods include, at a first Border Gateway Protocol (BGP) speaker node which interconnects two autonomous systems, receiving an advertisement containing available bandwidth on one or more links between the two autonomous systems from a second BGP speaker node; and, for a BGP best path calculation between the two autonomous systems at the first BGP speaker node, selecting a link of the one or more links based on the available bandwidth on the link from the advertisement. At the first BGP speaker node, the systems and methods can further include determining bandwidth on the one or more links; and transmitting an updated advertisement based on the determined bandwidth. The bandwidth can be determined based on a configurable sampling interval. The transmitted update can be provided if the determined bandwidth has changed from a previous value by more than a configurable threshold.

Abstract: A method is executed by a network device for authenticating resource reservation protocol (RSVP) messages between a sending node and a receiving node where the sending node and receiving node are directly or indirectly connected. The method authenticates RSVP messages using a security association between the sending node and the receiving node and an authentication key based on an address of the sending node and an address of the receiving node. The method includes generating an RSVP message to be sent to the receiving node, determining the security association for the sending node and receiving node pair, generating an integrity object for the RSVP message, determining an authentication key for the integrity object using the sending node address and the receiving node address, inserting the authentication key into the integrity object, and sending the RSVP message toward the receiving node.

Abstract: A network component comprising at least one processor configured to implement a method comprising receiving a packet, determining whether the packet comprises a topology label, and adding the topology label to the packet if the packet does not comprise the topology label. Included is a method comprising routing a plurality of packets corresponding to a plurality of forwarding equivalence classes (FECs) over a plurality of network topologies using a topology label and plurality of forwarding labels for each network topology. Also included is a network comprising a plurality of nodes in communication with each other and having a plurality of network topologies, wherein at least some of the nodes are configured to route data packets for a plurality of FECs along a path in each network topology using a topology label corresponding to each network topology and an inner label corresponding to each FEC.

Abstract: An apparatus comprising a path computation element (PCE) configured to communicate with a path computation client (PCC) and compute a point-to-multipoint (P2MP) path across an autonomous system (AS) domain. Also included is a network component comprising at least one processor configured to implement a method comprising obtaining a computation request for a P2MP path across a plurality of AS domains, attempting to calculate the P2MP path across the AS domains, thereby generating a computed path or a failure reason, and transmitting a reply comprising the computed path or an indication of the failure reason. Included is a method comprising exchanging a request message and a reply message about a P2MP path across an AS domain between a PCC and a PCE.

Abstract: A system and method for providing multi-topology support in RSVP-TE in a multi-protocol label switching network is provided. A method includes reserving path states for a traffic engineered label switched path (TE LSP), and releasing the reserved path states. The TE LSP is established within a single network topology in an environment of multiple network topologies, and the reserving path states includes sending a first resource reservation protocol with traffic engineering (RSVP-TE) message containing multi-topology information.

Abstract: System and method for support multiple topology in Label Distribution Protocol of Multi-Protocol Label Switching (MPLS) network are disclosed. The system includes a number of network elements and a communication mechanism used to connect the network elements. The network elements discover LDP peers within the network topology, and create and maintain LDP sessions for each of the network topologies. The network elements further establish LSPs by mapping network layer routing information within each network topology to data link layer switches paths. Furthermore, the communication mechanism enables the network elements to advertise the multi-topology capability and exchange the mapping information of label and FECs within each network topology.

Abstract: A method performed on a network element employing Multi-protocol Label Switching (MPLS) to optimize bandwidth in a ring topology network including a back-up Label Switch Path (LSP) for a protected LSP by re-routing traffic onto the back-up LSP to avoid shared links between the protected LSP and back-up LSP, including receiving a first labeled packet from another label switch router (LSR) in the back-up LSP, the first labeled packet indicating protection switch of data from the protected LSP to the back-up LSP, determining whether a shared link in the ring topology network exists between the protected LSP and the back-up LSP, rerouting traffic for the protected LSP onto an optimized back-up LSP to remove the shared link, receiving a second labeled packet indicating that a protection switch of data, and restoring routing of the traffic onto the protected LSP in response to receiving the second labeled packet.

Abstract: According to one embodiment, in response to at least one of a link failure and node failure of a protected label switched path (LSP), network traffic is switched onto a protection path according to a fast re-reroute (FRR) scheme. A HELLO session is established with the remote node that is not immediately adjacent to the network element, including exchanging one or more HELLO messages with the remote node, each HELLO message having a time-to-live (TTL) value of greater than one if IP forwarding is used. The TTL value of the HELLO message is set to one if the HELLO message is sent via tunnel. In response to a request to restart, a resource reservation protocol (RSVP) traffic engineering (TE) graceful restart (GR) procedure is performed using information obtained from the one or more HELLO messages exchanged with the remote node during the HELLO session.

Abstract: A network component comprising at least one processor configured to implement a method comprising receiving a packet, determining whether the packet comprises a topology label, and adding the topology label to the packet if the packet does not comprise the topology label. Included is a method comprising routing a plurality of packets corresponding to a plurality of forwarding equivalence classes (FECs) over a plurality of network topologies using a topology label and plurality of forwarding labels for each network topology. Also included is a network comprising a plurality of nodes in communication with each other and having a plurality of network topologies, wherein at least some of the nodes are configured to route data packets for a plurality of FECs along a path in each network topology using a topology label corresponding to each network topology and an inner label corresponding to each FEC.

Abstract: A network component comprising at least one processor configured to implement a method comprising receiving a packet, determining whether the packet comprises a topology label, and adding the topology label to the packet if the packet does not comprise the topology label. Included is a method comprising routing a plurality of packets corresponding to a plurality of forwarding equivalence classes (FECs) over a plurality of network topologies using a topology label and plurality of forwarding labels for each network topology. Also included is a network comprising a plurality of nodes in communication with each other and having a plurality of network topologies, wherein at least some of the nodes are configured to route data packets for a plurality of FECs along a path in each network topology using a topology label corresponding to each network topology and an inner label corresponding to each FEC.

Abstract: An apparatus comprising a path computation element (PCE) configured to communicate with a path computation client (PCC) and compute a point-to-multipoint (P2MP) path across an autonomous system (AS) domain. Also included is a network component comprising at least one processor configured to implement a method comprising obtaining a computation request for a P2MP path across a plurality of AS domains, attempting to calculate the P2MP path across the AS domains, thereby generating a computed path or a failure reason, and transmitting a reply comprising the computed path or an indication of the failure reason. Included is a method comprising exchanging a request message and a reply message about a P2MP path across an AS domain between a PCC and a PCE.

Abstract: A method to optimize resource allocation in a network employing MPL S, the method including the steps of communicating with a second node to establish a first LSP that includes a first node and the second node using an extension of RSVP-TE in a first RSVP-TE session having a group identifier. A resource controllable by the network element is allocated to the first LSP and is associated with the group identifier. The steps including communicating with a third node in the network to establish a second LSP that includes the first node and the third node using the extension of RSVP-TE through a second RSVP-TE session that is different than the first session and has the same group identifier. The resource is shared between the first LSP and the second LSP, because the same group identifier is associated with the first RSVP-TE session and second RSVP-TE session.

Abstract: An apparatus comprising a path computation element (PCE) configured to communicate with a path computation client (PCC) and compute a point-to-multipoint (P2MP) path across an autonomous system (AS) domain. Also included is a network component comprising at least one processor configured to implement a method comprising obtaining a computation request for a P2MP path across a plurality of AS domains, attempting to calculate the P2MP path across the AS domains, thereby generating a computed path or a failure reason, and transmitting a reply comprising the computed path or an indication of the failure reason. Included is a method comprising exchanging a request message and a reply message about a P2MP path across an AS domain between a PCC and a PCE.

Abstract: According to one embodiment, in response to at least one of a link failure and node failure of a protected label switched path (LSP), network traffic is switched onto a protection path according to a fast re-reroute (FRR) scheme. A HELLO session is established with the remote node that is not immediately adjacent to the network element, including exchanging one or more HELLO messages with the remote node, each HELLO message having a time-to-live (TTL) value of greater than one if IP forwarding is used. The TTL value of the HELLO message is set to one if the HELLO message is sent via tunnel. In response to a request to restart, a resource reservation protocol (RSVP) traffic engineering (TE) graceful restart (GR) procedure is performed using information obtained from the one or more HELLO messages exchanged with the remote node during the HELLO session.

Abstract: Multi-Protocol Label Switched (MPLS) traffic is re-routed to an alternate, Label Switched Path (LSP) to bypass a failure along a primary LSP, even though the failure occurs at or along an ingress section of an LSP, while associating an original IP address to the alternate path. Failures are also detected farther downstream outside an ingress section. When this occurs, MPLS traffic is re-routed to an alternate LSP which maintains the same quality of service as an original primary path and includes other network devices which are not a part of the primary path (except for the network device and a destination network device). The techniques require less resources than existing techniques.

Abstract: A system and method for providing multi-topology support in RSVP-TE in a multi-protocol label switching network is provided. A method includes reserving path states for a traffic engineered label switched path (TE LSP), and releasing the reserved path states. The TE LSP is established within a single network topology in an environment of multiple network topologies, and the reserving path states includes sending a first resource reservation protocol with traffic engineering (RSVP-TE) message containing multi-topology information.

Abstract: A network component comprising at least one processor configured to implement a method comprising receiving a packet, determining whether the packet comprises a topology label, and adding the topology label to the packet if the packet does not comprise the topology label. Included is a method comprising routing a plurality of packets corresponding to a plurality of forwarding equivalence classes (FECs) over a plurality of network topologies using a topology label and plurality of forwarding labels for each network topology. Also included is a network comprising a plurality of nodes in communication with each other and having a plurality of network topologies, wherein at least some of the nodes are configured to route data packets for a plurality of FECs along a path in each network topology using a topology label corresponding to each network topology and an inner label corresponding to each FEC.

Abstract: An apparatus comprising a path computation element (PCE) configured to communicate with a path computation client (PCC) and compute a point-to-multipoint (P2MP) path across an autonomous system (AS) domain. Also included is a network component comprising at least one processor configured to implement a method comprising obtaining a computation request for a P2MP path across a plurality of AS domains, attempting to calculate the P2MP path across the AS domains, thereby generating a computed path or a failure reason, and transmitting a reply comprising the computed path or an indication of the failure reason. Included is a method comprising exchanging a request message and a reply message about a P2MP path across an AS domain between a PCC and a PCE.

Abstract: Bi-directional Label Switched Paths (LSP) are created by bundling a forward and backward LSP. The forward LSP is separately generated from the backward LSP. The so-created, bi-directional LSP can be deleted when delete path requests are generated and received by both the forward and backward LSPs, respectively.