Patent application number | Description | Published |
20090161531 | INTELLIGENT DATABASE EXCHANGE FOR OSPF - The present invention relates to systems and methods for eliminating unnecessary link state database exchanges and processes when two OSPF routers are forming a full adjacency. In particular, the invention provides methods and mechanisms for deducing information about unreachable routers from link state changes received, recording the information about the unreachable routers for a given period of time, constructing a neighbor database summary list that does not contain the LSAs that the neighbor has through using the information about the unreachable routers and reachable routers, and determining whether the neighbor router is restarted after it becomes unreachable. In addition, the present invention provides a few of options to deduce and use the information about the unreachable routers and the information in the link state database for eliminating unnecessary link state database exchanges and processes. | 06-25-2009 |
20090245253 | Computing Point-to-Multipoint Paths - 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. | 10-01-2009 |
20090252058 | Multi-Protocol Label Switching Multi-Topology Support - 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. | 10-08-2009 |
20090274066 | SYSTEMS AND METHODS FOR IMPLEMENTING MULTI-TOPOLOGY SUPPORT FOR LABEL DISTRIBUTION PROTOCOL (LDP) OF A MULTIPROTOCOL LABEL SWITCHING NETWORK - 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. | 11-05-2009 |
20090303904 | System and Method for Multi-Topology Support - 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. | 12-10-2009 |
20100177631 | Protecting Ingress and Egress of a Label Switched Path - An apparatus comprising a backup node coupled to an ingress node of a point-to-multipoint (P2MP) label switched path (LSP) and to a plurality of next-hop nodes of the ingress node of the P2MP LSP via a backup tree, wherein the backup node and the ingress node are both coupled to an external node, and wherein the backup node is configured to ensure data delivery in the P2MP LSP when the ingress node fails. Included is a network component comprising at least one processor configured to implement a method comprising detecting a failure in an ingress node of a P2MP LSP, receiving a data packet destined for the ingress node and to be transported by the P2MP LSP from a provider node when the ingress node fails, and transmitting the data packet on a backup tree that merges with the P2MP LSP prior to reaching an egress node. | 07-15-2010 |
20100208733 | System and Method for Point to Multipoint Inter-Domain Multiprotocol Label Switching Traffic Engineering Path Calculation - A system comprising a plurality of path computation elements (PCEs) configured to communicate with an ingress node, jointly compute a core tree for an inter-domain point-to-multipoint (P2MP) tree across a plurality of network domains, and independently compute a plurality of sub-trees in at least some of the network domains, wherein the core tree connects the ingress node to a boundary node (BN) in each one of the network domains that have a destination node and each sub-tree connects the BN to a plurality of destination nodes in one of the network domains that have a destination node. | 08-19-2010 |
20110199891 | System and Method for Protecting Ingress and Egress of a Point-to-Multipoint Label Switched Path - A network comprising a first edge node, a second edge node, a third edge node that backs up either the first edge node or the second edge node, and an internal node coupled to the first edge node, the second edge node, and the third edge node, wherein a point-to-multipoint (P2MP) label switched path (LSP) extends across the network from the first edge node, through the internal node, and to the second edge node, and wherein a LSP sub-tree extends between the third edge node and the internal node, but does not extend across the network. | 08-18-2011 |
20110211445 | System and Method for Computing a Backup Ingress of a Point-to-Multipoint Label Switched Path - Disclosed is an apparatus that includes a path computation element (PCE) configured to communicate with a path computation client (PCC) and compute a backup ingress node for a Point-to-Multipoint (P2MP) Label Switched Path (LSP) in a network associated with the PCC. The backup ingress node is coupled to an ingress node of the P2MP LSP and to a plurality of next-hop nodes of the ingress node of the P2MP LSP via a backup tree. | 09-01-2011 |
20110235503 | System and Method for Communications System Routing Component Level High Availability - A system and method for communications system routing component level high availability are provided. A method for providing routing component level high availability includes synchronizing information from an active information source, detecting a failure in a routing component, replacing the failed routing component with a backup routing component, and completing synchronization of the information. | 09-29-2011 |
20120042205 | System and Method for Completeness of TCP Data in TCP HA - System and method for completeness of transmission control protocol (TCP) high availability (HA) are disclosed. The system includes an active processor, having an application and a TCP, and a standby processor, having another application and another TCP; wherein communications among the active application, the active TCP, the standby application and the standby TCP quickly and efficiently enable the system seamlessly switching over from the active processor to the standby processor for transmission of incoming TCP data streams and outgoing TCP data streams if the active processor fails. | 02-16-2012 |
20120057593 | Computing Point-to-Multipoint Paths - 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. | 03-08-2012 |
20120092986 | System And Method For Computing A Backup Egress Of A Point-To-Multi-Point Label Switched Path - An apparatus for requesting computation of a backup egress path comprising a processor configured to send a path computation element (PCE) protocol (PCEP) request (PCReq) message requesting computation of the backup egress path to protect against a fault in a primary egress path of a Point to Multi-Point (P2MP) or Point-to-Point (P2P) label switched path (LSP), wherein the backup egress path extends from a previous-hop internal node of the primary egress node of the P2MP or P2P LSP to a backup egress node. A method for advertising or discovering a backup egress path computation capability comprising exchanging a message that indicates that a PCE comprises a backup egress path computation capability. | 04-19-2012 |
20120136944 | Method For Dynamic Discovery of Control Plane Resources and Services - An apparatus comprising a processor configured to discover one or more peer processors associated with a network component in a dynamic manner by detecting an announcement message from a peer processor, wherein the announcement message is multicast from the peer processor when the peer processor is added or activated on the network component. | 05-31-2012 |
20120137012 | Method for Dynamic On Demand Startup of a Process or Resource - An apparatus comprising a processor configured to startup a new process on a peer processor to off-load a load of a local process on the processor in a dynamic manner based on monitoring an amount of resources used by the processor, wherein the startup of the new process on the peer processor is initiated when the amount of resources used by the local process reaches a threshold. | 05-31-2012 |
20120195229 | System and Method for Computing Point-To-Point Label Switched Path Crossing Multiple Domains - Disclosed is an apparatus comprising a plurality of path computation elements (PCEs) associated with a plurality of inter-coupled domains and configured to communicate with a path computation client (PCC) associated with one of the domains and to implement a Forward Search Path Computation (FSPC) for a preferred path crossing the domains from a source node in a source domain of the plurality of inter-coupled domains to a destination node in a destination domain of the plurality of inter-coupled domains, wherein the preferred path is computed without using a determined order of the domains from the source domain to the destination domain. | 08-02-2012 |
20120209989 | Method for Dynamic Migration of a Process or Services from One Control Plane Processor to Another - An apparatus comprising a processor configured to migrate load from a source process running on the processor to a target process running on a peer processor in a dynamic manner by monitoring an amount of resources used by the source process, wherein the load is migrated when the amount of resources utilized by the source process exceeds a threshold. Also disclosed is a network component comprising a first processor configured to select a source process to migrate a load from the first processor based on available resources on the first processor and the source process; and a second processor configured upon receiving a migration request from the first processor to one of select and start a target process to which to migrate the load based on available resources for the second processor and the target process. | 08-16-2012 |
20120213224 | System and Method for Finding Point-to-Multipoint Label Switched Path Crossing Multiple Domains - An apparatus associated with a first domain, the apparatus comprising a processor configured to compute a portion of a Point-to-Multipoint (P2MP) path, wherein the P2MP path spans a plurality of domains including the first domain, wherein the apparatus does not require knowledge of a core tree of domains to compute the portion of the P2MP path. | 08-23-2012 |
20120243443 | System and Method for Topology Transparent Zoning in Network Communications - An Autonomous System domain comprising a topology transparent zone comprising a plurality of topology transparent zone nodes at least some of which are topology transparent zone edge nodes, wherein the topology transparent zone nodes are interconnected with one another via a plurality of internal links, and a plurality of neighboring external nodes connected to the topology transparent zone edge nodes via a plurality of external links, wherein no link state advertisements (LSAs) describing the internal links are distributed to the neighboring external nodes. | 09-27-2012 |
20120250583 | Multi-Protocol Label Switching Multi-Topology Support - 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. | 10-04-2012 |
20120275461 | Systems and Methods for Implementing Multi-Topology Support for Label Distribution Protocol (LDP) of a Multiprotocol Label Switching Network - 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. | 11-01-2012 |
20130016605 | Procedures for Finding a Backup Ingress of a Point-to-Multipoint Label Switched Path - A method comprising receiving a request from a network component to find a backup ingress node for an ingress node of a point-to-multipoint (P2MP) label switched path (LSP), determining a plurality of candidate backup ingress nodes that satisfy a plurality of constraints, including being an edge node in the ingress node's domain and having a direct link to the ingress node, a path to each next hop node of the ingress node of the P2MP LSP, and a path from a source node that communicates with the ingress node, wherein the determination is in response to receiving the request, selecting the backup ingress node from the candidate backup ingress nodes that has a minimum cost of paths from the source node to the next hop nodes via the backup ingress node; and sending a reply to the network component that indicates the selected backup ingress node. | 01-17-2013 |
20130034103 | System and Method for Finding Segments of Path for Label Switched Path Crossing Multiple Domains - An apparatus comprising a path computation element (PCE) associated with a domain in a network and configured to find a segment of a Multiprotocol Label Switching (MPLS) Traffic Engineering (TE) Label Switched Path (LSP) that crosses a plurality of domains in the network using a Constraint Shortest Path First (CSPF) algorithm or a reverse CSPF algorithm that computes a plurality of shortest paths in the domain of which the segment is selected, wherein the CSPF algorithm or the reverse CSPF algorithm is selected to reduce the number of shortest path computations in the domain based on the number of starting nodes and ending nodes that are considered for computing the shortest paths in the domain. | 02-07-2013 |
20130089005 | Simple Topology Transparent Zoning in Network Communications - An autonomous system (AS) comprising a topology transparent zone (TTZ) comprising a plurality of TTZ nodes, wherein the plurality of TTZ nodes includes an edge node and an internal node, wherein each of the plurality of TTZ nodes is configured to connect to another TTZ node via an internal link, and a plurality of neighboring external nodes connected to the TTZ edge nodes via a plurality of external links, wherein no link state advertisements (LSAs) describing the internal links are distributed to the neighboring external nodes. | 04-11-2013 |
20130254195 | System and Method for Traffic Engineering Information Summary of a Zone in Network Communications - A method for summarizing topology transparent zone (TTZ) traffic engineering (TE) information, comprising computing a TE link state for every TE link internal to a TTZ from a root node to one or more non-root edge nodes, wherein the TE link state comprises the maximum bandwidth of the link, summarizing the computed TE link state information and storing the summary in a memory, and distributing at least a portion of the information in the summary to at least one neighboring node external to the TTZ connected to the root node via an external link. | 09-26-2013 |
20140241372 | Constructing A Topology-Transparent Zone - A network node used to construct a topology-transparent zone (TTZ). The network node may obtain a TTZ identifier (ID) that is uniquely associated with a TTZ. Additionally, the network node may obtain a first link that couples the network node to a second network node that is also assigned the TTZ ID and a second link that couples the network node to a third network node that is not assigned the TTZ ID. The network node may generate a router information (RI) link-state advertisement (LSA) that indicates whether the network node is a TTZ edge node or a TTZ internal node and that indicates the TTZ associated with the TTZ. The network node may distribute the RI LSA to the second network node that is also assigned the TTZ ID using the first link. | 08-28-2014 |
20140254427 | Discovering a Topology-Transparent Zone - A network node used to discover a topology-transparent zone (TTZ). In one example embodiment, the network node may obtain a TTZ identifier (ID) that is uniquely associated with the TTZ. Additionally, the network node may identify a link connected to a second network node that is also assigned the TTZ ID. In response to the command to initiate discovering the TTZ, the network node may generate a router information (RI) link-state advertisement (LSA) that comprises the TTZ ID and may distribute the RI LSA to the second network node using the link. In another example embodiment, the network node may not be configured as a TTZ edge node and may receive an RI LSA comprising the TTZ ID. The network node may store at least a portion of the information within the RI LSA and may flood the RI LSA using a plurality of links. | 09-11-2014 |
20140355414 | Label Switched Path Network Failure Detection And Traffic Control - A method for providing ingress fault protection in a label switched network, comprising sending data traffic from a source node to a first label switched path (LSP) via a first ingress node, detecting a first fault using a first fault detection link between the source node and the first ingress node, sending the data traffic from the source node to a second LSP via a second ingress node in response to detecting the first fault, detecting a second fault using a second fault detection link between the first ingress node and the second ingress node, and merging the data traffic from the second LSP into the first LSP at a next-hop node of the first ingress node, wherein the data traffic is no longer sent to the first LSP via the first ingress node after the first fault. | 12-04-2014 |
20140362856 | System and Method for Finding Point-to-Multipoint Label Switched Path Crossing Multiple Domains - An apparatus associated with a first domain, the apparatus comprising a processor configured to compute a portion of a Point-to-Multipoint (P2MP) path, wherein the P2MP path spans a plurality of domains including the first domain, wherein the apparatus does not require knowledge of a core tree of domains to compute the portion of the P2MP path. | 12-11-2014 |
20140369185 | Next Hop Ingress Protection Of Label Switched Paths - A network node for providing ingress fault protection. The network node may be along a primary label switched path (LSP) and may be configured to receive an ingress protection request message that identifies one or more other network nodes along the primary LSP. The network node may generate a forwarding table that comprises one or more forwarding entries for the other network nodes along the primary LSP and one or more forwarding entries for the other network nodes along a backup LSP. In typical operation, the network node may receive data traffic from a first source path within a label switched network and may send the data traffic using the primary LSP. When an ingress node fault in the first source path is present, the network node may receive data traffic from a second source path and may send the data traffic using the backup LSP. | 12-18-2014 |
20150023150 | Establishing and Protecting Label Switched Paths Across Topology-Transparent Zones - A label switched path (LSP) establishing method comprising receiving a first path message from a network node outside of a topology-transparent zone (TTZ) along a path for the LSP, computing a TTZ path through the TTZ from the network component to an egress TTZ edge node along the LSP, sending a second path message to a TTZ internal node along the TTZ path, receiving a first reservation (RESV) message from the TTZ internal node that comprises a label allocated for the egress TTZ edge node, and sending a second RESV message that comprises a label allocated for the network component and the label allocated for the egress TTZ edge node to the network node. | 01-22-2015 |
20150036481 | System and Method for Computing a Backup Ingress of a Point-to-Multipoint Label Switched Path - A method of Path Computation Element (PCE) Communication Protocol (PCEP) communication includes sending, to a path computation element (PCE), a request to compute a backup ingress node for a Point-to-Multipoint (P2MP) Label Switched Path (LSP) in a network, and receiving, from the PCE, the backup ingress node for the P2MP LSP in accordance with the request. | 02-05-2015 |
20150085639 | Protecting a Label Switched Path Egress Without Using Downstream Labels - A computer program product comprising computer executable instructions stored on a non-transitory computer readable medium such that when executed by a processor cause a network element to protect a label switched network against egress node failure by receiving a primary service label and a backup service label from an upstream node in the network, receiving data traffic comprising the primary service label from the upstream node for transmitting to a downstream node in the network, determining a status of a primary egress node in the network, the primary egress node being associated with a primary label switching path, forwarding the data traffic according to a primary label switching path when the primary egress node is operating properly, and replacing the primary service label with the backup service label and forwarding the data traffic according to a backup label switching path when the primary egress node has failed. | 03-26-2015 |