Abstract: This application relates to load balancing for a number of partitions of a network-based storage service. Each partition includes a number of server devices and/or network devices located in a data center and configured to provide access to storage resources hosted within the data center. User accounts are assigned to a particular partition such that requests related to a particular user account are routed to that partition. Periodically, a load balancing algorithm is executed to re-assign user accounts to different partitions to rebalance resource consumption across the different partitions. The load balancing algorithm can balance resource consumption for any number of resource types by generating a vector of resource utilization parameters for each user account, sorting the plurality of user accounts into clusters based on the vectors, and mapping at least some user accounts to different partitions.

Abstract: This application relates to load balancing for a number of partitions of a network-based storage service. Each partition includes a number of server devices and/or network devices located in a data center and configured to provide access to storage resources hosted within the data center. User accounts are assigned to a particular partition such that requests related to a particular user account are routed to that partition. Periodically, a load balancing algorithm is executed to re-assign user accounts to different partitions to rebalance resource consumption across the different partitions. The load balancing algorithm can balance resource consumption for any number of resource types by generating a vector of resource utilization parameters for each user account, sorting the plurality of user accounts into clusters based on the vectors, and mapping at least some user accounts to different partitions.

Abstract: A markup language document representing computing elements of a computing architecture, such as data storage elements of a data storage architecture, is constructed and analyzed. A first computing element contained by a second computing element is represented; a first tag of the document corresponding to the first computing element is nested within a second tag of the markup language document corresponding to the second computing element. A non-containing/contained relationship from the first computing element to a third computing element is also represented; a pointer tag of the document corresponding to the data access path is nested within the first tag, and references a third tag of the document corresponding to the third computing element. Get-pointer-node and get-child-node application programming interfaces for the markup language are called to traverse among containing/contained relationships. Pointer tags are followed to traverse among non-containing/contained relationships.

Abstract: A markup language document representing computing elements of a computing architecture, such as data storage elements of a data storage architecture, is constructed and analyzed. A first computing element contained by a second computing element is represented; a first tag of the document corresponding to the first computing element is nested within a second tag of the markup language document corresponding to the second computing element. A non-containing/contained relationship from the first computing element to a third computing element is also represented; a pointer tag of the document corresponding to the data access path is nested within the first tag, and references a third tag of the document corresponding to the third computing element. Get-pointer-node and get-child-node application programming interfaces for the markup language are called to traverse among containing/contained relationships. Pointer tags are followed to traverse among non-containing/contained relationships.

Abstract: A markup language document representing computing elements of a computing architecture, such as data storage elements of a data storage architecture, is constructed and analyzed. A first computing element contained by a second computing element is represented; a first tag of the document corresponding to the first computing element is nested within a second tag of the markup language document corresponding to the second computing element. A non-containing/contained relationship from the first computing element to a third computing element is also represented; a pointer tag of the document corresponding to the data access path is nested within the first tag, and references a third tag of the document corresponding to the third computing element. Get-pointer-node and get-child-node application programming interfaces for the markup language are called to traverse among containing/contained relationships. Pointer tags are followed to traverse among non-containing/contained relationships.

Abstract: A markup language document representing computing elements of a computing architecture, such as data storage elements of a data storage architecture, is constructed and analyzed. A first computing element contained by a second computing element is represented; a first tag of the document corresponding to the first computing element is nested within a second tag of the markup language document corresponding to the second computing element. A non-containing/contained relationship from the first computing element to a third computing element is also represented; a pointer tag of the document corresponding to the data access path is nested within the first tag, and references a third tag of the document corresponding to the third computing element. Get-pointer-node and get-child-node application programming interfaces for the markup language are called to traverse among containing/contained relationships. Pointer tags are followed to traverse among non-containing/contained relationships.