Cisco Technology, Inc.

Vmware, Inc.

Other

Varun A Shah

Ayan Banerjee

Asit Desai

Sourabh Jain

Eric Shannon Knauft

Enning Xiang

Yiqi Xu

Ojan Thornycroft

Ramkumar Parameswaran

Ronak K Desai

Mansi Shah

Nataraj Batchu

Vishnu Rajula

Wenguang Wang

Sanjay Sane

Abhay Kumar Roy

Jin Zhang

Erik Nordmark

Ye Zhang

Raghava Kodigenahalli Sivaramu

Leonard Thomas Tracy

Francois Edouard Tallet

Santosh Rajagopalan

Madhukar Anand

Lester C Ginsberg

Gopala Suryanarayana

Radhika Vullikanti

Peng Dai

Tissa Senevirathne

Lakshmi Priya Sarma

Wangping He

Gourav Kumar Sakargayan

Huseyin Sular

Xiaoou Zhao

This disclosure describes techniques for collecting network parameter data for network switches and/or physical servers and provisioning virtual resources of a service on physical servers based on network resource availability. The network parameter data may include network resource availability data, diagnostic constraint data, traffic flow data, etc. The techniques include determining network switches that have an availability of network resources to support a virtual resource on a connected physical server. A scheduler may deploy virtual machines to particular servers based on the network parameter data in lieu of, or in addition to, the server utilization data of the physical servers (e.g., CPU usage, memory usage, etc.). In this way, a virtual resource may be deployed to a physical server that has an availability of the server resources, but also is connected to a network switch with the availability of network resources to support the virtual resource.

Utilizing network analytics for service provisioning

Techniques for heating and/or cooling a structure including are described. The system may determine that a current indoor temperature is higher than both the current outdoor temperature and the target indoor temperature. Based on the determination, the system (in a cooling mode) may determine that a window opening criteria is met for opening one or more windows. Responsive to determining that the window opening criteria has been met, the system may instruct a window control mechanism to modify a state of the window from (a) a closed position that prevents airflow through the window to (b) an open position that allows for airflow through the window to cool a structure. Similarly, the system in a heating mode may open one or more windows when the current indoor temperature is lower than both the target indoor temperature and the current outdoor temperature.

Cooling and heating methodology and systems

A method for dynamic storage object configuration in a datacenter is provided. Embodiments include determining a number of fault domains in a storage cluster that have sufficient storage capacity for creating a storage object. Embodiments include applying a dynamic fault tolerance policy to the number of fault domains that have sufficient capacity for creating the storage object in order to determine a number of host failures to tolerate for the storage object, the dynamic fault tolerance policy specifying a manner of determining, for any respective storage object, a respective number of host failures to tolerate for storing the respective storage object in a respective storage cluster based on at least a respective number of fault domains of the respective storage cluster. Embodiments include implementing the storage object on the storage cluster based on the number of host failures to tolerate for the storage object.

Dynamic object policy reconfiguration mechanism for object storage system

The disclosure herein describes enhancing data durability of a base component of a data object using an unplanned delta component during transient fault unavailability. A base component of a data object becoming unavailable due to a transient fault is detected. A delta component associated with the base component is generated, wherein the delta component includes unwritten storage space with an address space and a tracking bitmap including a plurality of bits associated with data blocks of the address space of the delta component. The stale LSN with which the base component is associated is assigned to the delta component and the delta component is synchronized with an active component of the data object based on the assigned stale LSN. The delta component records write I/O targeted for the base component and, based on detecting the base component becoming available, the base component is synchronized with the delta component.

Maintaining durability of a data object using unplanned delta components during transient failures

Techniques for combining the metadata and data address spaces of a distributed storage object are provided. In one set of embodiments, a distributed storage system can receive a request to provision a storage object. In response, the distributed storage system can create, in accordance with an erasure coding scheme, one or more capacity components for holding data of the storage object; create, in accordance with a mirroring scheme having an equivalent level of fault tolerance as the erasure coding scheme, one or more metadata components for holding metadata of the storage object; and create a composite object configuration tree for the storage object that includes first and second subtrees, where the first subtree comprises an indication of the mirroring scheme and references to the one or more metadata components, and where the second subtree comprises an indication of the erasure coding scheme and references to the one or more capacity components.

Combining the metadata and data address spaces of a distributed storage object via a composite object configuration tree

The disclosure herein describes placing delta components of a base component in target fault domains. One or more delta components are generated. When a first fault domain that lacks a sibling component of the base component is identified, the first fault domain is selected as a single delta target fault domain and a single delta component is placed on the single delta target fault domain. When a second fault domain that includes a first sibling component of the base component is identified and a third fault domain that includes a second sibling component of the base component is identified, the second fault domain and the third fault domain are selected as a first double delta target fault domain and a second double delta target fault domain, and a first double delta component and a second double delta component are placed on the first and second double delta target fault domains.

Identifying fault domains for delta components of a distributed data object

The disclosure herein describes enhancing data durability of a base component using multiple delta components. A first and second delta component are generated based on the base component becoming unavailable. A write operation targeted for the base component is routed to the first delta component and to the second delta component. Based on routing the write operation targeted for the base component to the first delta component and to the second delta component, a bit associated with a data block affected by the write operation is changed in each of the tracking bitmaps of the first and second delta components. Based on detecting the base component becoming available, one delta component of the first and second delta components is selected, and the data block affected by the routed write operation is synchronized from the selected delta component to the base component. Later, the first and second delta components are removed.

Synchronizing a stale component of a distributed object using multiple delta components during maintenance

The disclosure herein describes reconfiguring a data object in a data store using batch portions of components of the data object. Instructions to reconfigure the data object to a target object layout are received, the data object including a concatenation layer that references a plurality of components. The components are grouped into batch portions and the batch portions are reconfigured in a series based on the received instructions. The reconfiguring for each batch portion includes allocating free storage space according to the target object layout as target components, copying the data stored in the batch portion to the target components, redirecting references in the concatenation layer from the components of the batch portion to the target components, and releasing storage space occupied by the components of the batch portion. As a result, storage space used as transient capacity during the reconfiguring is reduced to a size of the batch portions.

Reconfiguring data objects using batch processing of concatenated components

The disclosure herein describes throttling resynchronization operations in a cluster of distributed data stores based on I/O bandwidth limits. Resynchronization operations are added to a queue as they are received. A cluster resource manager accesses a resynchronization operation in the queue. A transient capacity value is determined and an available capacity value is obtained. A resynchronization limit of the cluster is identified, wherein the resynchronization limit indicates a maximum percentage of I/O bandwidth of the cluster that is for use by resynchronization operations. Based on a sum of the resynchronization capacity value and the transient capacity value being less than or equal to a product of the resynchronization limit and the available capacity value, the cluster resource manager initiates the accessed resynchronization operation on the cluster, whereby free space is maintained in the cluster for use by user operations.

Throttling resynchronization operations in a data store cluster based on I/O bandwidth limits

The proposed methodology enables finding the most efficient roots in the network to carry multicast traffic, while further providing a theoretical basis for such selection. It guarantees the minimum expected delivery cost for multicast frames in the absence of any knowledge about the source and receivers.

Mechanism and framework for finding optimal multicast tree roots without the knowledge of traffic sources and receivers for Fabricpath and TRILL

Exemplary methods, apparatuses, and systems determine that quorum can be maintained for a storage object in a distributed storage system in the event a defined maximum number of first partitions in a first level of storage and a second partitions in a second level of storage fail. When it is determined that there are insufficient numbers of first partitions and/or second partitions, additional first partitions and/or second partitions are associated with the storage object in the distributed storage system. A number of votes is calculated for distribution and an allocation is defined for assigning the votes to each component and witness component of the storage object.

Maintaining quorum of storage objects in nested levels of a distributed storage system

Mechanism and framework for finding optimal multicast tree roots without the knowledge of traffic sources and receivers for fabricpath and TRILL

Growing community of inventors

Los Altos Hills, CA, United States of America

Varun A Shah