Abstract: Systems and methods are described for allocating requests to implement new workloads within a heterogenous fleet. The fleet can include various sub-fleets, each corresponding to a set of computing devices having a given configuration of computing resources. A routing device can calculate n-dimensional decision surfaces that map expected resource usage associated with an incoming request to probabilities to route the request to each sub-fleet. The decision surfaces can be calculated to maximize cost-weighted headroom across the sub-fleets, with headroom on each sub-fleet reflecting a geometrical dissimilarity in a shape of load on the sub-fleet and a shape of resources available on the sub-fleet. By comparing the expected resource usage associated with the incoming request to the decision surfaces, the device can determine a sub-fleet to which to route the requests.

Abstract: In one example, we describe a method that generates cyclicality rules for anomaly detection for a hierarchical/tree based data structure. A new algorithm for processing nodes in hierarchy, as well as business rules for nodes, is described. Variations and examples are given to describe different scopes and embodiments of the invention. Exclusion criteria and children nodes are used as some examples for the implementations, with flow charts to describe the methods of application, as examples.

Abstract: In one embodiment, we describe a method that generates seasonality rules for anomaly detection for a hierarchical/tree based data structure. A new algorithm for processing nodes in hierarchy, as well as business rules for nodes, is described. Variations and examples are given to describe different scopes and embodiments of the invention. Exclusion criteria and children nodes are used as some examples for the implementations, with flow charts to describe the methods of application, as examples.

Abstract: In one embodiment, we describe a method that generates seasonality rules for anomaly detection for a hierarchical/tree based data structure. A new algorithm for processing nodes in hierarchy, as well as business rules for nodes, is described. Variations and examples are given to describe different scopes and embodiments of the invention. Exclusion criteria and children nodes are used as some examples for the implementations, with flow charts to describe the methods of application, as examples.