Abstract: A method for proactively rebuilding user data in a plurality of storage nodes of a storage cluster is provided. The method includes distributing user data and metadata throughout the plurality of storage nodes such that the plurality of storage nodes can read the user data, using erasure coding, despite loss of two of the storage nodes. The method includes determining that one of the storage nodes is unreachable and determining to rebuild the user data for the one of the storage nodes that is unreachable. The method includes reading the user data across a remainder of the plurality of storage nodes, using the erasure coding and writing the user data across the remainder of the plurality of storage nodes, using the erasure coding. A plurality of storage nodes within a single chassis that can proactively rebuild the user data stored within the storage nodes is also provided.

Abstract: A method for proactively rebuilding user data in a plurality of storage nodes of a storage cluster is provided. The method includes distributing user data and metadata throughout the plurality of storage nodes such that the plurality of storage nodes can read the user data, using erasure coding, despite loss of two of the storage nodes. The method includes determining that one of the storage nodes is unreachable and determining to rebuild the user data for the one of the storage nodes that is unreachable. The method includes reading the user data across a remainder of the plurality of storage nodes, using the erasure coding and writing the user data across the remainder of the plurality of storage nodes, using the erasure coding. A plurality of storage nodes within a single chassis that can proactively rebuild the user data stored within the storage nodes is also provided.

Abstract: A storage cluster includes a plurality of storage nodes. Each of the plurality of storage nodes includes nonvolatile solid-state memory and each of the plurality of storage nodes is configured to cooperate with others of the plurality of storage nodes having differing storage capacities in applying erasure coding. The plurality of storage nodes are configured to distribute the user data and metadata throughout the plurality of storage nodes.

Abstract: A storage cluster includes a plurality of storage nodes. Each of the plurality of storage nodes includes nonvolatile solid-state memory and each of the plurality of storage nodes is configured to cooperate with others of the plurality of storage nodes having differing storage capacities in applying erasure coding. The plurality of storage nodes are configured to distribute the user data and metadata throughout the plurality of storage nodes.

Abstract: A wireless network metric region in a wireless network is determined using a node metric region and a performance metric. The node metric region, which includes a boundary of the node metric region, for each node is estimated and the performance metric for the node metric region for each node is measured. The boundary of the node metric region for each node is adjusted based on the measured performance metric and then the wireless network metric region for the wireless network is determined based on the adjusted boundaries of the node metric region for each node.

Abstract: Locations for deploying mesh nodes in a wireless network are determined based on a Terminal Steiner tree (TST). The TST that is formulated from an input graph and client locations in the wireless network is determined. The input graph includes signal strength values for pairs of mesh node-to-client location and mesh node-to-mesh node links and mesh node locations for deploying the mesh nodes are selected from the Steiner nodes in the TST.

Abstract: A location for placing a new capacity point in a wireless network is determined based on a wireless contention of the network and capacities for capacity points in the network. Each capacity point is a network device interfacing the network with a second network. The capacities are calculated as a function of the wireless contention.

Abstract: A wireless network metric region in a wireless network is determined using a node metric region and a performance metric. The node metric region, which includes a boundary of the node metric region, for each node is estimated and the performance metric for the node metric region for each node is measured. The boundary of the node metric region for each node is adjusted based on the measured performance metric and then the wireless network metric region for the wireless network is determined based on the adjusted boundaries of the node metric region for each node.

Abstract: Locations for deploying mesh nodes in a wireless network are determined based on a Terminal Steiner tree (TST). The TST that is formulated from an input graph and client locations in the wireless network is determined. The input graph includes signal strength values for pairs of mesh node-to-client location and mesh node-to-mesh node links and mesh node locations for deploying the mesh nodes are selected from the Steiner nodes in the TST.

Abstract: A location for placing a new capacity point in a wireless network is determined based on a wireless contention of the network and capacities for capacity points in the network. Each capacity point is a network device interfacing the network with a second network. The capacities are calculated as a function of the wireless contention.