H04L12/729

HEURISTIC-BASED SD-WAN ROUTE RECONFIGURATION
20210392070 · 2021-12-16 ·

An example network orchestrator includes processing circuitry and a memory. The memory includes instructions that cause the network orchestrator to receive network probe information including delay times of network probes associated with a set of flows between devices. The instructions further cause the network orchestrator to generate a correlation matrix including correlations representing shared congested links between pairs of flows. The instructions further cause the network orchestrator to for each flow of the set of flows, determine a routing solution optimized for the each flow and select a total minimum cost solution from the determined routing solutions.

INFRASTRUCTURE LINK PATH ARRANGEMENT DETERMINATION METHOD AND SYSTEM

A computer-implemented method and system for determining a path arrangement of an infrastructure link. The method includes receiving one or more inputs each indicative of a constraint; and processing the one or more inputs and a set of data based on a path arrangement determination model. The set of data includes data representing one or more factors affecting the path arrangement. The method also includes determining, based on the processing, the path arrangement of the infrastructure link.

MEMORY POOLED TIME SENSITIVE NETWORKING BASED ARCHITECTURES

A system comprising a traffic handler comprising circuitry to determine that data of a memory request is stored remotely in a memory pool; generate a packet based on the memory request; and direct the packet to a path providing a guaranteed latency for completion of the memory request.

Methods, apparatus and computer programs for allocating traffic in a telecommunications network

Embodiments of the disclosure provide methods, apparatus and computer programs for allocating traffic in a telecommunications network comprising a plurality of nodes, with pairs of nodes being connected by respective links. A method comprises obtaining a plurality of demands for connectivity between respective first nodes and respective second nodes of the telecommunications network, each demand being subject to a respective constraint associated with the connectivity between the respective first node and the respective second node; for each demand, generating a list of possible paths between the first node and the second node satisfying the constraint; based on the list of possible paths for each demand and an indication of traffic usage for each demand, determining, for each demand, weights in respect of each of the possible paths; and providing the weights to nodes of the telecommunications network, for the distribution of traffic associated with each of the plurality of demands to the possible paths in accordance with the respective weights.

METHODS AND SYSTEMS FOR APPLICATION AND POLICY BASED NETWORK TRAFFIC ISOLATION AND DATA TRANSFER

A method includes allocating an identifier to each of a plurality of policies each comprising a network-isolation identifier associated with a VXWAN directive and transmitting each of the plurality of policies to one or more devices in a network.

Machine learning-based path priority determination for routing data in software-defined networks
11184273 · 2021-11-23 · ·

In one example, a non-transitory computer readable storage medium may include instructions that, when executed by a processor, cause the processor to obtain historical logs associated with a plurality of available paths between a source node and a destination node. The historical logs may be obtained for a first interval by routing data over the available paths based on a first priority order and corresponding network characteristics parameters. Further, non-transitory computer readable storage medium may include instructions to determine a modified first priority order of the available paths and corresponding modified network characteristic parameters by analyzing the historical logs using a machine learning model and route the data from the source node to the destination node based on the modified first priority order.

Flow-Based Load Balancing
20210359944 · 2021-11-18 ·

Methods and apparatuses are described for virtualizing routing of network traffic by offloading routing decisions to a controller in communication with a plurality of network devices. For load balancing applications, the controller may make up-front decisions as to both destination and route, rather than wait until traffic has been routed to a load balancing point before determining the destination.

Toll-free telecommunications and data management platform
11178289 · 2021-11-16 · ·

A Toll-Free Management Platform (TFMP) includes methods and systems for number administration, customer administration, call management services, texting services and text registry, and a smart services registry. The TFMP may allow users to receive through a web-based interface, an activate request from a user, wherein the request includes at least a customer record template reference and an indication of when to active a toll-free telecommunications number associated with the request. The request may include at least one IP address datum associated with the toll-free telecommunications number. A user interface may allow activating a toll-free number, and users may access the TFMP to create and access existing templates of toll-free call routing templates, and utilize a routing tree engine to create customized call routing trees for the toll-free numbers of interest to the user.

Method To Mitigate Hash Correlation In Multi-Path Networks

Methods are provided for mitigating hash correlation. In this regard, a hash correlation may be found between a first switch and a second switch in a network. In this network, a first egress port is to be selected among a first group of egress ports at the first switch for forwarding packets, and a second egress port is to be selected among a second group of egress ports at the second switch for forwarding packets, where the first group has a first group size and the second group has a second group size. Upon finding the hash correlation, a new second group size coprime to the first group size may be selected, and the second group of egress ports may be mapped to a mapped group having the new second group size. The second switch may be configured to route packets according to the mapped group.

Detection of unauthorized cryptomining

A processing system of a device having at least one processor may determine that a temperature of the device exceeds a threshold temperature and obtain, in response to the determining, utilization information of the device comprising: processor utilization information, memory utilization information, and network utilization information. The processing system may then detect, from the utilization information of the device, a pattern comprising: a first network utilization burst, a processor utilization exceeding a processor utilization threshold and a memory utilization exceeding a memory utilization threshold over at least a designated period of time following the first network utilization burst, and a second network utilization burst after at least the designated period of time. When the pattern is detected, the processing system may generate an unauthorized cryptomining alert.