H04L43/0829

SYSTEM AND METHOD FOR OBSERVING AND CONTROLLING A PROGRAMMABLE NETWORK USING CROSS NETWORK LEARNING
20230033161 · 2023-02-02 ·

A system and method for observing and controlling a programmable network via higher layer attributes is disclosed. According to one embodiment, the system includes one or more collectors and a remote network manager. The one or more collectors are configured to receive network traffic data from a plurality of network elements in the network. The remote network manager is configured to connect to the one or more collectors over the Internet via a network interface. The one or more collectors extract metadata from the network traffic data and send the metadata to the network manager.

AUTOMATIC CONFIGURATION OF SD-WAN LINK RULES ON A PER APPLICATION BASIS USING REAL-TIME NETWORK CONDITIONS
20230097061 · 2023-03-30 ·

new link requests are received and an application making the request is identified. SD-WAN parameters are retrieved from an application control database. A first parameter is a JLP loss requirement for the application, and can be either low JLP, medium JLP, or high JLP SLA level. A second parameter a downstream/upstream bandwidth capability requirement. Links are determined from the pool of available links that meet the JLP requirement. One of the links is selected for the new link request, from the pool of available links that meet the JLP requirement, based on a downstream and an upstream bandwidth capability. The best link is automatically activated for the new link request

PROCESSING OF PACKETS IN A PACKET-SWITCHED COMMUNICATION NETWORK
20230031183 · 2023-02-02 · ·

An apparatus and associated method for processing packets transmitted in a packet-switched communication network includes a sampling module that identifies amongst the received packets a plurality of samples distributed in a statistically uniform way amongst at least two non-overlapping sample sequences. Each sample sequence is then subjected to at least one identification rule, thereby identifying in the sample sequence at least one sub-sequence of samples fulfilling the at least one identification rule. The identification rule comprises a condition on the value of at least one identification field of the packets. Then, at least one parameter indicative of a behavior of the at least one sub-sequence of samples is provided.

Cache adjustment before encountering different circumstance
11496936 · 2022-11-08 · ·

Buffering streaming content includes accessing prior device location data of a device and predicting a future sector that the device will travel through based at least in part on the prior device location data. A predicted quality of service of wireless communications is determined and a streaming buffer is adjusted based at least in part on the predicted quality of service and a caching policy set in accordance with key variables related to network conditions in the future sector.

SYSTEMS AND METHODS FOR DETERMINING PROBLEMATIC PATHS BETWEEN INTEREST POINTS IN A MULTI-CLOUD ENVIRONMENT

In one embodiment, a method includes identifying a problematic event between a first interest point and a second interest point of a network and activating, in response to identifying the problematic event between the first interest point and the second interest point, a first endpoint associated with the first interest point and a second endpoint associated with the second interest point. The method also includes receiving, from the first endpoint and the second endpoint, telemetry data associated with a problematic path between the first interest point and the second interest point. The method further includes determining the problematic path between the first interest point and the second interest point using the telemetry data received from the first endpoint and the second endpoint.

Applying impairments to nodes of a distributed computing environment using a software operator
11496360 · 2022-11-08 · ·

Impairments can be applied to nodes of a distributed computing environment using a software operator. For example, a system can receive, by a controller of a distributed computing environment executing a network-impairment operator, a custom resource defining a reduced-performance configuration for a worker node of the distributed computing environment. The system can deploy the reduced-performance configuration to the worker node for a predetermined period of time. Subsequent to the predetermined period of time passing, the system can remove the reduced-performance configuration from the worker node.

PERFORMANCE MEASUREMENT, TELEMETRY, AND OAM IN MPLS NETWORKS USING ENTROPY LABELS
20230031423 · 2023-02-02 ·

Techniques are described for utilizing entropy labels of a Multiprotocol Label Switching (MPLS) label stack for performing monitoring operations (e.g., telemetry, performance measurement, OAM, etc.) without altering the MPLS label stack and/or packet path (e.g., ECMP path). The techniques may include determining, by a node of a network, to perform a monitoring operation associated with traffic that is to be sent along a path through the network. In some examples, the node may receive a packet that is to be sent along the path and encapsulate the packet with an MPLS header. The MPLS header may include an entropy label, entropy label indicator, or other label that is capable of carrying a flag indicating the monitoring operation to be performed. The flag may be carried in a TTL field or traffic class field of the label such that the MPLS label stack is not altered to trigger the monitoring operation.

Communication apparatus, communication system, and communication control method

A communication apparatus that transmits and receives packet data by radio communication with another communication apparatus, the communication apparatus including a memory; and a processor coupled to the memory and the processor configured to: receive first packet data in a first packet transmission period; calculate data collection efficiency indicating a ratio of a reception data amount of the first packet data, to a transmission data amount of the first packet data, based on received the first packet data, and measure a first radio quality in a radio section between the communication apparatus and the other communication apparatus, based on received the first packet data; calculate a packet length and transmission count of the first packet data, based on the data collection efficiency and first radio quality; and transmit a second packet data including the packet length and transmission count.

EXIT INTERFACE SELECTION BASED ON INTERMEDIATE PATHS

Systems, methods, and computer-readable media are provided for performing secure frame encryption as a service. For instance, a network edge device can determine at least a first path and a second path for routing a data packet. The network edge device can obtain a first plurality of values for at least one network metric, wherein the first plurality of values corresponds to the first path and at least a first backup path associated with the first path. The network edge device can obtain a second plurality of values for the at least one network metric, wherein the second plurality of values corresponds to the second path and at least a second backup path associated with the second path. The network edge device can select one of the first path or the second path for routing the data packet based on a comparison of the first plurality of values and the second plurality of values.

Estimating end-to-end network traffic demand and loss

Packet transmission rate and packet drop rate for discrete network devices in a network are used to estimate end-to-end traffic demand and loss in the network. Data regarding the packet transmission rate and drop rate are passively collected for each network device and transmitted to a network monitoring unit. The network monitoring unit compiles the data and generates a series of simultaneous equations that represent traffic demand and loss between the discrete network devices along the paths connecting respective source-destination pairs. By determining an optimal solution to the simultaneous equations, an estimate of end-to-end traffic loss and corresponding traffic demand, which takes into account packet loss at each network device, can be generated for each source-destination pair. The optimal solution can be formed as a traffic matrix, which aggregates source-to-destination traffic demands, and a loss matrix, which aggregates source-to-destination traffic losses.