H04L45/125

Dynamic path selection and data flow forwarding

Various techniques for dynamic path selection and data flow forwarding are disclosed. For example, various systems, processes, and computer program products for dynamic path selection and data flow forwarding are disclosed for providing dynamic path selection and data flow forwarding that can facilitate preserving/enforcing symmetry in data flows as disclosed with respect to various embodiments.

User information method and apparatus for directing link-layer communication

A network device has an input configured to receive a message relating to a given user attempting to forward one or more packets across a computer network. The message has given user information relating to the given user. In addition, the routing device also has a selector, operatively coupled with the input, configured to select (after receiving the message) a given group routing policy from a plurality of group routing policies. Preferably, the selector is configured to select the given group routing policy as a function of the given user information. The routing device also has an output operatively coupled with the selector. The output is configured to cause routing of user communication across the network using link-layer routes specified by the given group routing policy.

DYNAMIC PATH SELECTION AND DATA FLOW FORWARDING

Various techniques for dynamic path selection and data flow forwarding are disclosed. For example, various systems, processes, and computer program products for dynamic path selection and data flow forwarding are disclosed for providing dynamic path selection and data flow forwarding that can facilitate preserving/enforcing symmetry in data flows as disclosed with respect to various embodiments.

DYNAMIC PATH SELECTION AND DATA FLOW FORWARDING

Various techniques for dynamic path selection and data flow forwarding are disclosed. For example, various systems, processes, and computer program products for dynamic path selection and data flow forwarding are disclosed for providing dynamic path selection and data flow forwarding that can facilitate preserving/enforcing symmetry in data flows as disclosed with respect to various embodiments.

BANDWIDTH CONSTRAINT FOR MULTIPATH SEGMENT ROUTING
20230086001 · 2023-03-23 ·

In an example, a method includes computing, by a computing device, for a segment routing policy that specifies a bandwidth constraint for the segment routing policy, first shortest paths through a network of network nodes, wherein each shortest path of the first shortest paths represents a different sequence of links connecting pairs of the network nodes from a source to a destination; in response to determining, by the computing device based on the bandwidth constraint for the segment routing policy, a link of one of the first shortest paths has insufficient bandwidth to meet a required bandwidth for the link, increasing a metric of the link; computing, by the computing device, for the segment routing policy that specifies the bandwidth constraint, based on the increased metric of the link, second shortest paths through the network of network nodes; and provisioning the second shortest paths in the network of nodes.

BANDWIDTH CONSTRAINT FOR MULTIPATH SEGMENT ROUTING
20230086001 · 2023-03-23 ·

In an example, a method includes computing, by a computing device, for a segment routing policy that specifies a bandwidth constraint for the segment routing policy, first shortest paths through a network of network nodes, wherein each shortest path of the first shortest paths represents a different sequence of links connecting pairs of the network nodes from a source to a destination; in response to determining, by the computing device based on the bandwidth constraint for the segment routing policy, a link of one of the first shortest paths has insufficient bandwidth to meet a required bandwidth for the link, increasing a metric of the link; computing, by the computing device, for the segment routing policy that specifies the bandwidth constraint, based on the increased metric of the link, second shortest paths through the network of network nodes; and provisioning the second shortest paths in the network of nodes.

High performance software-defined core network

A system of nodes configured to form a network comprising virtual links in an overlay network provisioned over an underlay network including servers of a public network. The system includes virtual routers (VRs) at each node. Each VR is coupled to the network and to a tenant of the node, and configured to form in the network a set of virtual links corresponding to the tenant. One or more VRs includes a feedback control system comprising an objective function that characterizes the network. The VR is configured to receive link state data of the set of virtual links and control routing of a tenant traffic flow of each tenant according to a best route of the network determined by the objective function using the link state data.

SYSTEMS AND METHODS FOR TAGGING FRAUDULENT PHONE NUMBERS

A method including: receiving a user report dataset indicating fraudulent activity corresponding to a phone number; responsive to receiving the user report dataset, identifying a record in a database corresponding to the phone number; and tagging the record to identify the phone number as being associated with fraudulent activity.

SYSTEMS AND METHODS FOR TAGGING FRAUDULENT PHONE NUMBERS

A method including: receiving a user report dataset indicating fraudulent activity corresponding to a phone number; responsive to receiving the user report dataset, identifying a record in a database corresponding to the phone number; and tagging the record to identify the phone number as being associated with fraudulent activity.

SYSTEMS AND METHODS FOR OPTIMAL ROUTING IN SITES WITH MULTIPLE ROUTERS FOR HIGH AVAILABILITY WIDE AREA NETWORKS

A method for transmitting network traffic across a wide area network (WAN) from a first site to a second site is provided. The method is executed by a first edge network device at the first site that further includes a second edge network device, and the method includes: receiving the network traffic from a client device at the first site; determining, using ipath characteristics and a classification of the network traffic, that the network traffic should be transmitted by the second edge network device to the second site; forwarding in response to the determination, the network traffic to the second edge network device using a local tunnel over a local area network (LAN) of the first site such that the network traffic is transmitted to the second site by the second edge network device.