摘要:
Methods and apparatus for a network element to handle LSID collisions to prevent different LSAs associated with different routes from sharing the same LSID. According to one embodiment, responsive to determining that a tentative LSID that is generated for a first route that is being added collides with an LSID that is assigned to an LSA for a second route, and that one of the first and second routes is a host route, the host route is suppressed. If the first route is the host route, suppressing includes not originating an LSA for the first route. If the second route is the host route, suppressing includes purging the LSA for the second route and not originating an LSA for the second route. Although the host route is suppressed, network reachability of the range subsuming the host route is provided through the route that is not the host route.
摘要:
A network element of a communications network includes a fresh route queue, a stale route queue, a Routing Information Base (RIB), a network interface, and a routing protocol module. The network interface receives link state information from other network elements. The routing protocol module determines a plurality of routes from the link state information. The routing protocol module identifies among the plurality of routes a subset of routes that are present in the stale route queue, adds the subset of routes to the fresh route queue, and deletes the subset of routes from the stale route queue. The routing protocol module then remove routes in the RIB that correspond to any routes remaining in the stale route queue, and moves the routes from the fresh route queue to the stale route queue. Related methods for managing routes in a RIB of a network element are disclosed.
摘要:
A network element is configured for open shortest path first (OSPF) non-stop routing (NSR) with reliable flooding. An active OSPF instance determines to flood a link-state advertisement (LSA). The LSA is synchronized with a backup OSPF instance including storing the LSA with a status that indicates that flooding is pending. The active OSPF instance attempts to reliably flood the LSA to a set of adjacent network elements of the flooding scope of the LSA. If flooding of the LSA completes, the active OSPF instance causes the backup OSPF instance to alter the status of the LSA to indicate that flooding is complete. If the backup OSPF instance becomes the currently active OSPF instance prior to the flooding of the LSA completing, then the new active OSPF instance attempts to reliably flood the LSA.
摘要:
A network element is configured for synchronizing dynamic OSPF data between an active OSPF instance and a backup OSPF instance. Upon an OSPF data synchronization event, the active OSPF instance synchronizes dynamic OSPF data with the backup OSPF instance. Upon receiving the dynamic OSPF data, the backup OSPF instance determines whether the requisite data structures exist. If the data structures do not exist, the backup OSPF instance returns a NACK to the active OSPF instance and clears its dynamic OSPF data. Responsive to receiving the NACK, the active OSPF instance resynchronizes its dynamic OSPF data with the backup OSPF instance.
摘要:
A network element attempts to bring up an adjacency with a neighbor using a neighbor state machine (NSM) of an active OSPF instance, including: maintaining a neighbor data structure only in the active instance prior to the NSM transitioning to a Full state, delaying synchronization from the active instance to a standby OSPF instance of the neighbor data structure, maintaining tracking information of the NSM in only the active instance; installing LSAs received from the neighbor in both the LSDB of the active and standby instances, and, if and when the NSM of the active instance transitions to the Full state and all LSAs requested from the neighbor during database exchange are ensured to synchronize to the standby instance's LSDB, synchronizing from the active instance to the standby instance data item(s) of the neighbor data structure.
摘要:
Methods and apparatus for a network element to handle LSID collisions to prevent different LSAs associated with different routes from sharing the same LSID. According to one embodiment, responsive to determining that a tentative LSID that is generated for a first route that is being added collides with an LSID that is assigned to an LSA for a second route, and that one of the first and second routes is a host route, the host route is suppressed. If the first route is the host route, suppressing includes not originating an LSA for the first route. If the second route is the host route, suppressing includes purging the LSA for the second route and not originating an LSA for the second route. Although the host route is suppressed, network reachability of the range subsuming the host route is provided through the route that is not the host route.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
A method and apparatus for LDP-IGP synchronization for broadcast networks. In one embodiment of the invention, responsive to a network element bringing up an adjacency with a Designated Router of the broadcast network on a broadcast interface, that network element advertises in its Link State Advertisement (LSA) a peer-to-peer (P2P) adjacency to each member of the broadcast network that has bidirectional IGP communication with the network element instead of advertising a pseudo-node adjacency to the pseudo-node of the broadcast network. Each P2P adjacency includes a high cost to discourage use of those links for transit traffic. After LDP becomes operational with all neighbors on the broadcast interface, the network element advertises the pseudo-node adjacency instead of the P2P adjacencies. Accordingly, transit traffic is avoided through that network element until LDP is operational with all neighbors on the broadcast interface.