Patents by Inventor Alfred C. Lindem
Alfred C. Lindem 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: 20230318866Abstract: According to certain embodiments, a method by a router in a software-defined wide-area network (SDWAN) includes determining one or more replicators in the SDWAN and generating a multicast distribution tree that includes the determined one or more replicators. The method further includes receiving multicast traffic from a source and creating a (S,G) route for the received multicast traffic. The method further includes replicating the multicast traffic using the multicast distribution tree.Type: ApplicationFiled: March 31, 2022Publication date: October 5, 2023Inventors: Manikandan Panchanathan, Vengada Prasad Govindan, Alfred C. Lindem, III
-
Publication number: 20220311630Abstract: The present disclosure is directed to a centralized control policy for multicast replicator selection.Type: ApplicationFiled: June 13, 2022Publication date: September 29, 2022Inventors: Alfred C. Lindem, III, Ravi Kiran Chintallapudi, Gaurav Shrivastava, Jining Tian, Praleshkumar Gunvantray Patel
-
Patent number: 11394606Abstract: The present disclosure is directed to systems and methods for auto-provisioning hubs and spokes in a SD-WAN network, and includes the performance of operations and/or the steps of receiving first information from a first network hub, the first network hub one of a plurality of network hubs, the first information indicating a first set of properties associated with the first network hub; publishing the first information to a plurality of network spokes, the plurality of network spokes determining whether to subscribe to the first network hub based on the first information; receiving subscription information from a first network spoke of the plurality of network spokes, the subscription information indicating the first network spoke subscribing to the first network hub; and creating at least one dynamic control policy to establish a forwarding path for the first network spoke through the first network hub.Type: GrantFiled: May 26, 2020Date of Patent: July 19, 2022Assignee: CISCO TECHNOLOGY, INC.Inventors: Gaurav Shrivastava, Alfred C. Lindem, III, Ravi Kiran Chintallapudi, Torsha Banerjee Das
-
Patent number: 11362849Abstract: The present disclosure is directed to a centralized control policy for multicast replicator selection.Type: GrantFiled: November 23, 2020Date of Patent: June 14, 2022Assignee: CISCO TECHNOLOGY, INC.Inventors: Alfred C. Lindem, III, Ravi Kiran Chintallapudi, Gaurav Shrivastava, Jining Tian, Praleshkumar Gunvantray Patel
-
Publication number: 20220166639Abstract: The present disclosure is directed to a centralized control policy for multicast replicator selection.Type: ApplicationFiled: November 23, 2020Publication date: May 26, 2022Inventors: Alfred C. Lindem, III, Ravi Kiran Chintallapudi, Gaurav Shrivastava, Jining Tian, Praleshkumar Gunvantray Patel
-
Publication number: 20210377109Abstract: The present disclosure is directed to systems and methods for auto-provisioning hubs and spokes in a SD-WAN network, and includes the performance of operations and/or the steps of receiving first information from a first network hub, the first network hub one of a plurality of network hubs, the first information indicating a first set of properties associated with the first network hub; publishing the first information to a plurality of network spokes, the plurality of network spokes determining whether to subscribe to the first network hub based on the first information; receiving subscription information from a first network spoke of the plurality of network spokes, the subscription information indicating the first network spoke subscribing to the first network hub; and creating at least one dynamic control policy to establish a forwarding path for the first network spoke through the first network hub.Type: ApplicationFiled: May 26, 2020Publication date: December 2, 2021Inventors: Gaurav Shrivastava, Alfred C. Lindem, III, Ravi Kiran Chintallapudi, Torsha Banerjee Das
-
Link state addition and deletion based on reception of a single message in link state vector routing
Patent number: 10979340Abstract: Techniques for updating a routing table based on a single message are described. One technique includes receiving at a first network device a node message from a second network device. The node message includes a sequence number and a list of link state(s) originated by the second network device. The first network device determines whether to withdraw one or more link states originated by the second network device and maintained in a routing table of the first network device based on the sequence number and the list of the link state(s) within the node message. The routing table is updated based on the determinations.Type: GrantFiled: July 8, 2019Date of Patent: April 13, 2021Assignee: Cisco Technology, Inc.Inventors: Jakob Heitz, Alfred C. Lindem, III -
LINK STATE ADDITION AND DELETION BASED ON RECEPTION OF A SINGLE MESSAGE IN LINK STATE VECTOR ROUTING
Publication number: 20210014148Abstract: Techniques for updating a routing table based on a single message are described. One technique includes receiving at a first network device a node message from a second network device. The node message includes a sequence number and a list of link state(s) originated by the second network device. The first network device determines whether to withdraw one or more link states originated by the second network device and maintained in a routing table of the first network device based on the sequence number and the list of the link state(s) within the node message. The routing table is updated based on the determinations.Type: ApplicationFiled: July 8, 2019Publication date: January 14, 2021Inventors: Jakob HEITZ, Alfred C. LINDEM, III -
Patent number: 10671590Abstract: Aspects of the embodiments are directed to synchronizing at least a portion of a link-state database. A network element can lose an adjacency. The network element can transmit a request to a neighboring network element for synchronization of a link-state database. The request can include a version number of a last synchronized link-state database from the neighboring network element. The neighboring network element can determine whether the version of the link-state database is greater than or less than a copy of the link-state database stored by the neighboring network element. If the requested version number is less than the neighboring network element's link-state database version number, then the neighboring network element can send changes to the link-state database since the requested link-state database version number.Type: GrantFiled: September 1, 2016Date of Patent: June 2, 2020Assignee: Cisco Technology, Inc.Inventors: Alfred C. Lindem, III, Keyur Patel, Abhay Roy, Derek Man-Kit Yeung
-
Patent number: 10637686Abstract: Various systems and methods for bypassing one or more non-capable nodes. For example, one method involves a capable node determining that an adjacent node is non-capable, where capable nodes are configured to implement a data plane capability and non-capable nodes are not. The method then involves identifying a downstream node that is capable. The downstream node is on a shortest path. The method also involves generating information that identifies a tunnel to the downstream node.Type: GrantFiled: November 28, 2018Date of Patent: April 28, 2020Assignee: Cisco Technology, Inc.Inventors: Alfred C. Lindem, III, Peter Psenak, Ijsbrand Wijnands
-
Publication number: 20190097841Abstract: Various systems and methods for bypassing one or more non-capable nodes. For example, one method involves a capable node determining that an adjacent node is non-capable, where capable nodes are configured to implement a data plane capability and non-capable nodes are not. The method then involves identifying a downstream node that is capable. The downstream node is on a shortest path. The method also involves generating information that identifies a tunnel to the downstream node.Type: ApplicationFiled: November 28, 2018Publication date: March 28, 2019Inventors: Alfred C. Lindem, III, Peter Psenak, Ijsbrand Wijnands
-
Patent number: 10225174Abstract: In one embodiment, a first router determines whether an interface coupling the first router to one or more second routers is transit-only. When the interface is transit-only, the first router generates an Open Shortest Path First (OSPF) Link State Advertisement (LSA) that includes an address for the interface and a designated network mask. The designated network mask 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 interface 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: GrantFiled: May 16, 2016Date of Patent: March 5, 2019Assignee: Cisco Technology, Inc.Inventors: Yi Yang, Alvaro E. Retana, James L. Ng, Abhay Roy, Alfred C. Lindem, Sina Mirtorabi, Timothy M. Gage, Syed Khalid Raza
-
Patent number: 10171263Abstract: Various systems and methods for bypassing one or more non-capable nodes. For example, one method involves a capable node determining that an adjacent node is non-capable, where capable nodes are configured to implement a data plane capability and non-capable nodes are not. The method then involves identifying a downstream node that is capable. The downstream node is on a shortest path. The method also involves generating information that identifies a tunnel to the downstream node.Type: GrantFiled: November 30, 2017Date of Patent: January 1, 2019Assignee: CISCO TECHNOLOGY, INC.Inventors: Alfred C. Lindem, III, Peter Psenak, Ijsbrand Wijnands
-
Publication number: 20180159700Abstract: Various systems and methods for bypassing one or more non-capable nodes. For example, one method involves a capable node determining that an adjacent node is non-capable, where capable nodes are configured to implement a data plane capability and non-capable nodes are not. The method then involves identifying a downstream node that is capable. The downstream node is on a shortest path. The method also involves generating information that identifies a tunnel to the downstream node.Type: ApplicationFiled: November 30, 2017Publication date: June 7, 2018Inventors: Alfred C. Lindem, III, Peter Psenak, Ijsbrand Wijnands
-
Patent number: 9906378Abstract: Various systems and methods for bypassing one or more non-capable nodes. For example, one method involves a capable node determining that an adjacent node is non-capable, where capable nodes are configured to implement a data plane capability and non-capable nodes are not. The method then involves identifying a downstream node that is capable. The downstream node is on a shortest path. The method also involves generating information that identifies a tunnel to the downstream node.Type: GrantFiled: July 30, 2015Date of Patent: February 27, 2018Assignee: Cisco Technology, Inc.Inventors: Alfred C. Lindem, III, Peter Psenak, Ijsbrand Wijnands
-
Publication number: 20170344594Abstract: Aspects of the embodiments are directed to synchronizing at least a portion of a link-state database. A network element can lose an adjacency. The network element can transmit a request to a neighboring network element for synchronization of a link-state database. The request can include a version number of a last synchronized link-state database from the neighboring network element. The neighboring network element can determine whether the version of the link-state database is greater than or less than a copy of the link-state database stored by the neighboring network element. If the requested version number is less than the neighboring network element's link-state database version number, then the neighboring network element can send changes to the link-state database since the requested link-state database version number.Type: ApplicationFiled: September 1, 2016Publication date: November 30, 2017Applicant: CISCO TECHNOLOGY, INC.Inventors: Alfred C. Lindem, III, Keyur Patel, Abhay Roy, Derek Man-Kit Yeung
-
Patent number: 9503357Abstract: 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: December 30, 2015Date of Patent: November 22, 2016Assignee: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)Inventors: Alfred C. Lindem, III, Ing-Wher Chen
-
Patent number: 9479484Abstract: 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: GrantFiled: February 19, 2015Date of Patent: October 25, 2016Assignee: Telefonaktiebolaget L M Ericsson (publ)Inventors: Uma S. Chunduri, Wenhu Lu, Alfred C. Lindem, III
-
Patent number: 9444676Abstract: 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: GrantFiled: September 8, 2014Date of Patent: September 13, 2016Assignee: Telefonaktiebolaget L M Ericsson (publ)Inventors: Alfred C. Lindem, III, Lars Ernstrom, Vasant Patil
-
Publication number: 20160261485Abstract: In one embodiment, a first router determines whether an interface coupling the first router to one or more second routers is transit-only. When the interface is transit-only, the first router generates an Open Shortest Path First (OSPF) Link State Advertisement (LSA) that includes an address for the interface and a designated network mask. The designated network mask 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 interface 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: May 16, 2016Publication date: September 8, 2016Inventors: Yi Yang, Alvaro E. Retana, James L. Ng, Abhay Roy, Alfred C. Lindem, Sina Mirtorabi, Timothy M. Gage, Syed Khalid Raza