A method (100) of controlling traffic flows in a radio communications network, the method comprising steps of: receiving (102) at a remote node a plurality of traffic flows transmitted from a plurality of radio units; buffering (104) the traffic flows in a common buffer of the remote node; and causing (106) a control signal to be sent to a baseband unit when a fill level of the common buffer is predicted to go above a maximum fill level within a pre-set time interval, wherein the control signal is configured to cause an adjustment of a radio resource allocation of one of the plurality of radio units to cause a reduction in a data rate of the traffic flow transmitted from said radio unit.

A mechanism is disclosed for implementing conditional commands carried by network data packets. A data flow including a data packet is received. The data packet includes a conditional command. A condition and a command are obtained from the conditional command. The mechanism determines that the condition is satisfied. Based on the determination that the condition is satisfied, the command is executed to alter handling of the data flow, alter handling of the data packet, or alter a context for the data flow.

A method may include, by a network resource optimization system, receiving from a network node a resource request, determining a plurality of network resources based on the resource request, and determining a subset of network resources from the plurality of network resources and a network resource from the subset based on a score of each network resource. The score of each network resource may be based on a rate of acceptance of communication requests received or a number of communication sessions established. The method may include, by the network resource optimization system, transmitting a communication request to the determined network resource and receiving an acceptance from the network resource. The method may include, by the network resource optimization system, causing a selection mechanism to be activated at the network node, receiving from the network node a selection, and initiating the communication session in response to the selection.

A system and method for providing high availability for a thin-provisioned container cluster includes a memory, one or more processors in communication with the memory, a scheduler executing on the one or more processors, and a spot instance market monitor. The spot instance market monitor receives market information about spot instances in a cloud system at a first time. The spot instances are available to a client at the first time. The spot instance market monitor determines, based on the market information, a respective reliability value for each of the spot instances at the first time. Then, the scheduler selects one spot instance among the spot instances based on the reliability value of the spot instance. In response to the selection of the spot instance, the scheduler schedules a container on the spot instance and executes the container on the spot instance.

Providing fluid external access to a resource that is internal to a network from external to that network. From within the network, the internal user simply provides an internal identifier, and the external user accesses not the internal identifier, but an external uniform resource identifier (URL) that the external user can simply select to obtain access to the internal resource of the network. This is accomplished by translating the internal identifier to an external URL having a proxy server as its domain name. When the external URL selects the URL, a request with that external URL is made to the proxy server, which translates the external URL back to the internal identifier, and coordinates with the network to obtain the resource for the external user.

A mechanism is disclosed for implementing conditional commands carried by network data packets. A data flow including a data packet is received. The data packet includes a conditional command. A condition and a command are obtained from the conditional command. The mechanism determines that the condition is satisfied. Based on the determination that the condition is satisfied, the command is executed to alter handling of the data flow, alter handling of the data packet, or alter a context for the data flow.

Techniques for resegmenting a partition in a distributed stream-processing platform are provided. The techniques include receiving a trigger to move a partition of the distributed stream-processing platform from a first broker on a first set of physical resources to a second broker on a second a set of physical resources. In response to the trigger, the partition is allocated on the second broker, and the first broker is configured to redirect, to the second broker, requests for new messages after a last offset in the partition without replicating older messages before the last offset to the second broker. Idempotent produce metadata for the partition from the first broker is then merged into the second broker. Finally, metadata for processing requests for the partition is updated to include the second broker.

A method for utilizing elastic resource pooling techniques to dynamically rebalance throughput includes determining, for each of multiple tenants leasing computing resources of a shared resource pool, a desired claim to resources in the shared resource pool. The desired claim is based on a number of resource access requests received in association with each of the multiple tenants. The method further includes determining, for each of the multiple tenants, a guaranteed claim and a maximum potential claim on the shared resource pool; and allocating a surplus resource pool among the multiple tenants based on the determined maximum potential claim and the desired claim for each one of the multiple tenants, the surplus resource pool representing a remainder of the shared resource pool after the guaranteed claim for each of the tenants is satisfied via an initial resource allocation from the shared resource pool.

A computing device can be configured to receive information representing access and/or requests to access resources on at least one network. Access to a first network-based resource at a first time by a first entity is detected, and a request for access to, access to, or both the request for access and the access to a second network-based resource at a second time by the first entity is detected. A period of elapsed time between the first time and the second time is calculated and a probability of the first entity accessing or requesting access to the second network-based resource within the period of elapsed time of having accessed the first network-based resource is calculated. Thereafter, first entity's access to at least one network-based resource is regulated based on the determined probability relative to a predetermined threshold.

In an embodiment, header information of messages is altered to specify a window within which to receive information, so that the messages sent by a remote device will be sent at a rate that a network can receive messages. The sending of acknowledgements of messages are paced to control window growth. Bandwidth is allocated to a plurality of flows such that the satisfied flows require less bandwidth than an amount of bandwidth allocated to each unsatisfied flow.