Abstract: An embodiment includes a method to reduce operational impact from dysfunctional rollouts of product updates in managed networks. Before distributing a product update, input data about the rollout is received. Using the input data, an optimized distribution procedure is generated to minimize disruption and maximize product update distribution speed. The method includes selecting a subset of endpoints for initial deployment and assigning a specific time window for the distribution. A preconfigured distribution procedure is modified by modifying selection and timing parameters to align with the optimized distribution procedure. An update package is created to facilitate local implementation at the endpoints. The product update is then distributed according to the procedure and using the update package.

Abstract: A method of reducing operational impact resulting from a dysfunctional rollout of a product update in a managed network. The method includes initiating a distribution of a product update to a subset of endpoints according to a first distribution procedure. During the distribution, the method includes receiving input data related to the distribution; determining, based on the received input data, an optimized update distribution procedure for the product update and the managed network; and determining whether the optimized update distribution procedure includes an adjustment. Responsive to the optimized update distribution including an adjustment to a parameter of the first distribution procedure, the method includes modifying the parameter of the first distribution procedure according to the adjustment of the optimized update distribution to generate a modified distribution procedure.

Abstract: Sharing of content by users via the network is facilitated. Sharing suggestions are made to a user, the sharing suggestions including making a suggestion of one or more users with whom the user might wish to share content. A user's influence on other users and the user can be prompted to share content with other users based on the identified influence.

Abstract: Techniques are provided for a peer-to-peer web traffic management. A first mapping between identifiers and peers in a network is established. Upon receiving a first request associated with a first identifier and classifiers, based, at least in part, on the first identifier, a first peer retrieves a first global counter snapshot and a first local increment counter, and uses them to determine whether the first peer can service the first request. If the determination is positive, then the first peer services the first request, and updates the first local increment counter. If the first local increment counter exceeded a threshold value, then the first local increment counter is transmitted to a second peer, and then reset to zero. In response to the first peer receiving a first global counter associated with the first global counter snapshot, the first global counter snapshot is updated with the first global counter.

Abstract: Techniques are provided for a peer-to-peer web traffic management. A first mapping between identifiers and peers in a network is established. Upon receiving a first request associated with a first identifier and classifiers, based, at least in part, on the first identifier, a first peer retrieves a first global counter snapshot and a first local increment counter, and uses them to determine whether the first peer can service the first request. If the determination is positive, then the first peer services the first request, and updates the first local increment counter. If the first local increment counter exceeded a threshold value, then the first local increment counter is transmitted to a second peer, and then reset to zero. In response to the first peer receiving a first global counter associated with the first global counter snapshot, the first global counter snapshot is updated with the first global counter.

Abstract: Techniques are provided for a peer-to-peer web traffic management. A first mapping between identifiers and peers in a network is established. Upon receiving a first request associated with a first identifier and classifiers, based, at least in part, on the first identifier, a first peer retrieves a first global counter snapshot and a first local increment counter, and uses them to determine whether the first peer can service the first request. If the determination is positive, then the first peer services the first request, and updates the first local increment counter. If the first local increment counter exceeded a threshold value, then the first local increment counter is transmitted to a second peer, and then reset to zero. In response to the first peer receiving a first global counter associated with the first global counter snapshot, the first global counter snapshot is updated with the first global counter.

Abstract: Techniques are provided for a peer-to-peer web traffic management. A first mapping between identifiers and peers in a network is established. Upon receiving a first request associated with a first identifier and classifiers, based, at least in part, on the first identifier, a first peer retrieves a first global counter snapshot and a first local increment counter, and uses them to determine whether the first peer can service the first request. If the determination is positive, then the first peer services the first request, and updates the first local increment counter. If the first local increment counter exceeded a threshold value, then the first local increment counter is transmitted to a second peer, and then reset to zero. In response to the first peer receiving a first global counter associated with the first global counter snapshot, the first global counter snapshot is updated with the first global counter.

Abstract: Techniques are provided for a peer-to-peer web traffic management. A first mapping between identifiers and peers in a network is established. Upon receiving a first request associated with a first identifier and classifiers, based, at least in part, on the first identifier, a first peer retrieves a first global counter snapshot and a first local increment counter, and uses them to determine whether the first peer can service the first request. If the determination is positive, then the first peer services the first request, and updates the first local increment counter. If the first local increment counter exceeded a threshold value, then the first local increment counter is transmitted to a second peer, and then reset to zero. In response to the first peer receiving a first global counter associated with the first global counter snapshot, the first global counter snapshot is updated with the first global counter.

Abstract: Techniques are provided for a peer-to-peer web traffic management. A first mapping between identifiers and peers in a network is established. Upon receiving a first request associated with a first identifier and classifiers, based, at least in part, on the first identifier, a first peer retrieves a first global counter snapshot and a first local increment counter, and uses them to determine whether the first peer can service the first request. If the determination is positive, then the first peer services the first request, and updates the first local increment counter. If the first local increment counter exceeded a threshold value, then the first local increment counter is transmitted to a second peer, and then reset to zero. In response to the first peer receiving a first global counter associated with the first global counter snapshot, the first global counter snapshot is updated with the first global counter.

Abstract: A computer-implemented method of providing distributed layer seven traffic shaping includes receiving one or more service requests from one or more clients. The one or more service requests include network usage information associated with the one or more clients. The computer-implemented method also includes aggregating the network usage information from the one or more clients across one or more data centers. Further, the computer-implemented method includes computing a delay required for throttling the service request based on data transferred. Furthermore, the computer-implemented method includes communicating the delay to the one or more clients. Moreover, the computer-implemented method includes throttling the one or more service requests based on the delay across the one or more data centers.

Abstract: Sharing of content by users via the network is facilitated. Sharing suggestions are made to a user, the sharing suggestions including making a suggestion of one or more users with whom the user might wish to share content. A user's influence on other users and the user can be prompted to share content with other users based on the identified influence.