H04L47/828

Methods for managing multi-channel network traffic

The present disclosure generally relates to apparatus, software and methods for managing multi-channel network traffic to alleviate congestion, improve service quality and make efficient use of channel capacity. The disclosed apparatus, software and methods alleviate congestion and improve service quality by minimizing variance within a channel and/or increase overall traffic flow by minimizing the variance between channels. One or both of these objectives can be accomplished using modern portfolio theory to optimize at least one network usage parameter based on the mean and variance of the parameter(s).

Server-side resource monitoring in a distributed data storage environment
11722558 · 2023-08-08 · ·

Apparatus and method for performing real-time monitoring of server-side resources required to satisfy a client-side request in a distributed data storage environment, such as in a cloud computing or HPC (high performance computing) network. A client device is configured to issue a service request to carry out a service application associated with one or more server nodes. A request scheduler forwards the service request from the client device to a selected server node associated with the service request. A service log accumulates entries associated with data transfer operations carried out by the server node responsive to the service request over each of a succession of time periods. A service monitor accumulates, for each of the succession of time periods, information associated with the data transfer operations. A monitor tool aggregates the cumulative information to provide an indication of server-side resources utilized to satisfy the service request.

Building a highly-resilient system with failure independence in a disaggregated compute environment

A new approach to resiliency management is provided in a data center wherein servers are constructed dynamically, on-demand and based on workload requirements and a tenant's resiliency requirements by allocating resources from these pools. In this approach, a set of functionally-equivalent “interchangeable compute units” (ICUs) are composed of resources from resource pools that have been extended to include not only different resource types (CPU, memory, accelerators), but also resources of different specifications (specs) and flavors. As a workload is being processed, the health or status of the resources are monitored. Upon a performance issue or failure event, a resiliency manager can swap out a current ICU and replace it with a functionally-equivalent ICU. Preferably, individual ICUs are hosted on one of: resources of a same type each with different specifications, and resources of a same type and specification and different flavors. The approach enables failure independence in a disaggregated environment.

METHODS FOR IMPROVED INTERORGANIZATIONAL COLLABORATION

Systems and methods are included for improved interorganizational collaboration. An agent on a server can crawl through data files to identify keywords relating to a product. The agent can create tags and assign the keywords to the tags. The agent can crawl through user-related data files to identify potential support users. The support users can be mapped to tags in a database. A user interacting with a chat application can request help with the product. The agent can extract keywords from the request and use them to identify a tag. The agent can map the tag to support users and using an algorithm can select a support user to send the help request to. If the support user denies the request or does not respond, the agent can send the request to another support user. Once a support user accepts the request, the agent can connect the users.

PRE-ALLOCATING RESOURCES WITH HIERARCHY-BASED CONSTRAINTS

In a resource-pooling system, predictions can be made as to when and how resources may be needed by particular processes in the system. Requests can be made preemptively to client systems to pre-allocate resources such that resources are ready to use when needed. Client systems can submit constraints on how particular resources may be used by the system. In order to efficiently evaluate these constraints, the system may be organized into a hierarchy of groups, subsystems, and processes, and the constraints may be formulated to match this hierarchy. When resources need to be allocated, constraints may be evaluated using an algorithm that traverses levels of the hierarchy to quickly identify pre-allocations that are available for a particular process based on its location in the system hierarchy.

METHOD AND DEVICES FOR DOMAIN NAME BANDWIDTH ADJUSTMENT
20210367902 · 2021-11-25 ·

The present disclosure provides a method and related devices for domain name bandwidth adjustment. The method includes: receiving domain name bandwidth information reported by each on-site bandwidth management server and based on the domain name bandwidth information, determining a target domain name having the domain name bandwidth exceeding a specified bandwidth threshold; determining a to-be-adjusted bandwidth corresponding to the target domain name, and allocating the to-be-adjusted bandwidth among a plurality of sites; determining a bandwidth control threshold of the target domain name for the corresponding site; and generating a flow control instruction containing the bandwidth control threshold, and sending the generated flow control instruction to the on-site bandwidth management server at the corresponding site, where the on-site bandwidth management server adjusts the domain name bandwidth of the target domain name in each node server at the site.

SPECULATIVE RESOURCE ALLOCATION FOR ROUTING ON INTERCONNECT FABRICS
20210367905 · 2021-11-25 · ·

Methods and systems related to speculative resource allocation for routing on an interconnect fabric are disclosed herein. One disclosed method includes speculatively allocating a collection of resources to support a set of paths through an interconnect fabric. The method also includes aggregating a set of responses from the set of paths at a branch node on the set of paths. If a resource contention is detected, the set of responses will include an indicator of a resource contention. The method will then further include transmitting, from the branch node and in response to the indicator of the resource contention, a deallocate message downstream and the indicator of the resource contention upstream, and reallocating resources for the multicast after a hold period.

Resource processing method and system, storage medium and electronic device
11228537 · 2022-01-18 · ·

A priority-based resource processing method and system, belonging to the technical field of information processing, are described. The priority-based resource processing method comprises: calculating a first priority of a first resource and a second priority of a second resource; determining whether the first priority of the first resource is higher than the second priority of the second resource; and when it is determined that the first priority is higher than the second priority, responding to a first operation request corresponding to the first resource.

Processing Allocation In Data Center Fleets
20210359957 · 2021-11-18 · ·

A method and system for allocating tasks among processing devices in a data center. The method may include receiving a request to allocate a task to one or more processing devices, the request indicating a required bandwidth for performing the task, a list of predefined processing device groups connected to a host server and indicating availability of the processing device groups included therein for allocation of tasks and available bandwidth for each available processing device group, assigning the task to a processing device group having an available bandwidth greater than or equal to the required bandwidth for performing the task, and updating the list to indicate that each of the processing device group to which the task is assigned and other processing device group sharing at least one processing device is unavailable. The task may be assigned to an available processing device group having a lowest amount of power needed.

Performing slice based operations in a data plane circuit

Some embodiments of the invention provide a novel method of performing network slice-based operations on a data message at a hardware forwarding element (HFE) in a network. For a received data message flow, the method has the HFE identify a network slice associated with the received data message flow. This network slice in some embodiments is associated with a set of operations to be performed on the data message by several network elements, including one or more machines executing on one or more computers in the network. Once the network slice is identified, the method has the HFE process the data message flow based on a rule that applies to data messages associated with the identified slice.