Abstract:
IP addresses are efficiently assigned and advertised across the boundary of two network domains. The two network domains include an access network that implements MPLS-TP and a core network that implements IP, MPLS, or a combination of both. A primary BN at the domain boundary receives an assignment of an IP prefix for a VPN that connects a set of CEs to one or more SNs. The IP prefix represents a pool of IP addresses. The primary BN assigns only one IP address to both itself and a standby BN for the VPN to minimize the use of assigned IP addresses. The primary BN assigns the other IP addresses to the CEs in the VPN. The primary BN then advertises the IP prefix into the core network to enable routing of network data traffic across the network domain boundary.
Abstract:
A primary border node (BN) and a standby BN are provided for internetworking two network domains, such that connectivity between the two network domains is maintained when a failure occurs in one of the network domains. The two network domains include an access network that implements MPLS-TP and a core network that implements IP, MPLS, or a combination of both. The primary BN establishes a tunnel from itself to the standby BN, and re-directs network data traffic from itself to the standby BN via the tunnel when it detects that an access node has switched connection from the primary VN to the standby BN. The primary BN also monitors its connections to the core network, and signals access nodes to switch to the standby BN if a failure is detected in these connections.
Abstract:
A primary border node (BN) and a standby BN are provided for internetworking two network domains, such that connectivity between the two network domains is maintained when a failure occurs in one of the network domains. The two network domains include an access network that implements MPLS-TP and a core network that implements IP, MPLS, or a combination of both. The primary BN establishes a tunnel from itself to the standby BN, and re-directs network data traffic from itself to the standby BN via the tunnel when it detects that an access node has switched connection from the primary VN to the standby BN. The primary BN also monitors its connections to the core network, and signals access nodes to switch to the standby BN if a failure is detected in these connections.
Abstract:
IP addresses are efficiently assigned and advertised across the boundary of two network domains. The two network domains include an access network that implements MPLS-TP and a core network that implements IP, MPLS, or a combination of both. A primary BN at the domain boundary receives an assignment of an IP prefix for a VPN that connects a set of CEs to one or more SNs. The IP prefix represents a pool of IP addresses. The primary BN assigns only one IP address to both itself and a standby BN for the VPN to minimize the use of assigned IP addresses. The primary BN assigns the other IP addresses to the CEs in the VPN. The primary BN then advertises the IP prefix into the core network to enable routing of network data traffic across the network domain boundary.
Abstract:
A network element implementing Multiprotocol Label Switching to automatically create an optimal deterministic back-up Label Switch Path (LSP) that is maximally disjointed from a primary LSP to provide a reliable back up to the primary LSP. The network element receives a request for a generation of an LSP, determines that the request for the generation of the LSP is for the back-up LSP, locates each link of the primary LSP in a traffic engineering database, modifies each link of the primary LSP to have a link cost significantly greater than an actual link cost to discourage use of each link of the primary LSP in the back-up LSP, executes a Constrained Shortest Path First algorithm to obtain the back-up LSP, wherein the back-up LSP has a maximum disjointedness from the primary LSP due to a modified cost of each link of the primary LSP, and returns the back-up LSP.
Abstract:
MPLS (Multiprotocol Label Switching) fast re-routing using LDP (Label Distribution Protocol) is described. A first network element in a MPLS network receives a first label advertised from a second network element in the MPLS network. The first network element computes a shortest path tree (SPT) to reach a destination network element under a potential failure condition. The second network element is a nexthop of the first network element in the computed SPT and is not upstream from the potential failure condition. The first network element advertises a second label to one or more third network elements for a backup LDP LSP (Label Switched Path) that will serve as a backup when the potential failure condition is realized. The third network element(s) are upstream neighbors on the computed SPT with respect to the first network element. The first network element installs a swap action from the second label to the first label.
Abstract:
A network element implementing Multiprotocol Label Switching to automatically create an optimal deterministic back-up Label Switch Path (LSP) that is maximally disjointed from a primary LSP to provide a reliable back up to the primary LSP. The network element receives a request for a generation of an LSP, determines that the request for the generation of the LSP is for the back-up LSP, locates each link of the primary LSP in a traffic engineering database, modifies each link of the primary LSP to have a link cost significantly greater than an actual link cost to discourage use of each link of the primary LSP in the back-up LSP, executes a Constrained Shortest Path First algorithm to obtain the back-up LSP, wherein the back-up LSP has a maximum disjointedness from the primary LSP due to a modified cost of each link of the primary LSP, and returns the back-up LSP.
Abstract:
A method implemented by a first provider equipment (PE) device to enable operations, administration and management (OAM) functionality over a pseudo-wire (PW) between the first PE device and a second PE device, wherein the PW traverses a packet switched network and carries control channel messages and a flow of data packets, and where the packet switched network includes nodes that use information outside a pseudo-wire label stack of the data packets for determining multi-path routing, the method including receiving a control channel message at the first PE to be forwarded over the pseudo-wire to the second PE, and prefixing the control channel message with a pseudo-flow header to ensure that the control channel message is forwarded over a same route by the nodes of the packet switched network as the data packets of the flow, thereby enabling OAM functionality to be accurately performed for the pseudo-wire.
Abstract:
Fast flooding based fast convergence to recover from a network failure. A router detects a network failure, and responsive to that failure, transmits a fast failure notification message to a set of one or more routers. The fast failure notification message includes information that identifies the network failure and also indicates that the fast failure notification message is to be flooded by the set of routers independently of convergence. The router updates a routing table to reflect the network failure. The transmission of the fast failure notification message is performed prior to completion of the routing table update to reflect the network failure.
Abstract:
A method and apparatus that operates two bridging protocols in a hybrid bridging node is described. The operation of the two bridging protocols in the hybrid node allows for an incremental transition of a provider bridging network from operating a legacy bridging protocol that shares MAC addresses to a bridging network that operates VPLS and/or PBB bridging protocols. The hybrid bridging node selectively broadcasts unicast packets with unknown MAC addresses from the nodes operating VPLS and/or PBB to nodes operating a legacy bridging protocol.