H04L45/028

Autonomous topology management for wireless radio user equipment

The described technology is generally directed towards an autonomous topology management scheme in a wireless communications network that establishes a hierarchical structure from a peer-to-peer network without assistance from the wireless network. A group of user equipments negotiate with each other to elect a local manager that acts as a base station by which other user equipments of the group can access network resources. Described is an example voting scheme by which the negotiation process elects the local manager for a term.

DRAGONFLY ROUTING WITH INCOMPLETE GROUP CONNECTIVITY
20220166705 · 2022-05-26 ·

Systems and methods are provided for managing a data communication within a multi-level network having a plurality of switches organized as groups, with each group coupled to all other groups via global links, including: at each switch within the network, maintaining a global fault table identifying the links which lead only to faulty global paths, and when the data communication is received at a port of a switch, determine a destination for the data communication and, route the communication across the network using the global fault table to avoid selecting a port within the switch that would result in the communication arriving at a point in the network where its only path forward is across a global link that is faulty; wherein the global fault table is used for both a global minimal routing methodology and a global non-minimal routing methodology.

DRAGONFLY ROUTING WITH INCOMPLETE GROUP CONNECTIVITY
20220166705 · 2022-05-26 ·

Systems and methods are provided for managing a data communication within a multi-level network having a plurality of switches organized as groups, with each group coupled to all other groups via global links, including: at each switch within the network, maintaining a global fault table identifying the links which lead only to faulty global paths, and when the data communication is received at a port of a switch, determine a destination for the data communication and, route the communication across the network using the global fault table to avoid selecting a port within the switch that would result in the communication arriving at a point in the network where its only path forward is across a global link that is faulty; wherein the global fault table is used for both a global minimal routing methodology and a global non-minimal routing methodology.

Systems and methods for call session control function failover using dynamic routing techniques

A system described herein may provide a technique for the seamless failover of devices in a network, such as a wireless telecommunications network. For example, embodiments may identify a particular device, such as a Call Session Control Function (“CSCF”), that has failed or that does not meet particular performance metrics. An Internet Protocol (“IP”) address of the failed device may be assigned to a functioning device of the same type (e.g., another CSCF). The functioning device may be instructed, in accordance with some embodiments, to output routes between itself and other devices or IP addresses, based on which traffic originally intended for the failed device may be routed to the functioning device.

Systems and methods for call session control function failover using dynamic routing techniques

A system described herein may provide a technique for the seamless failover of devices in a network, such as a wireless telecommunications network. For example, embodiments may identify a particular device, such as a Call Session Control Function (“CSCF”), that has failed or that does not meet particular performance metrics. An Internet Protocol (“IP”) address of the failed device may be assigned to a functioning device of the same type (e.g., another CSCF). The functioning device may be instructed, in accordance with some embodiments, to output routes between itself and other devices or IP addresses, based on which traffic originally intended for the failed device may be routed to the functioning device.

ROUTING SPIKE MESSAGES IN SPIKING NEURAL NETWORKS
20220156564 · 2022-05-19 ·

The present disclosure is directed to routing of data in a spiking neural network (SNN) that performs in-memory operations. To model a computer-implemented SNN after a biological neural network, the architecture in the present disclosure involves different memory sections for storing inbound spike messages, synaptic connection data, and synaptic connection parameters. Embodiments are directed to routing spike messages through various router-based topologies. For example, spike messages may be multicasted to target routers using address tables.

Predictive Anycast traffic shaping

Gateway devices at different sites of a primary Anycast network provide access to the sites by advertising a first set of Anycast addresses. A secondary shadow Anycast network advertises different second sets of Anycast addresses from the different sites in order to predetermine traffic shifts that occur as a result of changing one or more of the second set of Anycast addresses that are advertised from one or more of the sites. A traffic shifting device may implement a predetermined traffic shift in the primary Anycast network by selecting a particular second set of network addresses that produces a traffic shift at least equal to the predetermined traffic shift, mapping the particular second set of network addresses to a modified first set of addresses, and modifying routing in the primary Anycast network by advertising the modified first set of addresses instead of the first set of addresses.

Predictive Anycast traffic shaping

Gateway devices at different sites of a primary Anycast network provide access to the sites by advertising a first set of Anycast addresses. A secondary shadow Anycast network advertises different second sets of Anycast addresses from the different sites in order to predetermine traffic shifts that occur as a result of changing one or more of the second set of Anycast addresses that are advertised from one or more of the sites. A traffic shifting device may implement a predetermined traffic shift in the primary Anycast network by selecting a particular second set of network addresses that produces a traffic shift at least equal to the predetermined traffic shift, mapping the particular second set of network addresses to a modified first set of addresses, and modifying routing in the primary Anycast network by advertising the modified first set of addresses instead of the first set of addresses.

System and method for managing computing resources
11336557 · 2022-05-17 · ·

A network device includes storage. The network device also includes a forwarding information manager. The storage stores forwarding information. The storage also stores information source rankings. The forwarding information manager obtains information from a source. The information source rankings include a ranking associated with the source. The forwarding information manager makes a determination, based on the information source rankings, that the source is undesirable. The forwarding information manager discards the information without processing the information based on the determination.

System and method for managing computing resources
11336557 · 2022-05-17 · ·

A network device includes storage. The network device also includes a forwarding information manager. The storage stores forwarding information. The storage also stores information source rankings. The forwarding information manager obtains information from a source. The information source rankings include a ranking associated with the source. The forwarding information manager makes a determination, based on the information source rankings, that the source is undesirable. The forwarding information manager discards the information without processing the information based on the determination.