Patents by Inventor Alfred C. Lindem, III
Alfred C. Lindem, III has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20160112298Abstract: A network element that acts as a hub in a hub and spoke topology is configured to limit the amount of topology and reachability information that is advertised to a set of one or more remote network elements that act as one or more spokes in the hub and spoke topology in a same routing area. The network element generates a set of one or two link state advertisements (LSAs) to advertise over an interface that connects at least one of the set of remote network elements to the network element, wherein the set of LSAs includes information that describes a connection to the set of remote network elements and one or more aggregate routes. The network element advertises, during a database exchange process with the one of the set of remote network elements, the set of LSAs to the one of the set of remote network elements.Type: ApplicationFiled: December 30, 2015Publication date: April 21, 2016Inventors: Alfred C. Lindem, III, Ing-Wher Chen
-
Publication number: 20160072664Abstract: A method is implemented by a network device in a network having a plurality of nodes. The method computes a remote loop free alternative (RLFA) next hop as a backup for a primary path next hop. The method improves RLFA computation efficiency for a Q-Space list of nodes in a Q-space for an endpoint node by reducing calculations of the loop free condition for a path from a source node to a destination node via a tunnel between the source node and the endpoint node. The method includes adding a neighbor node to a poison list where the candidate node is in the poison list and the neighbor node is not in the candidate list, the poison list indicating that a node is not a candidate for Q-Space, and determining the Q-Space list by removing nodes from poison list from the plurality of nodes.Type: ApplicationFiled: September 8, 2014Publication date: March 10, 2016Inventors: Alfred C. Lindem, III, Lars Ernstrom, Vasant Patil
-
Patent number: 9264343Abstract: A network element that acts as a hub in a hub and spoke topology is configured to limit the amount of topology and reachability information that is advertised to a set of one or more remote network elements that act as one or more spokes in the hub and spoke topology in a same routing area. The network element generates a set of one or two link state advertisements (LSAs) to advertise over an interface that connects at least one of the set of remote network elements to the network element, wherein the set of LSAs includes information that describes a connection to the set of remote network elements and one or more aggregate routes. The network element advertises, during a database exchange process with the one of the set of remote network elements, the set of LSAs to the one of the set of remote network elements.Type: GrantFiled: August 8, 2012Date of Patent: February 16, 2016Assignee: Telefonaktiebolaget L M Ericsson (publ)Inventors: Alfred C. Lindem, III, Ing-Wher Chen
-
Patent number: 9253079Abstract: A method is implemented by a network element to improve efficiency of loop free alternative (LFA) path computation by caching data from a shortest path first calculation for use in the LFA path calculation. The shortest path first calculation determines a shortest path from a source vertex to each vertex in a network topology graph representing the network in which the network element operates, where an endpoint for each shortest path is the shortest path vertex, and where each shortest path determined by the shortest path first calculation is stored.Type: GrantFiled: October 11, 2013Date of Patent: February 2, 2016Assignee: Telefonaktiebolaget L M Ericsson (publ)Inventors: Lars Ernström, Alfred C. Lindem, III, Pramodh D'Souza, Evgeny Tantsura
-
Patent number: 9225629Abstract: A method is implemented by a network device to improve efficiency of computing a node-protecting remote loop-free alternate (LFA) in a network topology graph. The method computes a reverse shortest path first (SPF) algorithm rooted at the primary next hop node, where the reverse SPF algorithm rooted at the primary next hop maintains a reverse path of a shortest path computed by the reverse SPF algorithm rooted at the primary next hop node. The method selects a node that is in both the source node's node-protecting extended P-space that protects the primary next hop node and the primary next hop node's link-protecting Q-space that protects the S-E link.Type: GrantFiled: May 30, 2014Date of Patent: December 29, 2015Assignee: Telefonaktiebolaget L M Ericsson (publ)Inventors: Alfred C. Lindem, III, Lars Ernstrom, Vasant Patil
-
Publication number: 20150350062Abstract: A method is implemented by a network device to improve efficiency of computing a node-protecting remote loop-free alternate (LFA) in a network topology graph. The method computes a reverse shortest path first (SPF) algorithm rooted at the primary next hop node, where the reverse SPF algorithm rooted at the primary next hop maintains a reverse path of a shortest path computed by the reverse SPF algorithm rooted at the primary next hop node. The method selects a node that is in both the source node's node-protecting extended P-space that protects the primary next hop node and the primary next hop node's link-protecting Q-space that protects the S-E link.Type: ApplicationFiled: May 30, 2014Publication date: December 3, 2015Applicant: Telefonaktiebolaget L M Ericsson (publ)Inventors: Alfred C. Lindem, III, Lars Ernstrom, Vasant Patil
-
Publication number: 20150172256Abstract: An automated key transition method is executed by a node in a network. The network includes a set of nodes utilizing a current key identifier. A key identifier specifies an authentication protocol and an authentication key for use in the authentication of intermediate-system to intermediate-system (IS-IS) protocol data units. The method includes a set of steps including receiving a message at the node, where, the message includes a most recent key identifier to replace the current key identifier, verifying whether all reachable nodes in the set of nodes have advertised the most recent key identifier, continuing authentication using the current key identifier until all reachable nodes in the set of nodes have been verified to advertise the most recent key identifier, and switching authentication at the node to use the most recent key identifier upon verification that all reachable nodes in the set of nodes have advertised the most recent key identifier.Type: ApplicationFiled: February 19, 2015Publication date: June 18, 2015Inventors: Uma S. Chunduri, Wenhu Lu, Alfred C. Lindem, III
-
Patent number: 9043487Abstract: A technique dynamically configures and verifies routing information of broadcast networks using link state protocols in a computer network. According to the novel technique, a router within the broadcast network receives a link state protocol routing information advertisement from an advertising router, e.g., a designated router or other adjacent neighbor. The router learns of a next-hop router (“next-hop”) to reach a particular destination from the advertisement, and determines whether the next-hop is located within the same broadcast network (e.g., subnet) as the designated router. If so, the router further determines whether the next-hop is directly addressable (i.e., reachable), such as, e.g., by checking for link adjacencies to the next-hop or by sending request/reply messages (e.g., echo messages or “ping” messages) to the next-hop. In the event the next-hop for the destination is not directly addressable by the router (e.g.Type: GrantFiled: April 18, 2006Date of Patent: May 26, 2015Assignee: Cisco Technology, Inc.Inventors: Alvaro E. Retana, Alfred C. Lindem, III, Russ White
-
Patent number: 9014187Abstract: 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.Type: GrantFiled: December 13, 2010Date of Patent: April 21, 2015Assignee: Telefonaktiebolaget L M Ericsson (Publ)Inventors: Wenhu Lu, Alfred C. Lindem, III
-
Publication number: 20150103671Abstract: A method is implemented by a network element to improve efficiency of loop free alternative (LFA) path computation by caching data from a shortest path first calculation for use in the LFA path calculation. The shortest path first calculation determines a shortest path from a source vertex to each vertex in a network topology graph representing the network in which the network element operates, where an endpoint for each shortest path is the shortest path vertex, and where each shortest path determined by the shortest path first calculation is stored.Type: ApplicationFiled: October 11, 2013Publication date: April 16, 2015Applicant: Telefonaktiebolaget L M Ericsson (publ)Inventors: Lars Ernström, Alfred C. Lindem, III, Pramodh D'Souza, Evgeny Tantsura
-
Patent number: 8995667Abstract: An automated key transition method is executed by a node in a network. The network includes a set of nodes utilizing a current key identifier provided by a group key management server or provisioned manually. A key identifier specifies an authentication protocol and an authentication key for use in the authentication of intermediate-system to intermediate-system (IS-IS) protocol data units. The method includes receiving a message from the group key management server that includes a most recent key field to replace the current key identifier, advertising the most recent key identifier to all reachable nodes, verifying whether all reachable nodes have advertised the most recent key identifier, continuing authentication using the current key identifier until all reachable nodes have been verified to advertise the most recent key identifier, and switching authentication to use the most recent key identifier upon verification that all reachable nodes have advertised the most recent key identifier.Type: GrantFiled: February 21, 2013Date of Patent: March 31, 2015Assignee: Telefonaktiebolaget L M Ericsson (publ)Inventors: Uma S. Chunduri, Wenhu Lu, Alfred C. Lindem, III
-
Patent number: 8964758Abstract: A network element is configured to reduce the synchronization costs for implementing Open Shortest Path First (OSPF) Nonstop routing (NSR). The reduced synchronization costs are achieved by reducing the number of acknowledgement messages that are needed to be sent though reliable inter-process communication (IPC) between the active OSPF instance and the standby OSPF instance. The number of acknowledgement messages is reduced by tracking the link state advertisements (LSAs) that have been sent by the active OSPF instance to the standby OSPF instance and by the standby OSPF replying with an acknowledgement of only the last LSA in a group of LSAs received from the active OSPF instance, where the group can have a variety of boundaries such as a group of LSAs in an IPC message. This avoids having a significant number of acknowledgement messages sent through the IPC.Type: GrantFiled: January 12, 2012Date of Patent: February 24, 2015Assignee: Telefonaktiebolaget L M Ericsson (publ)Inventors: Wenhu Lu, Ing-Wher Chen, Alfred C. Lindem, III
-
Patent number: 8958430Abstract: Open Shortest Path First (OSPF) Non-stop Routing (NSR) with frozen standby LSDB is described. A network element includes a first OSPF instance initially acting as an active OSPF instance and a second OSPF instance initially acting as a standby OSPF instance. The second OSPF instance receives LSAs from the first OSPF instance and installs the LSAs in its LSDB. The LSAs in the LSDB are only aged by the active OSPF instance. If and when the second OSPF instance becomes the active OSPF instance, the second OSPF instance then ages the LSAs in the LSDB and processes each of the LSAs according to the aging of that LSA, where processing includes one of purging that LSA and refreshing that LSA.Type: GrantFiled: January 12, 2012Date of Patent: February 17, 2015Assignee: Telefonaktiebolaget L M Ericsson (Publ)Inventors: Ing-Wher Chen, Wenhu Lu, Alfred C. Lindem, III
-
Publication number: 20150016242Abstract: A method is implemented by a network element for determining a next hop of a backup path for a fast reroute process to be utilized in response to a network event invalidating a primary path to a destination node. The method reduces computational requirements of the network element by reducing a number of paths to be evaluated without affecting selection of the backup path. The method selects a neighbor node P of a source node S to calculate a shortest path tree (SPT) for P for use in identifying backup paths for S. The SPT is calculated for P, pruning paths from the SPT that traverse S or that fail an LFA condition. P is selected for the next hop of the backup path for a destination node X where the SPT of P provides an LFA path from S to the destination node X.Type: ApplicationFiled: July 12, 2013Publication date: January 15, 2015Inventors: Lars Ernström, Alfred C. Lindem, III, Pramodh D'Souza, Evgeny Tantsura
-
Patent number: 8923312Abstract: 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.Type: GrantFiled: January 6, 2012Date of Patent: December 30, 2014Assignee: Telefonaktiebolaget L M Ericsson (Publ)Inventors: Ing-Wher Chen, Wenhu Lu, Alfred C. Lindem, III
-
Patent number: 8913485Abstract: OSPF NSR with link derivation synchronization is described. When a network element having an active OSPF instance and a standby OSPF instance attempts to create a FULL adjacency with a neighbor network element using a neighbor data structure of the active OSPF instance, and if and when a switch causes the second OSPF instance to act as the active OSPF instance, neighbor information is retrieved from the LSAs of the standby OSPF instance and a link is derived between the network element and the neighbor network element based on the retrieved neighbor information. In one embodiment, the standby OSPF instance retrieves virtual neighbor information from its LSAs and derives a virtual link between the network element and the neighbor network element based on the retrieved virtual neighbor information without having to synchronize the neighbor information between the active and standby OSPF instance.Type: GrantFiled: January 13, 2012Date of Patent: December 16, 2014Assignee: Telefonaktiebolaget L M Ericsson (Publ)Inventors: Wenhu Lu, Ing-Wher Chen, Alfred C. Lindem, III
-
Patent number: 8855113Abstract: 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.Type: GrantFiled: September 12, 2012Date of Patent: October 7, 2014Assignee: Telefonaktiebolaget L M Ericsson (publ)Inventors: Wenhu Lu, Alfred C. Lindem, III, Uma S. Chunduri
-
Patent number: 8717935Abstract: 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.Type: GrantFiled: December 2, 2011Date of Patent: May 6, 2014Assignee: Telefonaktiebolaget L M Ericsson (publ)Inventors: Alfred C. Lindem, III, Wenhu Lu, Ing-Wher Chen
-
Publication number: 20140010117Abstract: A network element that acts as a hub in a hub and spoke topology is configured to limit the amount of topology and reachability information that is advertised to a set of one or more remote network elements that act as one or more spokes in the hub and spoke topology in a same routing area. The network element generates a set of one or two link state advertisements (LSAs) to advertise over an interface that connects at least one of the set of remote network elements to the network element, wherein the set of LSAs includes information that describes a connection to the set of remote network elements and one or more aggregate routes. The network element advertises, during a database exchange process with the one of the set of remote network elements, the set of LSAs to the one of the set of remote network elements.Type: ApplicationFiled: August 8, 2012Publication date: January 9, 2014Inventors: Alfred C. Lindem, III, Ing-Wher Chen
-
Publication number: 20140003289Abstract: In one embodiment, a first router determines whether a network coupling the first router to one or more second routers is transit-only, wherein transit-only indicates connecting only routers to provide for transmission of data from router to router. When the network is transit-only, the first router generates an Open Shortest Path First (OSPF) Link State Advertisement (LSA) that includes an address for the network and a designated network mask. The designated network mast operates as a transit-only identification that indicates the address should not be installed in a Routing Information Base (RIB) upon receipt of the OSPF LSA at the one or more second routers. When the network is not transit-only, the first router generates an OSPF LSA that includes the address for the network but does not include the designated network mask, to permit installation of the address in a RIB upon receipt of the OSPF LSA at the one or more second routers.Type: ApplicationFiled: August 29, 2013Publication date: January 2, 2014Applicant: Cisco Technology, Inc.Inventors: Yi Yang, Alvaro E. Retana, James Ng, Abhay Roy, Alfred C. Lindem, III, Sina Mirtorabi, Timothy M. Gage, Syed Khalid Raza