H04L41/0826

Data processing method and apparatus, and computing node for updating container images
11558253 · 2023-01-17 · ·

A data processing method and apparatus are disclosed. The data processing method includes: receiving, by a first edge computing node in an edge computing cluster, a container image update instruction; obtaining, by the first edge computing node, a to-be-updated container image; and sending, by the first edge computing node, the to-be-updated container image to another edge computing node in the edge computing cluster. The first edge computing node is an edge computing node in the edge computing cluster, the edge computing cluster includes at least two edge computing nodes, and the container image update instruction is used to instruct the at least two edge computing nodes in the edge computing cluster to update a container image. In this way, the time required for downloading the container image is reduced.

Data processing method and apparatus, and computing node for updating container images
11558253 · 2023-01-17 · ·

A data processing method and apparatus are disclosed. The data processing method includes: receiving, by a first edge computing node in an edge computing cluster, a container image update instruction; obtaining, by the first edge computing node, a to-be-updated container image; and sending, by the first edge computing node, the to-be-updated container image to another edge computing node in the edge computing cluster. The first edge computing node is an edge computing node in the edge computing cluster, the edge computing cluster includes at least two edge computing nodes, and the container image update instruction is used to instruct the at least two edge computing nodes in the edge computing cluster to update a container image. In this way, the time required for downloading the container image is reduced.

Dynamic rate limiting for networked resources
11595313 · 2023-02-28 · ·

Rate limiting systems and methods for regulating access to a shared network resource in a computing device accessed through an application programming interface. A rate limit associated with a shared network resource is assigned to a user for a time period. During the time period, access to the shared network resource is granted or denied repeatedly based upon the rate limit; a cost is calculated using a cost function; and, the rate limit is updated based upon the cost.

Dynamic rate limiting for networked resources
11595313 · 2023-02-28 · ·

Rate limiting systems and methods for regulating access to a shared network resource in a computing device accessed through an application programming interface. A rate limit associated with a shared network resource is assigned to a user for a time period. During the time period, access to the shared network resource is granted or denied repeatedly based upon the rate limit; a cost is calculated using a cost function; and, the rate limit is updated based upon the cost.

Satisfying demands in data communication networks
11595294 · 2023-02-28 · ·

Systems and methods are disclosed for identifying a set of internal edges on a representation of a network that satisfy a set of demands on the network. The disclosed systems and methods perform a multi-step process of selecting the internal edges. In a first step, an initial set of internal edges can be selected using a clique graph (or in another suitable manner). In a second step, a second set of internal edges can be selected using stream graph(s) (or in another suitable manner). The second set of internal edges can be used when determining network paths that satisfy the demands. When the representation of the network has a cut of two, the disclosed systems and methods can identify a set of internal edges providing a degree of protection against link failure.

Satisfying demands in data communication networks
11595294 · 2023-02-28 · ·

Systems and methods are disclosed for identifying a set of internal edges on a representation of a network that satisfy a set of demands on the network. The disclosed systems and methods perform a multi-step process of selecting the internal edges. In a first step, an initial set of internal edges can be selected using a clique graph (or in another suitable manner). In a second step, a second set of internal edges can be selected using stream graph(s) (or in another suitable manner). The second set of internal edges can be used when determining network paths that satisfy the demands. When the representation of the network has a cut of two, the disclosed systems and methods can identify a set of internal edges providing a degree of protection against link failure.

USING VIRTUAL NETWORKING DEVICES TO MANAGE ROUTING INFORMATION

Techniques are described for providing managed virtual computer networks that have a configured logical network topology with virtual networking devices, such as by a network-accessible configurable network service, with corresponding networking functionality provided for communications between multiple computing nodes of the virtual computer network by emulating functionality that would be provided by the virtual networking devices if they were physically present. In some situations, the networking functionality provided for a managed computer network of a client includes receiving routing communications directed to the virtual networking devices and using included routing cost information to update the configuration of the managed computer network, and/or includes determining actual cost information corresponding to use of an underlying substrate network and providing routing cost information to the client that reflects the determined actual cost information, so as to enable the client to modify the configuration of the managed computer network accordingly.

CAPACITY PLANNING AND RECOMMENDATION SYSTEM

Systems and methods that adaptively model network traffic to predict network capacity utilization and quality of experience into the future. The adaptive model of network traffic may be used to recommend capacity upgrades based on a score expressed in a QoE space.

STITCHING MULTIPLE WIDE AREA NETWORKS TOGETHER

The present application relates to communications between a partner network and a wide area network (WAN). The partner network and WAN may exchange representations of the respective networks including a delay profile for the partner network. The WAN receives a network delay profile for multiple virtual network entities within the partner network. The multiple virtual network entities include at least a plurality of peering locations with the WAN. The WAN determines a path from the partner network through the WAN via a selected peering location of the plurality of peering locations with the WAN to a destination based on at least the network delay profile. The WAN deploys a policy for an agent within the partner network. The policy identifies traffic for the destination to route through the WAN via the selected peering location. The WAN routes traffic from the selected peering location to the destination along the path.

Systems and methods for proactive network maintenance

The present disclosure generally relates to systems, methods and software for quantitatively evaluating an improvement on an active communication network when an impairment, such as a developing impairment, is addressed by one or more repair options via proactive network maintenance.