Patents by Inventor Russ White
Russ White 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: 20240064091Abstract: A network device may receive, from a transmission network device, a link state message associated with an origination network device. The network device may determine an order of a set of one-hop neighbor network devices from the transmission network device. The network device may determine, based on the link state message and the order of the set of one-hop neighbor network devices, whether the network device is to send a copy of the link state message to at least one one-hop neighbor network device of the network device. The network device may send, or refraining from sending, by the network device and based on determining whether the network device is to send the copy of the link state message to the at least one one-hop neighbor network device of the network device, the link state message to the at least one one-hop neighbor network device of the network device.Type: ApplicationFiled: July 3, 2023Publication date: February 22, 2024Inventors: Shraddha HEGDE, Russ WHITE
-
Publication number: 20230327975Abstract: A network device may receive topology data identifying a spine and leaf topology of network devices, and may set link metrics to a common value to generate modified topology data. The network device may remove data identifying connections from leaf network devices to any devices outside the topology from the modified topology data to generate further modified topology data, and may process the further modified topology data, with a model, to determine path data identifying paths to destinations. The network device may determine particular path data identifying shorter paths and longer paths to corresponding destinations, and may determine hop counts associated with the paths. The network device may determine whether the hop counts are all odd values, all even values, or odd and even values, and may perform actions based on whether the hop counts are all odd values, all even values, or odd and even values.Type: ApplicationFiled: June 13, 2023Publication date: October 12, 2023Inventors: Russ WHITE, Shraddha HEGDE
-
Patent number: 11736385Abstract: A network device may receive, from a transmission network device, a link state message associated with an origination network device. The network device may determine an order of a set of one-hop neighbor network devices from the transmission network device. The network device may determine, based on the link state message and the order of the set of one-hop neighbor network devices, whether the network device is to send a copy of the link state message to at least one one-hop neighbor network device of the network device. The network device may send, or refraining from sending, by the network device and based on determining whether the network device is to send the copy of the link state message to the at least one one-hop neighbor network device of the network device, the link state message to the at least one one-hop neighbor network device of the network device.Type: GrantFiled: August 17, 2022Date of Patent: August 22, 2023Assignee: Juniper Networks, Inc.Inventors: Shraddha Hegde, Russ White
-
Patent number: 11716276Abstract: A network device may receive topology data identifying a spine and leaf topology of network devices, and may set link metrics to a common value to generate modified topology data. The network device may remove data identifying connections from leaf network devices to any devices outside the topology from the modified topology data to generate further modified topology data, and may process the further modified topology data, with a model, to determine path data identifying paths to destinations. The network device may determine particular path data identifying shorter paths and longer paths to corresponding destinations, and may determine hop counts associated with the paths. The network device may determine whether the hop counts are all odd values, all even values, or odd and even values, and may perform actions based on whether the hop counts are all odd values, all even values, or odd and even values.Type: GrantFiled: March 6, 2020Date of Patent: August 1, 2023Assignee: Juniper Networks, Inc.Inventors: Russ White, Shraddha Hegde
-
Patent number: 11496391Abstract: Problems associated with providing a large Clos network having at least one top of fabric (ToF) node, a plurality of internal nodes, and a plurality of leaf nodes may be solved by: (a) providing L2 tunnels between each of the leaf nodes of the Clos and one or more of the at least one ToF node to ensure a non-partitioned IGP L2 backbone, and (b) identifying the L2 tunnels as non-forwarding adjacencies in link state topology information stored in ToF node(s) and leaf node(s) such that the L2 tunnels are not used for forwarding traffic. Tunnel formation is prevented over L2.Type: GrantFiled: May 24, 2021Date of Patent: November 8, 2022Assignee: Juniper Networks, Inc.Inventors: Antoni B. Przygienda, Russ White, Christopher Bowers
-
Publication number: 20210281506Abstract: A network device may receive topology data identifying a spine and leaf topology of network devices, and may set link metrics to a common value to generate modified topology data. The network device may remove data identifying connections from leaf network devices to any devices outside the topology from the modified topology data to generate further modified topology data, and may process the further modified topology data, with a model, to determine path data identifying paths to destinations. The network device may determine particular path data identifying shorter paths and longer paths to corresponding destinations, and may determine hop counts associated with the paths. The network device may determine whether the hop counts are all odd values, all even values, or odd and even values, and may perform actions based on whether the hop counts are all odd values, all even values, or odd and even values.Type: ApplicationFiled: March 6, 2020Publication date: September 9, 2021Inventors: Russ WHITE, Shraddha HEGDE
-
Patent number: 11050679Abstract: Problems associated with providing a large Clos network having at least one top of fabric (ToF) node, a plurality of internal nodes, and a plurality of leaf nodes may be solved by: (a) providing L2 tunnels between each of the leaf nodes of the Clos and one or more of the at least one ToF node to ensure a non-partitioned IGP L2 backbone, and (b) identifying the L2 tunnels as non-forwarding adjacencies in link state topology information stored in ToF node(s) and leaf node(s) such that the L2 tunnels are not used for forwarding traffic. In some example implementations consistent with the present disclosure, the L2 tunnels are not used to compute routes from the link state topology information. Alternatively, in some other example implementations consistent with the present disclosure, the L2 tunnels are used to compute routes, but such routes are not used, or only used if no routes using only L1 (or L1-down adjacencies) are available.Type: GrantFiled: June 28, 2019Date of Patent: June 29, 2021Assignee: Juniper Networks, Inc.Inventors: Antoni B. Przygienda, Russ White
-
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: 7936667Abstract: In one embodiment, a method includes identifying at a node, a destination for which a primary path is defined between the node and the destination, transmitting a request message to a neighbor node for routing information for a backup path between the node and the destination, receiving a reply message containing an address identifying the backup path, and building a backup tunnel to the address. The request message includes at least one node identified as a node to be avoided in the backup path and a request cost. An apparatus for building backup tunnels is also disclosed.Type: GrantFiled: January 5, 2009Date of Patent: May 3, 2011Assignee: Cisco Technology, Inc.Inventors: Donnie Savage, Alvaro Retana, Russ White
-
Patent number: 7860027Abstract: In one embodiment, a border node receives a message that includes routing information indicating connection of a network device to a domain. The border node then updates a routing database with the routing information, and also uses a network address for the network device to determine whether to propagate the routing information.Type: GrantFiled: November 21, 2007Date of Patent: December 28, 2010Assignee: Cisco Technology, Inc.Inventors: Alvaro E. Retana, Russ White
-
Publication number: 20100172237Abstract: In one embodiment, a method includes identifying at a node, a destination for which a primary path is defined between the node and the destination, transmitting a request message to a neighbor node for routing information for a backup path between the node and the destination, receiving a reply message containing an address identifying the backup path, and building a backup tunnel to the address. The request message includes at least one node identified as a node to be avoided in the backup path and a request cost. An apparatus for building backup tunnels is also disclosed.Type: ApplicationFiled: January 5, 2009Publication date: July 8, 2010Applicant: Cisco Technology, Inc.Inventors: Donnie Savage, Alvaro Retana, Russ White
-
Publication number: 20090129387Abstract: In one embodiment, a border node receives a message that includes routing information indicating connection of a network device to a domain. The border node then updates a routing database with the routing information, and also uses a network address for the network device to determine whether to propagate the routing information.Type: ApplicationFiled: November 21, 2007Publication date: May 21, 2009Applicant: Cisco Technology, Inc.Inventors: Alvaro E. RETANA, Russ White
-
Publication number: 20070245034Abstract: 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: ApplicationFiled: April 18, 2006Publication date: October 18, 2007Inventors: Alvaro Retana, Alfred Lindem, Russ White