A data transmission method includes receiving a service request sent by a terminal device. The method also includes determining, based on the service request, a target transmission path of service data corresponding to the service request and a change policy corresponding to the target transmission path. The method further includes changing, according to the change policy, a current content delivery network (CDN) to a target CDN. The target CDN includes a plurality of serving nodes corresponding to the target transmission path. The method additionally includes sending an indication message to a first serving node in the target CDN to indicate the first serving node to send the service data to the terminal device through the target transmission path; or sending an indication message to a second serving node in the target CDN to indicate the second serving node to send the service data to the terminal device.

A data transmission method includes receiving a service request sent by a terminal device. The method also includes determining, based on the service request, a target transmission path of service data corresponding to the service request and a change policy corresponding to the target transmission path. The method further includes changing, according to the change policy, a current content delivery network (CDN) to a target CDN. The target CDN includes a plurality of serving nodes corresponding to the target transmission path. The method additionally includes sending an indication message to a first serving node in the target CDN to indicate the first serving node to send the service data to the terminal device through the target transmission path; or sending an indication message to a second serving node in the target CDN to indicate the second serving node to send the service data to the terminal device.

A multi-cloud service mesh orchestration platform can receive a request to deploy an application as a service mesh application. The platform can tag the application with governance information (e.g., TCO, SLA, provisioning, deployment, and operational criteria). The platform can partition the application into its constituent components, and tag each component with individual governance information. For first time steps, the platform can select and perform a first set of actions for deploying each component to obtain individual rewards, state transitions, and expected returns. The platform can determine a reinforcement learning policy for each component that maximizes a total reward for the application based on the individual rewards, state transitions, and expected returns of each first set of actions selected and performed for each component. For second time steps, the platform can select and perform a second set of actions for each component based on the reinforcement learning policy for the component.

A system and method of forming proxy server pools is provided. The method comprises several steps, such as requesting a pool to execute the user's request and retrieving an initial group. The system checks the service history of an initial group, including whether any of the proxy servers in an initial group are exclusive to existing pools. The exclusive proxy servers in an initial group with eligible proxy servers are replaced when needed and new proxy server pools are formed. The system also records the service history of proxy servers and pools before and after the pools are created. The method can also involve predicting the pool health in relation with the thresholds foreseen and replacing the proxy servers below the threshold.

A system can include a gateway, a plurality of network function nodes, and a distributed load balancer including load balancer nodes each having a flow table portion stored thereon. The load balancer nodes can form a node chain having a tail and head nodes. A load balancer node can receive a packet from the gateway. In response, the load balancer node can generate a query, directed to the tail node, that identifies the packet and a network function identifier associated with a network function node that is proposed to handle a connection. The tail node can determine whether an entry for the connection exists in a flow table portion associated with the tail node. If not, the tail node can initiate an insert request for writing the entry for the connection via the head node. The entry can then be written to all load balancer nodes in the node chain.

A system can include a gateway, a plurality of network function nodes, and a distributed load balancer including load balancer nodes each having a flow table portion stored thereon. The load balancer nodes can form a node chain having a tail and head nodes. A load balancer node can receive a packet from the gateway. In response, the load balancer node can generate a query, directed to the tail node, that identifies the packet and a network function identifier associated with a network function node that is proposed to handle a connection. The tail node can determine whether an entry for the connection exists in a flow table portion associated with the tail node. If not, the tail node can initiate an insert request for writing the entry for the connection via the head node. The entry can then be written to all load balancer nodes in the node chain.

A computerized-method for prioritizing tenants for a service for a request-router in a cloud-based Software-as-a-Service-platform contact-center, is provided herein. When a service-monitoring module for a microservice is operating and a request-router is in a throttle-mode for each service of the microservice, the computerized-method may be operating a Tenants-Prioritization (TP) module for each tenant. The TP module may include: (i) receiving a degradation-level (ii) periodically pulling data from an Automatic-Call-Distribution system to calculate agent-activity-levels and call-queue-size; (iii) maintaining the calculated agent-activity-levels, calculated call-queue-size, tenant-trend-indicator and a preconfigured account-impact-score of the tenant; (iv) determining a tenant-tier-level based on a calculated Tenant-Request-Prioritization score; and (v) providing the tenant-tier-level and a number-of-allowed-requests per tenant-tier-level to the request-router, to provide the service to the tenant and other tenants having the determined tier-level, in a preconfigured time-window, based on the tenant tier-level and the number of allowed requests per tenant tier-level.

Techniques for dynamically cloning application infrastructures are provided. In one embodiment, a computer system can monitor one or more metrics pertaining to an infrastructure for an application at a first site. If the one or more metrics exceed or fall below one or more corresponding thresholds, the computer system can clone the infrastructure at a second site distinct from the first site, thereby enabling the application to be hosted at the second site.

Techniques for dynamically cloning application infrastructures are provided. In one embodiment, a computer system can monitor one or more metrics pertaining to an infrastructure for an application at a first site. If the one or more metrics exceed or fall below one or more corresponding thresholds, the computer system can clone the infrastructure at a second site distinct from the first site, thereby enabling the application to be hosted at the second site.

Techniques are disclosed for utilizing directed acyclic graphs for deployment instructions. A computer-implemented method can include various operations. Instructions may be executed by a computing device to perform parses of configuration data associated with a deployment. The computing device may cause a first directed acyclic graph (DAG) to be generated, the first DAG being utilized for deploying a first resource based on the parses. A second DAG may be generated for deploying execution targets based on the parses, the second DAG specifying dependencies between execution targets of the deployment. The computing device may generate a linked list data structure based on the parses and may deploy the computing system by traversal of the linked list data structure.