Using persistent memory to enable restartability of bulk load transactions in cloud databases

Information

  • Patent Grant
  • 11481362
  • Patent Number
    11,481,362
  • Date Filed
    Monday, November 13, 2017
    6 years ago
  • Date Issued
    Tuesday, October 25, 2022
    a year ago
Abstract
Systems, methods, and computer-readable media for managing storing of data in a data storage system using a client tag. In some examples, a first portion of a data load as part of a transaction and a client identifier that uniquely identifies a client is received from the client at a data storage system. The transaction can be tagged with a client tag including the client identifier and the first portion of the data load can be stored in storage at the data storage system. A first log entry including the client tag is added to a data storage log in response to storing the first portion of the data load in the storage. The first log entry is then written from the data storage log to a persistent storage log in persistent memory which is used to track progress of storing the data load in the storage.
Description
TECHNICAL FIELD

The present technology pertains to data storage, and in particular to resuming transactions in data storage systems using client tags.


BACKGROUND

In traditional databases, when a user transfers a large portion of data to be stored by the database management system, a user has to ensure that the entire portion of data is transferred and stored correctly by the database management system. In particular, cloud analytics often requires uploading of large files or amounts of data whereby analytics can subsequently process the files. In transferring large amounts of data, as a result of the large sizes of data, the data is transferred as part of a transaction. This presents problems if the database management system goes offline or the transfer of the data is otherwise interrupted. In particular, cloud-based data storage systems are more susceptible to connectivity issues leading to interrupted data transfer transactions. As a result, the user might have to restart transferring the data from the beginning to the database management system. This is problematic because it consumes large amounts of resources, including network bandwidth.





BRIEF DESCRIPTION OF THE DRAWINGS

In order to describe the manner in which the above-recited and other advantages and features of the disclosure can be obtained, a more particular description of the principles briefly described above will be rendered by reference to specific embodiments thereof which are illustrated in the appended drawings. Understanding that these drawings depict only exemplary embodiments of the disclosure and are not therefore to be considered to be limiting of its scope, the principles herein are described and explained with additional specificity and detail through the use of the accompanying drawings in which:



FIG. 1A illustrates an example cloud computing architecture;



FIG. 1B illustrates an example fog computing architecture;



FIG. 2A illustrates a diagram of an example Network Environment;



FIG. 2B illustrates another example of a Network Environment;



FIG. 3 depicts a diagram of a storage environment 300 configured to provide functionalities to resume transactions without restarting the transactions;



FIG. 4 depicts a diagram of an example log entry specific transaction management system;



FIG. 5 illustrates a flowchart for an example method of maintaining a persistent storage log for use in resuming transactions with a data storage system;



FIG. 6 illustrates a flowchart for an example method of resuming a transaction for a transfer of a data load to a data storage system using a persistent storage log implemented in persistent memory;



FIG. 7 illustrates an example computing system; and



FIG. 8 illustrates an example network device.





DESCRIPTION OF EXAMPLE EMBODIMENTS

Various embodiments of the disclosure are discussed in detail below. While specific implementations are discussed, it should be understood that this is done for illustration purposes only. A person skilled in the relevant art will recognize that other components and configurations may be used without parting from the spirit and scope of the disclosure. Thus, the following description and drawings are illustrative and are not to be construed as limiting. Numerous specific details are described to provide a thorough understanding of the disclosure. However, in certain instances, well-known or conventional details are not described in order to avoid obscuring the description. References to one or an embodiment in the present disclosure can be references to the same embodiment or any embodiment; and, such references mean at least one of the embodiments.


Reference to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the disclosure. The appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Moreover, various features are described which may be exhibited by some embodiments and not by others.


The terms used in this specification generally have their ordinary meanings in the art, within the context of the disclosure, and in the specific context where each term is used. Alternative language and synonyms may be used for any one or more of the terms discussed herein, and no special significance should be placed upon whether or not a term is elaborated or discussed herein. In some cases, synonyms for certain terms are provided. A recital of one or more synonyms does not exclude the use of other synonyms. The use of examples anywhere in this specification including examples of any terms discussed herein is illustrative only, and is not intended to further limit the scope and meaning of the disclosure or of any example term. Likewise, the disclosure is not limited to various embodiments given in this specification.


Without intent to limit the scope of the disclosure, examples of instruments, apparatus, methods and their related results according to the embodiments of the present disclosure are given below. Note that titles or subtitles may be used in the examples for convenience of a reader, which in no way should limit the scope of the disclosure. Unless otherwise defined, technical and scientific terms used herein have the meaning as commonly understood by one of ordinary skill in the art to which this disclosure pertains. In the case of conflict, the present document, including definitions will control.


Additional features and advantages of the disclosure will be set forth in the description which follows, and in part will be obvious from the description, or can be learned by practice of the herein disclosed principles. The features and advantages of the disclosure can be realized and obtained by means of the instruments and combinations particularly pointed out in the appended claims. These and other features of the disclosure will become more fully apparent from the following description and appended claims, or can be learned by the practice of the principles set forth herein.


Overview


A method can include receiving from a client at a data storage system a first portion of a data load as part of a transaction and a client identifier that uniquely identifies the client. The transaction can be tagged with a client tag including the client identifier and the first portion of the data load can be stored in storage at the data storage system. A first log entry including the client tag can be added to a data storage log in response to storing the first portion of the data load in the storage. The first log entry can then be written from the data storage log to a persistent storage log in persistent memory which can be used to track progress of storing the data load in the storage.


A system can receive, at a data storage system from a client, a first portion of a data load as part of a transaction and a client identifier that uniquely identifies the client. The transaction can be tagged with a client tag including the client identifier. The system can add a first log entry including the client tag indicating the first portion of the data load is stored in storage at the data storage system to a data storage log as part of write-ahead logging. The system can store the first portion of the data load in the storage at the data storage system. Subsequently, the first log entry can be written from the data storage log to a persistent storage log stored in persistent memory and the first log entry stored in the persistent storage log can be used to track progress of storing the data load in the storage at the data storage system.


A system can receive, at a data storage system from a client, a first portion of a data load as part of a transaction and a client identifier that uniquely identifies the client. The transaction can be tagged with a client tag including the client identifier and the first portion of the data load can be stored in storage at the data storage system. The system can add a first log entry including the client tag to a data storage log in response to storing the first portion of the data load in the storage at the data storage system. Subsequently, the system can write the first log entry from the data storage log to a persistent storage log stored in persistent memory. The first log entry stored in the persistent storage log can be used to track progress of storing the data load in the storage at the data storage system and the progress of storing the data load in the storage at the data storage system can be used to resume transfer of the data load from the client.


DESCRIPTION

The disclosed technology addresses the need in the art for supporting resumption of bulk load transfers. The present technology involves system, methods, and computer-readable media for maintaining logs of load transfers in persistent memory to allow for resumption of the load transfers in the event that the bulk load transfers are interrupted.


A description of network environments and architectures for network data access and services, as illustrated in FIGS. 1A, 1B, 2A, and 2B, is first disclosed herein. A discussion of systems and methods for resuming transactions in data storage systems using client tags, as shown in FIGS. 3, 4, 5, and 6, will then follow. The discussion then concludes with a brief description of example devices, as illustrated in FIGS. 7 and 8. These variations shall be described herein as the various embodiments are set forth. The disclosure now turns to FIG. 1A.



FIG. 1A illustrates a diagram of an example cloud computing architecture 100. The architecture can include a cloud 102. The cloud 102 can include one or more private clouds, public clouds, and/or hybrid clouds. Moreover, the cloud 102 can include cloud elements 104-114. The cloud elements 104-114 can include, for example, servers 104, virtual machines (VMs) 106, one or more software platforms 108, applications or services 110, software containers 112, and infrastructure nodes 114. The infrastructure nodes 114 can include various types of nodes, such as compute nodes, storage nodes, network nodes, management systems, etc.


The cloud 102 can provide various cloud computing services via the cloud elements 104-114, such as software as a service (SaaS) (e.g., collaboration services, email services, enterprise resource planning services, content services, communication services, etc.), infrastructure as a service (IaaS) (e.g., security services, networking services, systems management services, etc.), platform as a service (PaaS) (e.g., web services, streaming services, application development services, etc.), and other types of services such as desktop as a service (DaaS), information technology management as a service (ITaaS), managed software as a service (MSaaS), mobile backend as a service (MBaaS), etc.


The client endpoints 116 can connect with the cloud 102 to obtain one or more specific services from the cloud 102. The client endpoints 116 can communicate with elements 104-114 via one or more public networks (e.g., Internet), private networks, and/or hybrid networks (e.g., virtual private network). The client endpoints 116 can include any device with networking capabilities, such as a laptop computer, a tablet computer, a server, a desktop computer, a smartphone, a network device (e.g., an access point, a router, a switch, etc.), a smart television, a smart car, a sensor, a GPS device, a game system, a smart wearable object (e.g., smartwatch, etc.), a consumer object (e.g., Internet refrigerator, smart lighting system, etc.), a city or transportation system (e.g., traffic control, toll collection system, etc.), an internet of things (IoT) device, a camera, a network printer, a transportation system (e.g., airplane, train, motorcycle, boat, etc.), or any smart or connected object (e.g., smart home, smart building, smart retail, smart glasses, etc.), and so forth.



FIG. 1B illustrates a diagram of an example fog computing architecture 150. The fog computing architecture 150 can include the cloud layer 154, which includes the cloud 102 and any other cloud system or environment, and the fog layer 156, which includes fog nodes 162. The client endpoints 116 can communicate with the cloud layer 154 and/or the fog layer 156. The architecture 150 can include one or more communication links 152 between the cloud layer 154, the fog layer 156, and the client endpoints 116. Communications can flow up to the cloud layer 154 and/or down to the client endpoints 116.


The fog layer 156 or “the fog” provides the computation, storage and networking capabilities of traditional cloud networks, but closer to the endpoints. The fog can thus extend the cloud 102 to be closer to the client endpoints 116. The fog nodes 162 can be the physical implementation of fog networks. Moreover, the fog nodes 162 can provide local or regional services and/or connectivity to the client endpoints 116. As a result, traffic and/or data can be offloaded from the cloud 102 to the fog layer 156 (e.g., via fog nodes 162). The fog layer 156 can thus provide faster services and/or connectivity to the client endpoints 116, with lower latency, as well as other advantages such as security benefits from keeping the data inside the local or regional network(s).


The fog nodes 162 can include any networked computing devices, such as servers, switches, routers, controllers, cameras, access points, gateways, etc. Moreover, the fog nodes 162 can be deployed anywhere with a network connection, such as a factory floor, a power pole, alongside a railway track, in a vehicle, on an oil rig, in an airport, on an aircraft, in a shopping center, in a hospital, in a park, in a parking garage, in a library, etc.


In some configurations, one or more fog nodes 162 can be deployed within fog instances 158, 160. The fog instances 158, 158 can be local or regional clouds or networks. For example, the fog instances 156, 158 can be a regional cloud or data center, a local area network, a network of fog nodes 162, etc. In some configurations, one or more fog nodes 162 can be deployed within a network, or as standalone or individual nodes, for example. Moreover, one or more of the fog nodes 162 can be interconnected with each other via links 164 in various topologies, including star, ring, mesh or hierarchical arrangements, for example.


In some cases, one or more fog nodes 162 can be mobile fog nodes. The mobile fog nodes can move to different geographic locations, logical locations or networks, and/or fog instances while maintaining connectivity with the cloud layer 154 and/or the endpoints 116. For example, a particular fog node can be placed in a vehicle, such as an aircraft or train, which can travel from one geographic location and/or logical location to a different geographic location and/or logical location. In this example, the particular fog node may connect to a particular physical and/or logical connection point with the cloud 154 while located at the starting location and switch to a different physical and/or logical connection point with the cloud 154 while located at the destination location. The particular fog node can thus move within particular clouds and/or fog instances and, therefore, serve endpoints from different locations at different times.



FIG. 2A illustrates a diagram of an example Network Environment 200, such as a data center. In some cases, the Network Environment 200 can include a data center, which can support and/or host the cloud 102. The Network Environment 200 can include a Fabric 220 which can represent the physical layer or infrastructure (e.g., underlay) of the Network Environment 200. Fabric 220 can include Spines 202 (e.g., spine routers or switches) and Leafs 204 (e.g., leaf routers or switches) which can be interconnected for routing or switching traffic in the Fabric 220. Spines 202 can interconnect Leafs 204 in the Fabric 220, and Leafs 204 can connect the Fabric 220 to an overlay or logical portion of the Network Environment 200, which can include application services, servers, virtual machines, containers, endpoints, etc. Thus, network connectivity in the Fabric 220 can flow from Spines 202 to Leafs 204, and vice versa. The interconnections between Leafs 204 and Spines 202 can be redundant (e.g., multiple interconnections) to avoid a failure in routing. In some embodiments, Leafs 204 and Spines 202 can be fully connected, such that any given Leaf is connected to each of the Spines 202, and any given Spine is connected to each of the Leafs 204. Leafs 204 can be, for example, top-of-rack (“ToR”) switches, aggregation switches, gateways, ingress and/or egress switches, provider edge devices, and/or any other type of routing or switching device.


Leafs 204 can be responsible for routing and/or bridging tenant or customer packets and applying network policies or rules. Network policies and rules can be driven by one or more Controllers 216, and/or implemented or enforced by one or more devices, such as Leafs 204. Leafs 204 can connect other elements to the Fabric 220. For example, Leafs 204 can connect Servers 206, Hypervisors 208, Virtual Machines (VMs) 210, Applications 212, Network Device 214, etc., with Fabric 220. Such elements can reside in one or more logical or virtual layers or networks, such as an overlay network. In some cases, Leafs 204 can encapsulate and decapsulate packets to and from such elements (e.g., Servers 206) in order to enable communications throughout Network Environment 200 and Fabric 220. Leafs 204 can also provide any other devices, services, tenants, or workloads with access to Fabric 220. In some cases, Servers 206 connected to Leafs 204 can similarly encapsulate and decapsulate packets to and from Leafs 204. For example, Servers 206 can include one or more virtual switches or routers or tunnel endpoints for tunneling packets between an overlay or logical layer hosted by, or connected to, Servers 206 and an underlay layer represented by Fabric 220 and accessed via Leafs 204.


Applications 212 can include software applications, services, containers, appliances, functions, service chains, etc. For example, Applications 212 can include a firewall, a database, a CDN server, an IDS/IPS, a deep packet inspection service, a message router, a virtual switch, etc. An application from Applications 212 can be distributed, chained, or hosted by multiple endpoints (e.g., Servers 206, VMs 210, etc.), or may run or execute entirely from a single endpoint.


VMs 210 can be virtual machines hosted by Hypervisors 208 or virtual machine managers running on Servers 206. VMs 210 can include workloads running on a guest operating system on a respective server. Hypervisors 208 can provide a layer of software, firmware, and/or hardware that creates, manages, and/or runs the VMs 210. Hypervisors 208 can allow VMs 210 to share hardware resources on Servers 206, and the hardware resources on Servers 206 to appear as multiple, separate hardware platforms. Moreover, Hypervisors 208 on Servers 206 can host one or more VMs 210.


In some cases, VMs 210 and/or Hypervisors 208 can be migrated to other Servers 206. Servers 206 can similarly be migrated to other locations in Network Environment 200. For example, a server connected to a specific leaf can be changed to connect to a different or additional leaf. Such configuration or deployment changes can involve modifications to settings, configurations and policies that are applied to the resources being migrated as well as other network components.


In some cases, one or more Servers 206, Hypervisors 208, and/or VMs 210 can represent or reside in a tenant or customer space. Tenant space can include workloads, services, applications, devices, networks, and/or resources that are associated with one or more clients or subscribers. Accordingly, traffic in Network Environment 200 can be routed based on specific tenant policies, spaces, agreements, configurations, etc. Moreover, addressing can vary between one or more tenants. In some configurations, tenant spaces can be divided into logical segments and/or networks and separated from logical segments and/or networks associated with other tenants. Addressing, policy, security and configuration information between tenants can be managed by Controllers 216, Servers 206, Leafs 204, etc.


Configurations in Network Environment 200 can be implemented at a logical level, a hardware level (e.g., physical), and/or both. For example, configurations can be implemented at a logical and/or hardware level based on endpoint or resource attributes, such as endpoint types and/or application groups or profiles, through a software-defined network (SDN) framework (e.g., Application-Centric Infrastructure (ACI) or VMWARE NSX). To illustrate, one or more administrators can define configurations at a logical level (e.g., application or software level) through Controllers 216, which can implement or propagate such configurations through Network Environment 200. In some examples, Controllers 216 can be Application Policy Infrastructure Controllers (APICs) in an ACI framework. In other examples, Controllers 216 can be one or more management components for associated with other SDN solutions, such as NSX Managers.


Such configurations can define rules, policies, priorities, protocols, attributes, objects, etc., for routing and/or classifying traffic in Network Environment 200. For example, such configurations can define attributes and objects for classifying and processing traffic based on Endpoint Groups (EPGs), Security Groups (SGs), VM types, bridge domains (BDs), virtual routing and forwarding instances (VRFs), tenants, priorities, firewall rules, etc. Other example network objects and configurations are further described below. Traffic policies and rules can be enforced based on tags, attributes, or other characteristics of the traffic, such as protocols associated with the traffic, EPGs associated with the traffic, SGs associated with the traffic, network address information associated with the traffic, etc. Such policies and rules can be enforced by one or more elements in Network Environment 200, such as Leafs 204, Servers 206, Hypervisors 208, Controllers 216, etc. As previously explained, Network Environment 200 can be configured according to one or more particular software-defined network (SDN) solutions, such as CISCO ACI or VMWARE NSX. These example SDN solutions are briefly described below.


ACI can provide an application-centric or policy-based solution through scalable distributed enforcement. ACI supports integration of physical and virtual environments under a declarative configuration model for networks, servers, services, security, requirements, etc. For example, the ACI framework implements EPGs, which can include a collection of endpoints or applications that share common configuration requirements, such as security, QoS, services, etc. Endpoints can be virtual/logical or physical devices, such as VMs, containers, hosts, or physical servers that are connected to Network Environment 200. Endpoints can have one or more attributes such as a VM name, guest OS name, a security tag, application profile, etc. Application configurations can be applied between EPGs, instead of endpoints directly, in the form of contracts. Leafs 204 can classify incoming traffic into different EPGs. The classification can be based on, for example, a network segment identifier such as a VLAN ID, VXLAN Network Identifier (VNID), NVGRE Virtual Subnet Identifier (VSID), MAC address, IP address, etc.


In some cases, classification in the ACI infrastructure can be implemented by Application Virtual Switches (AVS), which can run on a host, such as a server or switch. For example, an AVS can classify traffic based on specified attributes, and tag packets of different attribute EPGs with different identifiers, such as network segment identifiers (e.g., VLAN ID). Finally, Leafs 204 can tie packets with their attribute EPGs based on their identifiers and enforce policies, which can be implemented and/or managed by one or more Controllers 216. Leaf 204 can classify to which EPG the traffic from a host belongs and enforce policies accordingly.


Another example SDN solution is based on VMWARE NSX. With VMWARE NSX, hosts can run a distributed firewall (DFW) which can classify and process traffic. Consider a case where three types of VMs, namely, application, database and web VMs, are put into a single layer-2 network segment. Traffic protection can be provided within the network segment based on the VM type. For example, HTTP traffic can be allowed among web VMs, and disallowed between a web VM and an application or database VM. To classify traffic and implement policies, VMWARE NSX can implement security groups, which can be used to group the specific VMs (e.g., web VMs, application VMs, database VMs). DFW rules can be configured to implement policies for the specific security groups. To illustrate, in the context of the previous example, DFW rules can be configured to block HTTP traffic between web, application, and database security groups.


Returning now to FIG. 2A, Network Environment 200 can deploy different hosts via Leafs 204, Servers 206, Hypervisors 208, VMs 210, Applications 212, and Controllers 216, such as VMWARE ESXi hosts, WINDOWS HYPER-V hosts, bare metal physical hosts, etc. Network Environment 200 may interoperate with a variety of Hypervisors 208, Servers 206 (e.g., physical and/or virtual servers), SDN orchestration platforms, etc. Network Environment 200 may implement a declarative model to allow its integration with application design and holistic network policy.


Controllers 216 can provide centralized access to fabric information, application configuration, resource configuration, application-level configuration modeling for a software-defined network (SDN) infrastructure, integration with management systems or servers, etc. Controllers 216 can form a control plane that interfaces with an application plane via northbound APIs and a data plane via southbound APIs.


As previously noted, Controllers 216 can define and manage application-level model(s) for configurations in Network Environment 200. In some cases, application or device configurations can also be managed and/or defined by other components in the network. For example, a hypervisor or virtual appliance, such as a VM or container, can run a server or management tool to manage software and services in Network Environment 200, including configurations and settings for virtual appliances.


As illustrated above, Network Environment 200 can include one or more different types of SDN solutions, hosts, etc. For the sake of clarity and explanation purposes, various examples in the disclosure will be described with reference to an ACI framework, and Controllers 216 may be interchangeably referenced as controllers, APICs, or APIC controllers. However, it should be noted that the technologies and concepts herein are not limited to ACI solutions and may be implemented in other architectures and scenarios, including other SDN solutions as well as other types of networks which may not deploy an SDN solution.


Further, as referenced herein, the term “hosts” can refer to Servers 206 (e.g., physical or logical), Hypervisors 208, VMs 210, containers (e.g., Applications 212), etc., and can run or include any type of server or application solution. Non-limiting examples of “hosts” can include virtual switches or routers, such as distributed virtual switches (DVS), application virtual switches (AVS), vector packet processing (VPP) switches; VCENTER and NSX MANAGERS; bare metal physical hosts; HYPER-V hosts; VMs; DOCKER Containers; etc.



FIG. 2B illustrates another example of Network Environment 200. In this example, Network Environment 200 includes Endpoints 222 connected to Leafs 204 in Fabric 220. Endpoints 222 can be physical and/or logical or virtual entities, such as servers, clients, VMs, hypervisors, software containers, applications, resources, network devices, workloads, etc. For example, an Endpoint 222 can be an object that represents a physical device (e.g., server, client, switch, etc.), an application (e.g., web application, database application, etc.), a logical or virtual resource (e.g., a virtual switch, a virtual service appliance, a virtualized network function (VNF), a VM, a service chain, etc.), a container running a software resource (e.g., an application, an appliance, a VNF, a service chain, etc.), storage, a workload or workload engine, etc. Endpoints 122 can have an address (e.g., an identity), a location (e.g., host, network segment, virtual routing and forwarding (VRF) instance, domain, etc.), one or more attributes (e.g., name, type, version, patch level, OS name, OS type, etc.), a tag (e.g., security tag), a profile, etc.


Endpoints 222 can be associated with respective Logical Groups 218. Logical Groups 218 can be logical entities containing endpoints (physical and/or logical or virtual) grouped together according to one or more attributes, such as endpoint type (e.g., VM type, workload type, application type, etc.), one or more requirements (e.g., policy requirements, security requirements, QoS requirements, customer requirements, resource requirements, etc.), a resource name (e.g., VM name, application name, etc.), a profile, platform or operating system (OS) characteristics (e.g., OS type or name including guest and/or host OS, etc.), an associated network or tenant, one or more policies, a tag, etc. For example, a logical group can be an object representing a collection of endpoints grouped together. To illustrate, Logical Group 1 can contain client endpoints, Logical Group 2 can contain web server endpoints, Logical Group 3 can contain application server endpoints, Logical Group N can contain database server endpoints, etc. In some examples, Logical Groups 218 are EPGs in an ACI environment and/or other logical groups (e.g., SGs) in another SDN environment.


Traffic to and/or from Endpoints 222 can be classified, processed, managed, etc., based Logical Groups 218. For example, Logical Groups 218 can be used to classify traffic to or from Endpoints 222, apply policies to traffic to or from Endpoints 222, define relationships between Endpoints 222, define roles of Endpoints 222 (e.g., whether an endpoint consumes or provides a service, etc.), apply rules to traffic to or from Endpoints 222, apply filters or access control lists (ACLs) to traffic to or from Endpoints 222, define communication paths for traffic to or from Endpoints 222, enforce requirements associated with Endpoints 222, implement security and other configurations associated with Endpoints 222, etc.


In an ACI environment, Logical Groups 218 can be EPGs used to define contracts in the ACI. Contracts can include rules specifying what and how communications between EPGs take place. For example, a contract can define what provides a service, what consumes a service, and what policy objects are related to that consumption relationship. A contract can include a policy that defines the communication path and all related elements of a communication or relationship between endpoints or EPGs. For example, a Web EPG can provide a service that a Client EPG consumes, and that consumption can be subject to a filter (ACL) and a service graph that includes one or more services, such as firewall inspection services and server load balancing.


The computing architectures shown in FIGS. 1A and 1B and the network environments shown in FIGS. 2A and 2B can be used to implement, at least in part, a data storage system, e.g. a database. A data storage system, as discussed herein, can be a distributed data storage system. A distributed data storage system can include clusters of nodes, otherwise referred to as distributed storage clusters. A distributed data storage system can be implemented as a distributed database. For example, a distributed data storage system can be implemented as a non-relational database that stores and accesses data as key-value pairs. Additionally, a distributed data storage system can be implemented across peer network data stores. For example, a distributed storage system can include peers acting as nodes within a distributed storage cluster that are connected and form the distributed storage cluster through an applicable network environment, such as the networks shown in FIGS. 2A and 2B.


In traditional databases, when a user transfers a large portion of data to be stored by the database management system, a user has to ensure that the entire portion of data is transferred and stored correctly by the database management system. In particular, cloud analytics often requires uploading of large files or amounts of data that a user has to ensure are transferred in order for analytics to subsequently process the files. In transferring large amounts of data, as a result of the large sizes of data, the data is transferred as part of a transaction. This presents problems if the database management system goes offline or the transfer of the data is otherwise interrupted. In particular, cloud-based data storage systems are more susceptible to connectivity issues leading to interrupted data transfer transactions. In traditional databases, if a transaction is interrupted, the transaction is restarted from the beginning regardless of how much of the transaction was actually completed. This is problematic because large amounts of resources, including network bandwidth, are consumed when restarting a transaction of data transfer from the beginning.


In order to provide functionalities for resuming a transaction, e.g. a bulk load transaction, portions of maintained storage logs for the transaction can be written into a persistent storage log implemented in persistent memory. The persistent storage log can be run to determine a point at which a bulk load transaction stopped. Subsequently, the bulk load transaction can be resumed based on the identified point when the transaction stopped without restarting the bulk load transaction from the beginning. This reduces an amount of resources used to complete the transaction, as the transaction does not have to be restarted from the beginning.


Additionally, in providing functionalities for resuming a transaction, log entries added to a storage log can be written to the storage log with a client tag that uniquely identifies a client associated with the transaction. The client tag can be used to filter out the log entries from the other log entries in the storage log and subsequently write the log entries into a persistent storage log based on inclusion of the client tag in the log entries. More specifically, only log entries in the storage log that include a client tag can be written into the persistent storage log, effectively limiting the number of entries written into the persistent storage log. Limiting the number of entries written into the persistent storage log is advantageous as persistent memory is expensive, thereby making complete redundancy between the storage log and the persistent storage log unfeasible.



FIG. 3 depicts a diagram of a storage environment 300 configured to provide functionalities to resume transactions without restarting the transactions. The storage environment includes a client 302, a mass storage 304, and a persistent memory 306. The client 302 can be an applicable client for providing a bulk load for storage in a data storage system. For example, the client 302 can include a user who can upload files as part of a bulk load for use in performing cloud-based analytics. A data storage system can process a bulk load transaction by receiving portions of source data from a source. The data storage system can then insert received source data into one or more destination tables. This continues until all of the source data forming the bulk load is received at the data storage system and inserted into the one or more destination tables. Subsequently, the data storage system can send a commit acknowledgement back to the client in response to inserting all of the source data into the one or more destination tables.


The mass storage 304 and the persistent memory 306 can form, at least part of, an applicable data storage system, such as the data storage systems described in this paper. The mass storage 304 can include applicable disk storage for large amounts of data. Specifically, the mass storage 304 can include one or more disk drives that use one or a combination of electronic, magnetic, optical, or mechanical mechanisms for storing data. For example, the mass storage 304 can include a hard disk drive that uses magnetic storage to store data.


The persistent memory 306 can be an applicable form of persistent and/or non-volatile memory or be implemented at an applicable persistent and/or non-volatile memory storage devices. Herein, the terms persistent and non-volatile are used interchangeably and can refer to a computer memory storage that maintains or otherwise allows access to data stored therein even after a process that created or last modified the data ends. Additionally persistent and non-volatile memory can include memory capable of withstanding a power reset while still maintaining contents stored therein. For example, persistent and non-volatile memory can include flash memory that maintains stored data even after power to the flash memory is cut-off.


The mass storage 304 includes a storage log 308. The storage log 308 can be an applicable transaction log for a data storage system. The storage log 308 can be maintained for purposes of processing transactions for storing data at the mass storage 304. More specifically, the storage log 308 can include log entries of data written to data pages in the mass storage 304 as parts of transactions. For example, the storage log 308 for a specific transaction of storing data in the mass storage 304 can include one or a combination of a log sequence number for the transaction, a previous log sequence number for the transaction, a transaction identifier for the transaction, a data type of the transaction, and information about the actual changes to the mass storage 304, e.g. storing of data as part of the transaction. The storage log 308 can be updated during the course of a transaction. More specifically, the storage log 308 can be updated as more data in a bulk load is stored in the mass storage 304 as part of the transaction.


The mass storage 304 can receive a unique identifier from the client 302. A unique identifier for a client can include applicable data for uniquely identifying the client. For example, a unique identifier can include one or a combination of a MAC address, an IP address, and a name of a client. A unique identifier received from the client 302 can be used to create a client tag for the client 302. A client tag can include a unique identifier of a client and a transaction identifier of a specific transaction. A transaction for transferring a bulk load from the client 302 to the mass storage 304 can be tagged with a client tag. By tagging a transaction with a client tag, as will be discussed in greater detail later, a point at which a transaction is interrupted can be determined based on tagging of the transaction with the client tag. This allows the transaction to be resumed from the point where the transaction is interrupted instead of restarting the transaction from the beginning, thereby decreasing amounts of resources used to carry out the transaction. This is advantageous over traditional data storage systems that typically restart transactions that are interrupted. More specifically, traditional data storage systems typically roll back transactions that are not recorded as committed or otherwise completed, thereby consuming large amounts of resources to carry out the transactions by restarting the transactions.


In tagging a transaction with a client tag for the client 302, log entries written to the storage log 308 for the transaction can be tagged with the client tag, or otherwise include a unique identifier of the client. For example, a log entry in the storage log 308 created as a result of storing a portion of a bulk load from the client 302 into the mass storage 304 can be written with or otherwise include a unique identifier, e.g. MAC address, of the client 302. As additional log entries are written to the storage log 308 for a transaction, the log entries can be tagged with a client tag for the client 302. This ensures a progress of the transaction can be determined and used in resuming the transaction.


In various embodiments, not every transaction occurring at the mass storage 304 is tagged with a client tag. More specifically, the client 302 or another client can initiate a transaction that is not tagged with a client tag. For example, if a transaction is for a small amount of data, then the transaction can be skipped or otherwise not tagged with a client tag. This limits the number of log entries in the storage log 308, thereby limiting the number of log entries, as will be discussed in greater detail later, that are written to the persistent memory 306.


The storage log 308 can be maintained through write-ahead logging. More specifically, storage logs maintained in the storage log 308 can be written ahead of when corresponding portions of data are stored as part of the transaction. For example, before a portion of a bulk load is written into mass storage 304, a log entry corresponding to writing of the portion of the bulk load into mass storage 304 can be created in the storage log 308. Further in the example, the log entry corresponding to writing of the portion of the bulk load into mass storage 304 can be written with a client identifier if the transaction is tagged with a client tag, for use in resuming the transaction from a point where it was interrupted.


The persistent memory 306 includes a persistent storage log 310. The persistent storage log 310 can include log entries for transactions that are written to the storage log 308. For example, the persistent storage log 310 can store a log entry from the storage log 308 indicating a portion of a bulk load transfer was written to the mass storage 304 as part of a transaction. Log entries stored in the persistent storage log 310 can be used to determine progress of a transaction or a point where a transaction was otherwise interrupted or stopped. More specifically, the persistent storage log 310 can be replayed to determine a point where a transaction was interrupted or stopped based on log entries in the persistent storage log 310. For example, if a last log entry indicates a specific portion of a bulk load as part of a transaction was stored in mass storage 304, then the transaction can be resumed by requesting, receiving, or fetching a next portion of the bulk load after the last portion that was written to the mass storage 304. The persistent storage log 310 can be used to determine a point where a transaction was interrupted or stopped, e.g. a progress of the transaction after either or both the data storage system goes down or fails and a network connection between the client 302 and the data storage system fails.


In being implemented in the persistent memory 306, the persistent storage log 310 can be maintained even if power to the persistent memory 306 fails. More specifically, the persistent storage log 310 can be used to resume transactions in the data storage system even when the data storage system fails, e.g. power in the data storage system fails. This provides failover in the event that the storage log 308 loses its data, e.g. as a result of a power loss in the data storage system.


The persistent storage log 310 can store log entries filtered from the storage log 308. More specifically, the persistent storage log 310 can store log entries filtered from the storage log 308 based on the log entries being tagged or otherwise including a client tag. For example, log entries for one or more transactions that include client tags can be filtered from a plurality of log entries in the storage log 308 and subsequently be written to the persistent storage log 310. As a result, every log entry is not written from the storage log 308 to the persistent storage log 310, thereby allowing the persistent storage log 310 to be maintained in the persistent memory 306 despite the high cost of persistent memory. Further, as not every log entry in the storage log 308 is written to the persistent storage log 310, the persistent storage log 310 can retain log entries for longer amounts of time. As a result, transactions that are interrupted can be resumed without restarting the transaction using the persistent storage log 310 for longer periods of time after the transactions were actually interrupted.


Log entries in the storage log 308 can be written to the persistent storage log 310 at a log switch for the storage log 308. More specifically, log entries in the storage log 308 can be filtered out from an accumulation of log entries in the storage log 308 and subsequently be written to the persistent storage log 310 at a log switch of the storage log 308. A log switch of the storage log 308 can occur when a file or page of the storage log 308 that is being written to becomes full and a new file or page of the storage log 308 is created.


Log entries maintained in the persistent storage log 310 can be tagged with an explicit abort indicator signifying that a transaction associated with the log entries was explicitly aborted by the client 302. For example, if the client 302 aborts a transaction for a bulk load, then subsequent log entries written from the storage log 308 to the persistent storage log 310 can be tagged with an indicator signifying that the transaction was explicitly aborted. Resumption of transactions using log entries stored in the persistent storage log 310 can be controlled based on whether the log entries are tagged with explicit abort indicators. More specifically, the data storage system can refrain from resuming transactions with corresponding log entries in the persistent storage log 310 tagged with explicit abort indicators. As a result, resources used in resuming or attempting to resume transactions that are explicitly aborted can be conserved.


The data storage system can receive a transaction query for a transaction from the client 302. A transaction query can include a transaction identifier, a client identifier, and/or a request for a status of the transaction at the mass storage 304. A transaction query can be received in response to a transaction not being completed at the mass storage 304. For example, a transaction query can be received in response to a failed connection between the client 302 and the data storage system while a bulk load was being transferred from the client 302 to the mass storage 304. Additionally, a transaction query can be received from the client 302 after the client is disconnected from the data storage system and subsequently reconnects to the data storage system.


In response to a transaction query, the data storage system can provide an indication of a progress of a transaction back to the client 302. A progress of a transaction provided in response to a transaction query can be used to resume the transaction from a point where the transaction was interrupted without restarting the entire transaction. For example, a transaction progress can indicate that a first 30% of a bulk load was stored at the mass storage 304 and the client 302 can subsequently resume the transaction by beginning transfer of the remaining 70% of the bulk load to the mass storage 304.


In various embodiments, progress of a transaction is provided back to the client 302 as an offset integer indicating a stopping point of the transaction. The client 302 can use the offset integer to position a start of an input stream for a transaction. Subsequently, the client 302 can start the input stream for the transactions, e.g. the transfer of bulk data, at the starting point set using the offset integer, effectively resuming the transaction at a point where it stopped or was otherwise interrupted.



FIG. 4 depicts a diagram of an example log entry specific transaction management system 400. The log entry specific transaction management system 400 shown in FIG. 4 can be configured to manage processing of transactions based on log entries for the transactions. More specifically, the log entry specific transaction management system 400 can control or facilitate resuming of transactions using log entries stored in persistent memory. For example, the log entry specific transaction management system 400 can identify a point in a transaction for a bulk load transfer where the transaction failed, which can subsequently be used to resume the bulk load transfer without starting over the transaction.


The log entry specific transaction management system 400 can be implemented at either or both an applicable data storage system, such as the data storage systems described herein, and an applicable client, such as the clients described herein. In being implemented at a data storage system, the log entry specific transaction management system 400 can maintain a persistent storage log implemented in persistent memory at the data storage system. Further, in being implemented at a data storage system, the log entry specific transaction management system 400 can use a persistent storage log of the data storage system to determine a progress of a transaction at the data storage system. In being implemented at a client, the log entry specific transaction management system 400 can control resuming of a transaction at the client. For example, the log entry specific transaction management system 400 can use an identified progress of a transaction for a bulk load transfer to resume the transaction by continuing to send portions of the bulk load that were not transferred previously, as indicated by the progress of the transaction.


The log entry specific transaction management system 400 includes a storage log writer 402, a persistent storage log entry writer 404, and a transaction resumption engine 406. The storage log writer 402 functions to write storage log entries for an applicable storage log in a data storage system, such as the storage log 308. The storage log writer 402 can write storage logs based on transactions occurring in an applicable mass storage, such as the mass storage 304. For example, the storage log writer 402 can write storage log entries as portions of data as part of a transaction are stored in mass storage. In another example, the storage log writer 402 can write storage log entries before portions of data are actually stored in mass storage.


The storage log writer 402 can tag transactions with client tags. In tagging transactions with client tags, the storage log writer 402 can write storage logs including client tags for transactions. For example, the storage log writer 402 can write a storage log entry including a transaction identifier and a client identifier as part of a client tag to a storage log. Further in the example, the log entry can correspond to storage of a portion of a bulk load in mass storage as part of a transaction with the client.


The storage log writer 402 can selectively tag transactions with client tags. More specifically, the storage log writer 402 can select transactions to tag with client tags and subsequently tag the transactions and refrain from tagging other transactions with client tags. As a result of selectively tagging transactions with client tags, transactions tagged with client tags can be resumed based on tagging the transactions with the client tags, in the event that the transactions are interrupted. Further, as a result of selectively tagging transactions with client tags, transactions that are not tagged with client tags can be restarted from the beginning in the event that the transactions are interrupted or otherwise stopped.


The storage log writer 402 can selectively tag transactions based on data type. More specifically, the storage log writer 402 can tag transactions based on a type of data transferred from a client to a data storage system as part of the transactions. For example, the storage log writer 402 can tag transactions that include transfers of media file, e.g. video files, and refrain from tagging transactions that are only documents.


Further, the storage log writer 402 can selectively tag transactions based on data size. More specifically, the storage log writer 402 can tag transactions based on a size of data transferred from a client to a data storage system as part of the transactions. For example, the storage log writer 402 can tag transactions for transfer of bulk loads and refrain from tagging transactions for transfer of small loads. Further in the example, the storage log writer 402 can tag transactions for transferring an amount of data that is greater than a threshold amount of data, e.g. a configurable or user-specified threshold amount of data.


The storage log writer 402 can selectively tag transactions based on an identification of a client. More specifically, the storage log writer 402 can tag transactions that are sent from a specific client who has gained access to a right to resume transactions without having to restart the transaction from the beginning. For example, a customer can pay for a right to restart transactions based on client tags and subsequently, transactions for the customer at a data storage system can be tagged with client tags to allow the customer to resume the transactions if they are interrupted.


Further, the storage log writer 402 can selectively tag transactions based on one or a combination of applications associated with a transaction, a source of data included in a transaction, an amount of time it would take to restart a transaction from the beginning when compared to an amount of time to resume the transaction, and an amount of resources that would be consumed to restart a transaction from the beginning when compared to an amount of resources that would be consumed to resume the transaction. For example, if a transaction has just begun when it is interrupted, then the storage log writer 402 can determine to just restart the transaction from the beginning, and subsequently refrain from tagging the transaction.


The persistent storage log entry writer 404 functions to maintain an applicable persistent storage log implemented in persistent memory, such as the persistent storage log 310. In maintaining a persistent storage log, the persistent storage log entry writer 404 can write log entries into a persistent storage log. The persistent storage log entry writer 404 can write log entries and client tags from a storage log for mass storage into a persistent storage log. For example, the persistent storage log entry writer 404 can write a storage log entry corresponding to a portion of a bulk load written to mass storage as part of a transaction along with a client identifier and a transaction identifier of the transaction into a persistent storage log.


Further, the persistent storage log entry writer 404 can filter storage log entries in a storage log. More specifically, the persistent storage log entry writer 404 can filter storage log entries in a storage log for purposes of selectively writing the storage log entries into a persistent storage log. For example, the persistent storage log entry writer 404 can filter log entries for a specific transaction or a specific client from a plurality of log entries in a storage log. Further in the example, the persistent storage log entry writer 404 can write the log entries into a persistent storage log and refrain from writing other log entries of the plurality of log entries into the persistent storage log, e.g. as part of filtering the log entries.


The persistent storage log entry writer 404 can selectively write log entries from a storage log into a persistent storage log based on client tags. In writing log entries to a persistent storage log based on client tags, the persistent storage log entry writer 404 can write log entries into the persistent storage based on whether associated transactions are tagged with client tags, e.g. as part of filtering the log entries. For example, the persistent storage log entry writer 404 can write log entries that include client tags into a persistent storage log and refrain from writing log entries that lack client tags. Log entries with client tags that are written to a persistent storage log entry writer 404 can subsequently be used to resume transactions if the transactions are interrupted or otherwise stopped.


The persistent storage log entry writer 404 can write log entries from a storage log into a persistent storage log at configurable periodicity. For example, the persistent storage log entry writer 404 can write log entries from a storage log into a persistent storage log every ten minutes. Additionally, the persistent storage log entry writer 404 can write log entries from a storage log into a persistent storage log at a log switch. For example, the persistent storage log entry writer 404 can write log entries from a storage log when a page in the storage log becomes full.


Either or both the storage log writer 402 and the persistent storage log entry writer 404 can mark transactions as explicitly aborted. In marking a transaction as explicitly aborted, either or both the storage log writer 402 and the persistent storage log entry writer 404 can add an explicit abort indicator to log entries associated with the transaction. For example, if a client explicitly aborts a transaction, then the persistent storage log entry writer 404 can add explicit abort indicators to log entries associated with the transaction as the log entries are written from a storage log to a persistent storage log. In another example, the storage log writer 402 can write explicit abort indicators to log entries associated with an aborted transaction, and the persistent storage log entry writer 404 can subsequently write the log entries with the indicators from a storage log into a persistent storage log.


The transaction resumption engine 406 functions to control resuming of a transaction or facilitate resuming of the transaction without having to restart the transaction. In controlling resuming of a transaction, the transaction resumption engine 406 can determine a point where a transaction was interrupted and subsequently resume or provide functionalities for resuming the transaction from the point where it was interrupted. For example, the transaction resumption engine 406 can generate an offset integer indicating a point where a transaction was interrupted which can subsequently be used, e.g. by a portion of the transaction resumption engine 406 implemented at a client, to resume the transaction. Further in the example, the offset integer can be used to resume a data stream of a bulk load transfer at the point where the transaction was interrupted.


The transaction resumption engine 406 can identify progress of a transaction, otherwise a point where a transaction was interrupted, based on log entries in a persistent storage log. Specifically, the transaction resumption engine 406 can use log entries for a transaction to determine a last portion of data stored in mass storage as part of the transaction, which can subsequently be used to resume the transaction. The transaction resumption engine 406 can use an identification of a transaction and an identification of a client to determine a progress of the transaction for the client. For example, the transaction resumption engine 406 can use an identification of a client and an identification of a transaction to run through log entries in a persistent storage log to identify a last log entry of the transaction for the client, corresponding to a progress of the transaction for the client.


Additionally, the transaction resumption engine 406 can identify progress of a transaction based on a received transaction query for the transaction. Specifically, the transaction resumption engine 406 can receive a transaction query from a client including an identifier of a transaction and an identifier of the client. Subsequently, the transaction resumption engine 406 can use the identifiers of the transaction and the client to run through log entries in a persistent storage log to identify a progress of the transaction. The transaction resumption engine 406 can then provide the progress of the transaction back to the client, where the client can use the progress to resume transferring of data to a data storage system as part of the transaction.


The transaction resumption engine 406 can identify whether a transaction is explicitly aborted. More explicitly, the transaction resumption engine 406 can identify whether a transaction is explicitly aborted based on whether explicit abort indicators are included as part of log entries for the transaction in either or both a storage log and a persistent storage log. The transaction resumption engine 406 can control of provide functionalities for controlling a transaction based on whether the transaction is explicitly aborted, as identified by the transaction resumption engine 406. Specifically, the transaction resumption engine 406 can refrain from resuming a transaction that has been explicitly aborted by a client. As a result, resources are conserved as the resources are not used to resume a transaction that was actually aborted.



FIG. 5 illustrates a flowchart for an example method of maintaining a persistent storage log for use in resuming transactions with a data storage system. The method shown in FIG. 5 is provided by way of example, as there are a variety of ways to carry out the method. Additionally, while the example method is illustrated with a particular order of steps, those of ordinary skill in the art will appreciate that FIG. 5 and the modules shown therein can be executed in any order and can include fewer or more modules than illustrated.


Each module shown in FIG. 5 represents one or more steps, processes, methods or routines in the method. For the sake of clarity and explanation purposes, the modules in FIG. 5 are described with reference to the storage environment 300 shown in FIG. 3 and the log entry specific transaction management system 400 shown in FIG. 4.


At step 500, a data storage system receives, from a client, a first portion of a data load as part of a transaction and a client identifier that uniquely identifies the client. A first portion of a data load can be part of a bulk load that is uploaded to a data storage system. For example, a first portion of a data load can include bulk data used in performing cloud-based analytics. A received client identifier can be an applicable identifier for uniquely identifying a client and subsequently be used to form a client tag for the client. For example, a received client identifier can include a MAC address of a client which can subsequently be used to form a client tag that is unique for the client.


At step 502, the storage log writer 402 tags the transaction with a client tag including the client identifier. The transaction can be tagged with a client tag after it is determined to actually tag the transaction with the client tag for the client. Specifically, it can be determined to tag the transaction with a client tag based on a data type of the data load being transferred as part of the transaction. Alternatively, it can be determined to tag the transaction with a client tag based on data size of the data load being transferred as part of the transaction. Further, it can be determined to tag the transaction based on an identification or access rights of the client who initiated the transaction.


At step 504, the data storage system stores the first portion of the data load in storage. The data storage system can store the first portion of the data load in mass storage implemented at the data storage system. More specifically, the data storage system can store the first portion of the data load received from the client in disk storage forming mass storage.


At step 506, the storage log writer 402 writes a first log entry including the client tag to a data storage log in response to storing of the first portion of the data load in the storage. In alternative embodiments, a first log entry including the client tag can be written to a data storage log before the first portion of the data load is stored in the storage, e.g. as part of write-ahead logging. The storage log writer 402 can write a first log entry with the client tag in response to the transaction begin tagged with the client tag.


At step 508, the persistent storage log entry writer 404 writes the first log entry from the data storage log to a persistent storage log stored in persistent memory. Subsequently the transaction resumption engine 406 can use the first log entry stored in the persistent storage log to track progress of storing the data load in the storage. The persistent storage log entry writer 404 can write the first log entry from the data storage log to a persistent storage log in response to either or both the transaction being tagged with the client tag and the first log entry including the client tag, e.g. as part of filtering a plurality of log entries in the data storage log. A progress of storing the data load in the storage, as determined from the first log entry stored in the persistent memory, can be used to resume the transaction without starting the transaction over in the event that the transaction is interrupted.



FIG. 6 illustrates a flowchart for an example method of resuming a transaction for a transfer of a data load to a data storage system using a persistent storage log implemented in persistent memory. The method shown in FIG. 6 is provided by way of example, as there are a variety of ways to carry out the method. Additionally, while the example method is illustrated with a particular order of steps, those of ordinary skill in the art will appreciate that FIG. 6 and the modules shown therein can be executed in any order and can include fewer or more modules than illustrated.


Each module shown in FIG. 6 represents one or more steps, processes, methods or routines in the method. For the sake of clarity and explanation purposes, the modules in FIG. 6 are described with reference to the storage environment 300 shown in FIG. 3 and the log entry specific transaction management system 400 shown in FIG. 4.


At step 600, the storage log writer 402 writes, to a data storage log, a first log entry including a client tag corresponding to storing of a first portion of a data load received from a client as part of a transaction. A first log entry can be stored along with a client tag as part of a transaction being tagged with the client tag. For example, if a transaction for a client is tagged with a client tag, then a first log entry, generated as part of the transaction, can be tagged with the client tag.


At step 602, the persistent storage log entry writer 404 writes the first log entry from the data storage log to a persistent storage log implemented in persistent memory. The first log entry can be written from the data storage log to a persistent storage log based on the first log entry including the client tag. More specifically, the first log entry can be filtered, based on including of the client tag with the first log entry, from a plurality of log entries in the data storage log. Subsequently, after being filtered from the plurality of log entries in the data storage log, the first log entry can be stored in the persistent storage log.


At step 604, the transaction resumption engine 406 runs the persistent storage log including the first log entry with the client tag to track a progress of the transaction. The persistent storage log can be used to track a progress of the transaction in response to a transaction query for the transaction received from the client. For example, the transaction can be interrupted due to a failed connection between the client and the data storage system, and the client can subsequently provide a transaction query for the transaction after the client reconnects to the data storage system. Further in the example, the transaction query received from the client can include an identification of the transaction and the client that are both used to track a progress of the transaction by running the persistent storage log.


At step 606, the transaction resumption engine 406 resumes the transaction of transferring the data load based on the identified progress of the transaction. In particular, the transaction resumption engine 406 can begin transferring data within the data load from a point where the transaction was interrupted in order to complete the transaction without restarting the transaction. As a result, resources are conserved as the transaction does not have to restart from the beginning.


The disclosure now turns to FIGS. 7 and 8, which illustrate example network devices and computing devices, such as switches, routers, load balancers, client devices, and so forth.



FIG. 7 illustrates a computing system architecture 700 wherein the components of the system are in electrical communication with each other using a connection 705, such as a bus. Exemplary system 700 includes a processing unit (CPU or processor) 710 and a system connection 705 that couples various system components including the system memory 715, such as read only memory (ROM) 720 and random access memory (RAM) 725, to the processor 710. The system 700 can include a cache of high-speed memory connected directly with, in close proximity to, or integrated as part of the processor 710. The system 700 can copy data from the memory 715 and/or the storage device 730 to the cache 712 for quick access by the processor 710. In this way, the cache can provide a performance boost that avoids processor 710 delays while waiting for data. These and other modules can control or be configured to control the processor 710 to perform various actions. Other system memory 715 may be available for use as well. The memory 715 can include multiple different types of memory with different performance characteristics. The processor 710 can include any general purpose processor and a hardware or software service, such as service 1 732, service 2 734, and service 3 736 stored in storage device 730, configured to control the processor 710 as well as a special-purpose processor where software instructions are incorporated into the actual processor design. The processor 710 may be a completely self-contained computing system, containing multiple cores or processors, a bus, memory controller, cache, etc. A multi-core processor may be symmetric or asymmetric.


To enable user interaction with the computing device 700, an input device 745 can represent any number of input mechanisms, such as a microphone for speech, a touch-sensitive screen for gesture or graphical input, keyboard, mouse, motion input, speech and so forth. An output device 735 can also be one or more of a number of output mechanisms known to those of skill in the art. In some instances, multimodal systems can enable a user to provide multiple types of input to communicate with the computing device 700. The communications interface 740 can generally govern and manage the user input and system output. There is no restriction on operating on any particular hardware arrangement and therefore the basic features here may easily be substituted for improved hardware or firmware arrangements as they are developed.


Storage device 730 is a non-volatile memory and can be a hard disk or other types of computer readable media which can store data that are accessible by a computer, such as magnetic cassettes, flash memory cards, solid state memory devices, digital versatile disks, cartridges, random access memories (RAMs) 725, read only memory (ROM) 720, and hybrids thereof.


The storage device 730 can include services 732, 734, 736 for controlling the processor 710. Other hardware or software modules are contemplated. The storage device 730 can be connected to the system connection 705. In one aspect, a hardware module that performs a particular function can include the software component stored in a computer-readable medium in connection with the necessary hardware components, such as the processor 710, connection 705, output device 735, and so forth, to carry out the function.



FIG. 8 illustrates an example network device 800 suitable for performing switching, routing, load balancing, and other networking operations. Network device 800 includes a central processing unit (CPU) 804, interfaces 802, and a bus 810 (e.g., a PCI bus). When acting under the control of appropriate software or firmware, the CPU 804 is responsible for executing packet management, error detection, and/or routing functions. The CPU 804 preferably accomplishes all these functions under the control of software including an operating system and any appropriate applications software. CPU 804 may include one or more processors 808, such as a processor from the INTEL X86 family of microprocessors. In some cases, processor 808 can be specially designed hardware for controlling the operations of network device 800. In some cases, a memory 806 (e.g., non-volatile RAM, ROM, etc.) also forms part of CPU 804. However, there are many different ways in which memory could be coupled to the system.


The interfaces 802 are typically provided as modular interface cards (sometimes referred to as “line cards”). Generally, they control the sending and receiving of data packets over the network and sometimes support other peripherals used with the network device 800. Among the interfaces that may be provided are Ethernet interfaces, frame relay interfaces, cable interfaces, DSL interfaces, token ring interfaces, and the like. In addition, various very high-speed interfaces may be provided such as fast token ring interfaces, wireless interfaces, Ethernet interfaces, Gigabit Ethernet interfaces, ATM interfaces, HSSI interfaces, POS interfaces, FDDI interfaces, WIFI interfaces, 3G/4G/5G cellular interfaces, CAN BUS, LoRA, and the like. Generally, these interfaces may include ports appropriate for communication with the appropriate media. In some cases, they may also include an independent processor and, in some instances, volatile RAM. The independent processors may control such communications intensive tasks as packet switching, media control, signal processing, crypto processing, and management. By providing separate processors for the communications intensive tasks, these interfaces allow the master microprocessor 804 to efficiently perform routing computations, network diagnostics, security functions, etc.


Although the system shown in FIG. 8 is one specific network device of the present invention, it is by no means the only network device architecture on which the present invention can be implemented. For example, an architecture having a single processor that handles communications as well as routing computations, etc., is often used. Further, other types of interfaces and media could also be used with the network device 800.


Regardless of the network device's configuration, it may employ one or more memories or memory modules (including memory 806) configured to store program instructions for the general-purpose network operations and mechanisms for roaming, route optimization and routing functions described herein. The program instructions may control the operation of an operating system and/or one or more applications, for example. The memory or memories may also be configured to store tables such as mobility binding, registration, and association tables, etc. Memory 806 could also hold various software containers and virtualized execution environments and data.


The network device 800 can also include an application-specific integrated circuit (ASIC), which can be configured to perform routing and/or switching operations. The ASIC can communicate with other components in the network device 800 via the bus 810, to exchange data and signals and coordinate various types of operations by the network device 800, such as routing, switching, and/or data storage operations, for example.


For clarity of explanation, in some instances the present technology may be presented as including individual functional blocks including functional blocks comprising devices, device components, steps or routines in a method embodied in software, or combinations of hardware and software.


In some embodiments the computer-readable storage devices, mediums, and memories can include a cable or wireless signal containing a bit stream and the like. However, when mentioned, non-transitory computer-readable storage media expressly exclude media such as energy, carrier signals, electromagnetic waves, and signals per se.


Methods according to the above-described examples can be implemented using computer-executable instructions that are stored or otherwise available from computer readable media. Such instructions can comprise, for example, instructions and data which cause or otherwise configure a general purpose computer, special purpose computer, or special purpose processing device to perform a certain function or group of functions. Portions of computer resources used can be accessible over a network. The computer executable instructions may be, for example, binaries, intermediate format instructions such as assembly language, firmware, or source code. Examples of computer-readable media that may be used to store instructions, information used, and/or information created during methods according to described examples include magnetic or optical disks, flash memory, USB devices provided with non-volatile memory, networked storage devices, and so on.


Devices implementing methods according to these disclosures can comprise hardware, firmware and/or software, and can take any of a variety of form factors. Typical examples of such form factors include laptops, smart phones, small form factor personal computers, personal digital assistants, rackmount devices, standalone devices, and so on. Functionality described herein also can be embodied in peripherals or add-in cards. Such functionality can also be implemented on a circuit board among different chips or different processes executing in a single device, by way of further example.


The instructions, media for conveying such instructions, computing resources for executing them, and other structures for supporting such computing resources are means for providing the functions described in these disclosures.


Although a variety of examples and other information was used to explain aspects within the scope of the appended claims, no limitation of the claims should be implied based on particular features or arrangements in such examples, as one of ordinary skill would be able to use these examples to derive a wide variety of implementations. Further and although some subject matter may have been described in language specific to examples of structural features and/or method steps, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to these described features or acts. For example, such functionality can be distributed differently or performed in components other than those identified herein. Rather, the described features and steps are disclosed as examples of components of systems and methods within the scope of the appended claims.


Claim language reciting “at least one of” refers to at least one of a set and indicates that one member of the set or multiple members of the set satisfy the claim. For example, claim language reciting “at least one of A and B” means A, B, or A and B.

Claims
  • 1. A computer-implemented method comprising: receiving, from a client at a data storage system, a first portion of a data load as part of a transaction and a client identifier that uniquely identifies the client;tagging the transaction with a client tag including the client identifier based on both a size of the transaction and access rights of the client in resuming transactions through the data storage system;storing the first portion of the data load in storage at the data storage system;adding, to a data storage log, a first log entry including the client tag in response to storing the first portion of the data load in the storage at the data storage system; andselectively writing the first log entry from the data storage log to a persistent storage log separate from the data storage log and stored in persistent memory according to both the size of the transaction and whether the client has the access rights based on an inclusion of the client tag in the first log entry while refraining from writing additional log entries from the data storage log to the persistent storage log based on an inclusion of one or more other client tags with the additional log entries, the first log entry stored in the persistent storage log used to track progress of storing the data load in the storage at the data storage system.
  • 2. The method of claim 1, wherein the first log entry is written from the data storage log to the persistent storage log at a log switch of the data storage log.
  • 3. The method of claim 1, wherein the first log entry is written from the data storage log to the persistent storage log at a log switch of the data storage log and the log switch is a time at which a page including the first log entry in the data storage log is full.
  • 4. The method of claim 1, further comprising: filtering, from a plurality of entries in the data storage log, a first subset of entries associated with transactions that are tagged with client tags, the first subset of entries including the first log entry including the client tag; andwriting the first subset of entries associated with the transactions that are tagged with client tags into the persistent storage log.
  • 5. The method of claim 1, further comprising: filtering, from a plurality of entries in the data storage log, a first subset of entries associated with transactions that are tagged with client tags, the first subset of entries including the first log entry including the client tag; andwriting the first subset of entries associated with the transactions that are tagged with the client tags into the persistent storage log, wherein the first subset of entries stored in the persistent storage log are used to track progresses of the transactions in storing data in the data storage system.
  • 6. The method of claim 1, further comprising: receiving, from the client at the data storage system, a second portion of the data load as part of the transaction;storing the second portion of the data load in the storage at the data storage system; andadding, to the data storage log, a second log entry including the client tag in response to storing the second portion of the data load in the storage at the data storage system.
  • 7. The method of claim 1, further comprising: receiving, from the client at the data storage system, a second portion of the data load as part of the transaction;storing the second portion of the data load in the storage at the data storage system;adding, to the data storage log, a second log entry including the client tag in response to storing the second portion of the data load in the storage at the data storage system; andwriting the second log entry from the data storage log to the persistent storage log stored in persistent memory, the second log entry used in combination with the first log entry to track the progress of storing the data load in the storage at the data storage system.
  • 8. The method of claim 7, wherein the first log entry and the second log entry are written from the data storage log to the persistent storage log stored in persistent memory at a same log switch of the data storage log.
  • 9. The method of claim 1, further comprising determining whether to tag the transaction with the client tag based on a data type of the data load.
  • 10. The method of claim 1, further comprising: determining if the transaction is aborted by the client; andrefraining from resuming the transaction based on the progress of storing the data load in the storage at the data storage system, as determined using the first log entry in the persistent storage log, if it is determined the transaction is aborted by the client.
  • 11. The method of claim 1, further comprising using the first log entry in the persistent storage log to resume the transaction according to the progress of storing the data load in the storage at the data storage system.
  • 12. The method of claim 1, further comprising: receiving a query from the client regarding a progress of the transaction in response to a failure to complete the transaction; andusing the query and the first log entry in the persistent storage log to complete the transaction in response to the query from the client.
  • 13. The method of claim 12, further comprising using additional portions of the data load sent by the client in response to the progress of the transaction identified from the progress of storing the data load in the storage at the data storage system to complete the transaction.
  • 14. The method of claim 1, further comprising: comparing the size of the transaction to a threshold transaction size for selectively controlling writing of transaction log entries associated with a plurality of transactions from the data storage log to the persistent storage log based on corresponding sizes of the plurality of transactions; andtagging the transaction with the client tag based on a comparison of the size of the transaction to the threshold transaction size.
  • 15. A computer-implemented system comprising: one or more hardware processors; andat least one computer-readable storage medium having stored therein instructions which, when executed by the one or more processors, cause the one or more processors to perform operations comprising:receiving, from a client at a data storage system, a first portion of a data load as part of a transaction and a client identifier that uniquely identifies the client;tagging the transaction with a client tag including the client identifier based on both a size of the transaction and access rights of the client in resuming transactions through the data storage system;adding, to a data storage log, a first log entry including the client tag indicating the first portion of the data load is stored in storage at the data storage system as part of write-ahead logging;storing the first portion of the data load in the storage at the data storage system; andselectively writing the first log entry from the data storage log to a persistent storage log separate from the data storage log and stored in persistent memory according to both the size of the transaction and whether the client has the access rights based on an inclusion of the client tag in the first log entry while refraining from writing additional log entries from the data storage log to the persistent storage log based on an inclusion of one or more other client tags with the additional log entries, the first log entry stored in the persistent storage log used to track progress of storing the data load in the storage at the data storage system.
  • 16. The system of claim 15, wherein the instructions which, when executed by the one or more processors, further cause the one or more processors to perform operations comprising: filtering, from a plurality of entries in the data storage log, a first subset of entries associated with transactions that are tagged with client tags, the first subset of entries including the first log entry including the client tag; andwriting the first subset of entries associated with the transactions that are tagged with client tags into the persistent storage log.
  • 17. The system of claim 15, wherein the instructions which, when executed by the one or more processors, further cause the one or more processors to perform operations comprising: receiving, from the client at the data storage system, a second portion of the data load as part of the transaction;storing the second portion of the data load in the storage at the data storage system; andadding, to the data storage log, a second log entry including the client tag in response to storing the second portion of the data load in the storage at the data storage system.
  • 18. The system of claim 15, wherein it is determined whether to tag the transaction with the client tag based on a data type of the data load.
  • 19. The system of claim 15, wherein the instructions which, when executed by the one or more processors, further cause the one or more processors to perform operations comprising: comparing the size of the transaction to a threshold transaction size for selectively controlling writing of transaction log entries associated with a plurality of transactions from the data storage log to the persistent storage log based on corresponding sizes of the plurality of transactions; andtagging the transaction with the client tag based on a comparison of the size of the transaction to the threshold transaction size.
  • 20. A non-transitory computer-readable storage medium having stored therein instructions which, when executed by a processor, cause the processor to perform operations comprising: receiving, from a client at a data storage system, a first portion of a data load as part of a transaction and a client identifier that uniquely identifies the client;tagging the transaction with a client tag including the client identifier based on both a size of the transaction and access rights of the client in resuming transactions through the data storage system;storing the first portion of the data load in storage at the data storage system;adding, to a data storage log, a first log entry including the client tag in response to storing the first portion of the data load in the storage at the data storage system; andselectively writing the first log entry from the data storage log to a persistent storage log separate from the data storage log and stored in persistent memory according to both the size of the transaction and whether the client has the access rights based on an inclusion of the client tag in the first log entry while refraining from writing additional log entries from the data storage log to the persistent storage log based on an inclusion of one or more other client tags with the additional log entries, the first log entry stored in the persistent storage log used to track progress of storing the data load in the storage at the data storage system and the progress of storing the data load in the storage at the data storage system used to resume transfer of the data load from the client.
US Referenced Citations (404)
Number Name Date Kind
5812773 Norin Sep 1998 A
5889896 Meshinsky et al. Mar 1999 A
6067541 Raju May 2000 A
6108782 Fletcher et al. Aug 2000 A
6178453 Mattaway et al. Jan 2001 B1
6185615 Labiaga Feb 2001 B1
6298153 Oishi Oct 2001 B1
6343290 Cossins et al. Jan 2002 B1
6643260 Kloth et al. Nov 2003 B1
6683873 Kwok et al. Jan 2004 B1
6721804 Rubin et al. Apr 2004 B1
6732124 Koseki May 2004 B1
6733449 Krishnamurthy et al. May 2004 B1
6735631 Oehrke et al. May 2004 B1
6971096 Ankireddipally Nov 2005 B1
6996615 McGuire Feb 2006 B1
7054930 Cheriton May 2006 B1
7058706 Lyer et al. Jun 2006 B1
7062571 Dale et al. Jun 2006 B1
7111177 Chauvel et al. Sep 2006 B1
7212490 Kao et al. May 2007 B1
7277948 Igarashi et al. Oct 2007 B2
7313667 Pullela et al. Dec 2007 B1
7379846 Williams et al. May 2008 B1
7480672 Hahn et al. Jan 2009 B2
7496043 Leong et al. Feb 2009 B1
7536476 Alleyne May 2009 B1
7546354 Fan Jun 2009 B1
7567504 Darling et al. Jul 2009 B2
7606147 Luft et al. Oct 2009 B2
7647594 Togawa Jan 2010 B2
7773510 Back et al. Aug 2010 B2
7808897 Mehta et al. Oct 2010 B1
7881957 Cohen et al. Feb 2011 B1
7885923 Tawri Feb 2011 B1
7917647 Cooper et al. Mar 2011 B2
8010598 Tanimoto Aug 2011 B2
8028071 Mahalingam et al. Sep 2011 B1
8041714 Aymeloglu et al. Oct 2011 B2
8121117 Amdahl et al. Feb 2012 B1
8150805 Tawri Apr 2012 B1
8171415 Appleyard et al. May 2012 B2
8234377 Cohn Jul 2012 B2
8244559 Horvitz et al. Aug 2012 B2
8250215 Stienhans et al. Aug 2012 B2
8280880 Aymeloglu et al. Oct 2012 B1
8284664 Aybay et al. Oct 2012 B1
8301746 Head et al. Oct 2012 B2
8345692 Smith Jan 2013 B2
8406141 Couturier et al. Mar 2013 B1
8407413 Yucel et al. Mar 2013 B1
8448171 Donnellan et al. May 2013 B2
8477610 Zuo et al. Jul 2013 B2
8495356 Ashok et al. Jul 2013 B2
8510469 Portolani Aug 2013 B2
8514868 Hill Aug 2013 B2
8532108 Li et al. Sep 2013 B2
8533687 Greifeneder et al. Sep 2013 B1
8547974 Guruswamy et al. Oct 2013 B1
8560639 Murphy et al. Oct 2013 B2
8560663 Baucke et al. Oct 2013 B2
8589543 Dutta et al. Nov 2013 B2
8590050 Nagpal et al. Nov 2013 B2
8611356 Yu et al. Dec 2013 B2
8612625 Andreis et al. Dec 2013 B2
8630291 Shaffer et al. Jan 2014 B2
8639787 Lagergren et al. Jan 2014 B2
8656024 Krishnan et al. Feb 2014 B2
8660129 Brendel et al. Feb 2014 B1
8719804 Jain May 2014 B2
8775576 Hebert et al. Jul 2014 B2
8797867 Chen et al. Aug 2014 B1
8805951 Faibish et al. Aug 2014 B1
8850182 Fritz et al. Sep 2014 B1
8856339 Mestery et al. Oct 2014 B2
8909928 Ahmad et al. Dec 2014 B2
8918510 Gmach et al. Dec 2014 B2
8924720 Raghuram et al. Dec 2014 B2
8930747 Levijarvi et al. Jan 2015 B2
8938775 Roth et al. Jan 2015 B1
8959526 Kansal et al. Feb 2015 B2
8977754 Curry, Jr. et al. Mar 2015 B2
9009697 Breiter et al. Apr 2015 B2
9015324 Jackson Apr 2015 B2
9043439 Bicket et al. May 2015 B2
9049115 Rajendran et al. Jun 2015 B2
9063789 Beaty et al. Jun 2015 B2
9065727 Liu et al. Jun 2015 B1
9075649 Bushman et al. Jul 2015 B1
9164795 Vincent Oct 2015 B1
9167050 Durazzo et al. Oct 2015 B2
9201701 Boldyrev et al. Dec 2015 B2
9201704 Chang et al. Dec 2015 B2
9203784 Chang et al. Dec 2015 B2
9223634 Chang et al. Dec 2015 B2
9244776 Koza et al. Jan 2016 B2
9251114 Ancin et al. Feb 2016 B1
9264478 Hon et al. Feb 2016 B2
9313048 Chang et al. Apr 2016 B2
9361192 Smith et al. Jun 2016 B2
9380075 He et al. Jun 2016 B2
9419841 Kozolchyk Aug 2016 B1
9432294 Sharma et al. Aug 2016 B1
9444744 Sharma et al. Sep 2016 B1
9473365 Melander et al. Oct 2016 B2
9503530 Niedzielski Nov 2016 B1
9558078 Farlee et al. Jan 2017 B2
9558232 Taylor Jan 2017 B1
9613078 Vermeulen Apr 2017 B2
9628471 Sundaram et al. Apr 2017 B1
9658876 Chang et al. May 2017 B2
9692802 Bicket et al. Jun 2017 B2
9755858 Bagepalli et al. Sep 2017 B2
9842053 Joshi Dec 2017 B2
10025946 Holenstein Jul 2018 B1
20020073337 Ioele et al. Jun 2002 A1
20020143928 Maltz et al. Oct 2002 A1
20020166117 Abrams et al. Nov 2002 A1
20020174216 Shorey et al. Nov 2002 A1
20020188617 Smith Dec 2002 A1
20030018591 Komisky Jan 2003 A1
20030056001 Mate et al. Mar 2003 A1
20030159006 Frank Aug 2003 A1
20030228585 Inoko et al. Dec 2003 A1
20040004941 Malan et al. Jan 2004 A1
20040095237 Chen et al. May 2004 A1
20040131059 Ayyakad et al. Jul 2004 A1
20040264481 Darling et al. Dec 2004 A1
20050060418 Sorokopud Mar 2005 A1
20050065987 Telkowski Mar 2005 A1
20050125424 Herriott et al. Jun 2005 A1
20050138461 Allen Jun 2005 A1
20060104286 Cheriton May 2006 A1
20060126665 Ward et al. Jun 2006 A1
20060146825 Hofstaedter et al. Jul 2006 A1
20060155875 Cheriton Jul 2006 A1
20060168338 Bruegl et al. Jul 2006 A1
20070174663 Crawford et al. Jul 2007 A1
20070223487 Kajekar et al. Sep 2007 A1
20070242830 Conrado et al. Oct 2007 A1
20080005293 Bhargava et al. Jan 2008 A1
20080084880 Dharwadkar Apr 2008 A1
20080165778 Ertemalp Jul 2008 A1
20080172409 Botros Jul 2008 A1
20080198752 Fan et al. Aug 2008 A1
20080201711 Amir Husain Aug 2008 A1
20080222159 Aranha Sep 2008 A1
20080235755 Blaisdell et al. Sep 2008 A1
20080307255 Chen Dec 2008 A1
20090006527 Gingell, Jr. et al. Jan 2009 A1
20090019367 Cavagnari et al. Jan 2009 A1
20090024660 Borgsmidt Jan 2009 A1
20090031312 Mausolf et al. Jan 2009 A1
20090083183 Rao et al. Mar 2009 A1
20090138763 Arnold May 2009 A1
20090177775 Radia et al. Jul 2009 A1
20090178058 Stillwell, III et al. Jul 2009 A1
20090182874 Morford et al. Jul 2009 A1
20090265468 Annambhotla et al. Oct 2009 A1
20090265753 Anderson et al. Oct 2009 A1
20090293056 Ferris Nov 2009 A1
20090300608 Ferris et al. Dec 2009 A1
20090313562 Appleyard et al. Dec 2009 A1
20090323706 Germain et al. Dec 2009 A1
20090328031 Pouyadou et al. Dec 2009 A1
20100005124 Wagner Jan 2010 A1
20100042720 Stienhans et al. Feb 2010 A1
20100061250 Nugent Mar 2010 A1
20100082540 Isaacson Apr 2010 A1
20100115341 Baker et al. May 2010 A1
20100131765 Bromley et al. May 2010 A1
20100191783 Mason et al. Jul 2010 A1
20100192157 Jackson et al. Jul 2010 A1
20100205029 Asherman Aug 2010 A1
20100205601 Abbas et al. Aug 2010 A1
20100211782 Auradkar et al. Aug 2010 A1
20100287553 Schmidt Nov 2010 A1
20100293270 Augenstein et al. Nov 2010 A1
20100318609 Lahiri et al. Dec 2010 A1
20100325199 Park et al. Dec 2010 A1
20100325441 Laurie et al. Dec 2010 A1
20100333116 Prahlad et al. Dec 2010 A1
20110016214 Jackson Jan 2011 A1
20110035754 Srinivasan Feb 2011 A1
20110055396 Dehaan Mar 2011 A1
20110055398 Dehaan et al. Mar 2011 A1
20110055470 Portolani Mar 2011 A1
20110072489 Parann-Nissany Mar 2011 A1
20110075667 Li et al. Mar 2011 A1
20110110382 Jabr et al. May 2011 A1
20110116443 Yu et al. May 2011 A1
20110126099 Anderson et al. May 2011 A1
20110138055 Daly et al. Jun 2011 A1
20110145413 Dawson et al. Jun 2011 A1
20110145657 Bishop et al. Jun 2011 A1
20110173303 Rider Jul 2011 A1
20110185063 Head et al. Jul 2011 A1
20110213966 Fu et al. Sep 2011 A1
20110219434 Betz et al. Sep 2011 A1
20110231715 Kunii et al. Sep 2011 A1
20110231899 Pulier et al. Sep 2011 A1
20110239039 Dieffenbach et al. Sep 2011 A1
20110246434 Cheenath Oct 2011 A1
20110252327 Awasthi et al. Oct 2011 A1
20110261811 Battestilli et al. Oct 2011 A1
20110261828 Smith Oct 2011 A1
20110276675 Singh et al. Nov 2011 A1
20110276951 Jain Nov 2011 A1
20110295998 Ferris et al. Dec 2011 A1
20110305149 Scott et al. Dec 2011 A1
20110307531 Gaponenko et al. Dec 2011 A1
20110320870 Kenigsberg et al. Dec 2011 A1
20120005724 Lee Jan 2012 A1
20120054367 Ramakrishnan et al. Mar 2012 A1
20120072318 Akiyama et al. Mar 2012 A1
20120072578 Alam Mar 2012 A1
20120072581 Tung et al. Mar 2012 A1
20120072985 Davne et al. Mar 2012 A1
20120072992 Arasaratnam et al. Mar 2012 A1
20120084445 Brock et al. Apr 2012 A1
20120084782 Chou et al. Apr 2012 A1
20120096134 Suit Apr 2012 A1
20120102193 Rathore et al. Apr 2012 A1
20120102199 Hopmann et al. Apr 2012 A1
20120131174 Ferris et al. May 2012 A1
20120137215 Kawara May 2012 A1
20120158967 Sedayao et al. Jun 2012 A1
20120159097 Jennas, II et al. Jun 2012 A1
20120167094 Suit Jun 2012 A1
20120173710 Rodriguez Jul 2012 A1
20120179909 Sagi et al. Jul 2012 A1
20120180044 Donnellan et al. Jul 2012 A1
20120182891 Lee et al. Jul 2012 A1
20120185913 Martinez et al. Jul 2012 A1
20120192016 Gotesdyner et al. Jul 2012 A1
20120192075 Ebtekar et al. Jul 2012 A1
20120201135 Ding et al. Aug 2012 A1
20120214506 Skaaksrud et al. Aug 2012 A1
20120222106 Kuehl Aug 2012 A1
20120236716 Anbazhagan et al. Sep 2012 A1
20120240113 Hur Sep 2012 A1
20120265976 Spiers et al. Oct 2012 A1
20120272025 Park et al. Oct 2012 A1
20120281706 Agarwal et al. Nov 2012 A1
20120281708 Chauhan et al. Nov 2012 A1
20120290647 Ellison et al. Nov 2012 A1
20120297238 Watson et al. Nov 2012 A1
20120311106 Morgan Dec 2012 A1
20120311568 Jansen Dec 2012 A1
20120324092 Brown et al. Dec 2012 A1
20120324114 Dutta et al. Dec 2012 A1
20120330769 Arceo Dec 2012 A1
20130003567 Gallant et al. Jan 2013 A1
20130013248 Brugler et al. Jan 2013 A1
20130036213 Hasan et al. Feb 2013 A1
20130044636 Koponen et al. Feb 2013 A1
20130054402 Asherman Feb 2013 A1
20130066940 Shao Mar 2013 A1
20130080509 Wang Mar 2013 A1
20130080624 Nagai et al. Mar 2013 A1
20130091557 Gurrapu Apr 2013 A1
20130097601 Podvratnik et al. Apr 2013 A1
20130104140 Meng et al. Apr 2013 A1
20130111540 Sabin May 2013 A1
20130117337 Dunham May 2013 A1
20130124712 Parker May 2013 A1
20130125124 Kempf et al. May 2013 A1
20130138816 Kuo et al. May 2013 A1
20130144978 Jain et al. Jun 2013 A1
20130152076 Patel Jun 2013 A1
20130152175 Hromoko et al. Jun 2013 A1
20130159097 Schory et al. Jun 2013 A1
20130159496 Hamilton et al. Jun 2013 A1
20130160008 Cawlfield et al. Jun 2013 A1
20130162753 Hendrickson et al. Jun 2013 A1
20130169666 Pacheco et al. Jul 2013 A1
20130179941 McGloin et al. Jul 2013 A1
20130182712 Aguayo et al. Jul 2013 A1
20130185433 Zhu et al. Jul 2013 A1
20130191106 Kephart et al. Jul 2013 A1
20130198374 Zalmanovitch et al. Aug 2013 A1
20130204849 Chacko Aug 2013 A1
20130232491 Radhakrishnan et al. Sep 2013 A1
20130246588 Borowicz et al. Sep 2013 A1
20130250770 Zou et al. Sep 2013 A1
20130254415 Fullen et al. Sep 2013 A1
20130262347 Dodson Oct 2013 A1
20130283364 Chang et al. Oct 2013 A1
20130297769 Chang et al. Nov 2013 A1
20130318240 Hebert et al. Nov 2013 A1
20130318546 Kothuri et al. Nov 2013 A1
20130339949 Spiers et al. Dec 2013 A1
20140006481 Frey et al. Jan 2014 A1
20140006535 Reddy Jan 2014 A1
20140006585 Dunbar et al. Jan 2014 A1
20140006881 Loimuneva Jan 2014 A1
20140032491 Neerincx Jan 2014 A1
20140040473 Ho et al. Feb 2014 A1
20140040883 Tompkins Feb 2014 A1
20140052877 Mao Feb 2014 A1
20140059310 Du et al. Feb 2014 A1
20140074850 Noel et al. Mar 2014 A1
20140075048 Yuksel et al. Mar 2014 A1
20140075108 Dong et al. Mar 2014 A1
20140075357 Flores et al. Mar 2014 A1
20140075501 Srinivasan et al. Mar 2014 A1
20140089727 Cherkasova et al. Mar 2014 A1
20140098762 Ghai et al. Apr 2014 A1
20140108985 Scott et al. Apr 2014 A1
20140115016 Perrin Apr 2014 A1
20140122560 Ramey et al. May 2014 A1
20140136779 Guha et al. May 2014 A1
20140140211 Chandrasekaran et al. May 2014 A1
20140141720 Princen et al. May 2014 A1
20140156557 Zeng et al. Jun 2014 A1
20140164486 Ravichandran et al. Jun 2014 A1
20140188825 Muthukkaruppan et al. Jul 2014 A1
20140189095 Lindberg et al. Jul 2014 A1
20140189125 Amies et al. Jul 2014 A1
20140215127 Perrin Jul 2014 A1
20140215471 Cherkasova Jul 2014 A1
20140222953 Karve et al. Aug 2014 A1
20140244851 Lee Aug 2014 A1
20140245298 Zhou et al. Aug 2014 A1
20140279917 Minh Sep 2014 A1
20140282536 Dave et al. Sep 2014 A1
20140282611 Campbell et al. Sep 2014 A1
20140282889 Ishaya et al. Sep 2014 A1
20140289200 Kato Sep 2014 A1
20140297569 Clark et al. Oct 2014 A1
20140297835 Buys Oct 2014 A1
20140314078 Jilani Oct 2014 A1
20140317261 Shatzkamer et al. Oct 2014 A1
20140366155 Chang et al. Dec 2014 A1
20140372567 Ganesh et al. Dec 2014 A1
20150033086 Sasturkar et al. Jan 2015 A1
20150043576 Dixon et al. Feb 2015 A1
20150052247 Threefoot et al. Feb 2015 A1
20150052517 Raghu et al. Feb 2015 A1
20150058382 St. Laurent et al. Feb 2015 A1
20150058459 Amendjian et al. Feb 2015 A1
20150071285 Kumar et al. Mar 2015 A1
20150100471 Curry, Jr. et al. Apr 2015 A1
20150106578 Warfield Apr 2015 A1
20150106802 Ivanov et al. Apr 2015 A1
20150106805 Melander et al. Apr 2015 A1
20150117199 Chinnaiah Sankaran et al. Apr 2015 A1
20150117458 Gurkan et al. Apr 2015 A1
20150120914 Wada et al. Apr 2015 A1
20150178133 Phelan et al. Jun 2015 A1
20150215819 Bosch et al. Jul 2015 A1
20150227405 Jan et al. Aug 2015 A1
20150242204 Hassine et al. Aug 2015 A1
20150249709 Teng et al. Sep 2015 A1
20150280980 Bitar Oct 2015 A1
20150281067 Wu Oct 2015 A1
20150281113 Siciliano et al. Oct 2015 A1
20150309908 Pearson et al. Oct 2015 A1
20150319063 Zourzouvillys et al. Nov 2015 A1
20150326524 Tankala et al. Nov 2015 A1
20150339210 Kopp et al. Nov 2015 A1
20150373108 Fleming et al. Dec 2015 A1
20150379062 Vermeulen Dec 2015 A1
20160011925 Kulkarni et al. Jan 2016 A1
20160013990 Kulkarni et al. Jan 2016 A1
20160062786 Meng et al. Mar 2016 A1
20160070740 Vermeulen Mar 2016 A1
20160094398 Choudhury et al. Mar 2016 A1
20160094480 Kulkarni et al. Mar 2016 A1
20160094643 Jain et al. Mar 2016 A1
20160099847 Melander et al. Apr 2016 A1
20160105393 Thakkar et al. Apr 2016 A1
20160127184 Bursell May 2016 A1
20160134557 Steinder et al. May 2016 A1
20160164914 Madhav et al. Jun 2016 A1
20160188527 Cherian et al. Jun 2016 A1
20160234071 Nambiar et al. Aug 2016 A1
20160239399 Babu et al. Aug 2016 A1
20160253078 Ebtekar et al. Sep 2016 A1
20160254968 Ebtekar et al. Sep 2016 A1
20160261564 Foxhoven et al. Sep 2016 A1
20160277368 Narayanaswamy et al. Sep 2016 A1
20160292166 Russell Oct 2016 A1
20160342633 Senthilnathan Nov 2016 A1
20160344834 Das Nov 2016 A1
20160350353 Li Dec 2016 A1
20170005948 Melander et al. Jan 2017 A1
20170024260 Chandrasekaran et al. Jan 2017 A1
20170026470 Bhargava et al. Jan 2017 A1
20170031723 George Feb 2017 A1
20170041342 Efremov et al. Feb 2017 A1
20170054659 Ergin et al. Feb 2017 A1
20170068566 Hosie Mar 2017 A1
20170097841 Chang et al. Apr 2017 A1
20170099188 Chang et al. Apr 2017 A1
20170104755 Arregoces et al. Apr 2017 A1
20170147297 Krishnamurthy et al. May 2017 A1
20170171158 Hoy et al. Jun 2017 A1
20170192863 Eluri Jul 2017 A1
20170223068 Bhattacharjee Aug 2017 A1
20170264663 Bicket et al. Sep 2017 A1
20170339070 Chang et al. Nov 2017 A1
20190102262 Sukhomlinov Apr 2019 A1
20190138624 Menendez May 2019 A1
Foreign Referenced Citations (13)
Number Date Country
101719930 Jun 2010 CN
101394360 Jul 2011 CN
102164091 Aug 2011 CN
104320342 Jan 2015 CN
105740084 Jul 2016 CN
2228719 Sep 2010 EP
2439637 Apr 2012 EP
2645253 Nov 2014 EP
10-2015-0070676 May 2015 KR
M394537 Dec 2010 TW
WO 2009155574 Dec 2009 WO
WO 2010030915 Mar 2010 WO
WO 2013158707 Oct 2013 WO
Non-Patent Literature Citations (59)
Entry
Author Unknown, “5 Benefits of a Storage Gateway in the Cloud,” Blog, TwinStrata, Inc., Jul. 25, 2012, XP055141645, 4 pages, https://web.archive.org/web/20120725092619/http://blog.twinstrata.com/2012/07/10//5-benefits-of-a-storage-gateway-in-the-cloud.
Author Unknown, “Joint Cisco and VMWare Solution for Optimizing Virtual Desktop Delivery: Data Center 3.0: Solutions to Accelerate Data Center Virtualization,” Cisco Systems, Inc. and VMware, Inc., Sep. 2008, 10 pages.
Author Unknown, “Open Data Center Alliance Usage: Virtual Machine (VM) Interoperability in a Hybrid Cloud Environment Rev. 1.2,” Open Data Center Alliance, Inc., 2013, 18 pages.
Author Unknown, “Real-Time Performance Monitoring on Juniper Networks Devices, Tips and Tools for Assessing and Analyzing Network Efficiency,” Juniper Networks, Inc., May 2010, 35 pages.
Beyer, Steffen, “Module “Data::Locations?!”,” YAPC::Europe, London, UK,ICA, Sep. 22-24, 2000, XP002742700, 15 pages.
Borovick, Lucinda, et al., “Architecting the Network for the Cloud,” IDC White Paper, Jan. 2011, 8 pages.
Bosch, Greg, “Virtualization,” last modified Apr. 2012 by B. Davison, 33 pages.
Broadcasters Audience Research Board, “What's Next,” http://lwww.barb.co.uk/whats-next, accessed Jul. 22, 2015, 2 pages.
Cisco Systems, Inc. “Best Practices in Deploying Cisco Nexus 1000V Series Switches on Cisco UCS B and C Series Cisco UCS Manager Servers,” Cisco White Paper, Apr. 2011, 36 pages, http://www.cisco.com/en/US/prod/collateral/switches/ps9441/ps9902/white_paper_c11-558242.pdf.
Cisco Systems, Inc., “Cisco Unified Network Services: Overcome Obstacles to Cloud-Ready Deployments,” Cisco White Paper, Jan. 2011, 6 pages.
Cisco Systems, Inc., “Cisco Intercloud Fabric: Hybrid Cloud with Choice, Consistency, Control and Compliance,” Dec. 10, 2014, 22 pages.
Cisco Technology, Inc., “Cisco Expands Videoscape TV Platform Into the Cloud,” Jan. 6, 2014, Las Vegas, Nevada, Press Release, 3 pages.
CSS Corp, “Enterprise Cloud Gateway (ECG)—Policy driven framework for managing multi-cloud environments,” original published on or about Feb. 11, 2012; 1 page; http://www.css-cloud.com/platform/enterprise-cloud-gateway.php.
Fang K., “LISP MAC-EID-TO-RLOC Mapping (LISP based L2VPN),” Network Working Group, Internet Draft, CISCO Systems, Jan. 2012, 12 pages.
Herry, William, “Keep It Simple, Stupid: OpenStack nova-scheduler and its algorithm”, May 12, 2012, IBM, 12 pages.
Hewlett-Packard Company, “Virtual context management on network devices”, Research Disclosure, vol. 564, No. 60, Apr. 1, 2011, Mason Publications, Hampshire, GB, Apr. 1, 2011, 524.
Juniper Networks, Inc., “Recreating Real Application Traffic in Junosphere Lab,” Solution Brief, Dec. 2011, 3 pages.
Kenhui, “Musings On Cloud Computing and IT-as-a-Service: [Updated for Havana] Openstack Computer for VSphere Admins, Part 2: Nova-Scheduler and DRS”, Jun. 26, 2013, Cloud Architect Musings, 12 pages.
Kolyshkin, Kirill, “Virtualization in Linux,” Sep. 1, 2006, XP055141648, 5 pages, https://web.archive.org/web/20070120205111/http://download.openvz.org/doc/openvz-intro.pdf.
Lerach, S.R.O., “Golem,” http://www.lerach.cz/en/products/golem, accessed Jul. 22, 2015, 2 pages.
Linthicum, David, “VM Import could be a game changer for hybrid clouds”, InfoWorld, Dec. 23, 2010, 4 pages.
Naik, Vijay K., et al., “Harmony: A Desktop Grid for Delivering Enterprise Computations,” Grid Computing, 2003, Fourth International Workshop on Proceedings, Nov. 17, 2003, pp. 1-11.
Nair, Srijith K. et al., “Towards Secure Cloud Bursting, Brokerage and Aggregation,” 2012, 8 pages, www.flexiant.com.
Nielsen, “SimMetry Audience Measurement—Technology,” http://www.nielsen-admosphere.eu/products-and-services/simmetry-audience-measurement-technology/, accessed Jul. 22, 2015, 6 pages.
Nielsen, “Television,” http://www.nielsen.com/us/en/solutions/measurement/television.html, accessed Jul. 22, 2015, 4 pages.
Open Stack, “Filter Scheduler,” updated Dec. 17, 2017, 5 pages, accessed on Dec. 18, 2017, https://docs.openstack.org/nova/latest/user/filter-scheduler.html.
Rabadan, J., et al., “Operational Aspects of Proxy-ARP/ND in EVPN Networks,” BESS Worksgroup Internet Draft, draft-snr-bess-evpn-proxy-arp-nd-02, Oct. 6, 2015, 22 pages.
Saidi, Ali, et al., “Performance Validation of Network-Intensive Workloads on a Full-System Simulator,” Interaction between Operating System and Computer Architecture Workshop, (IOSCA 2005), Austin, Texas, Oct. 2005, 10 pages.
Shunra, “Shunra for HP Software; Enabling Confidence in Application Performance Before Deployment,” 2010, 2 pages.
Son, Jungmin, “Automatic decision system for efficient resource selection and allocation in inter-clouds,” Jun. 2013, 35 pages.
Wikipedia, “Filter (software)”, Wikipedia, Feb. 8, 2014, 2 pages, https://en.wikipedia.org/w/index.php?title=Filter_%28software%29&oldid=594544359.
Wikipedia; “Pipeline (Unix)”, Wikipedia, May 4, 2014, 4 pages, https://en.wikipedia.org/w/index.php?title=Pipeline2/028Unix%29&oldid=606980114.
Amedro, Brian, et al., “An Efficient Framework for Running Applications on Clusters, Grids and Cloud,” 2010, 17 pages.
Author Unknown, “A Look at DeltaCloud: The Multi-Cloud API,” Feb. 17, 2012, 4 pages.
Author Unknown, “About Deltacloud,” Apache Software Foundation, Aug. 18, 2013, 1 page.
Author Unknown, “Architecture for Managing Clouds, A White Paper from the Open Cloud Standards Incubator,” Version 1.0.0, Document No. DSP-IS0102, Jun. 18, 2010, 57 pages.
Author Unknown, “Cloud Infrastructure Management Interface—Common Information Model (CIMI-CIM),” Document No. DSP0264, Version 1.0.0, Dec. 14, 2012, 21 pages.
Author Unknown, “Cloud Infrastructure Management Interface (CIMI) Primer,” Document No. DSP2027, Version 1.0.1, Sep. 12, 2012, 30 pages.
Author Unknown, “cloudControl Documentation,” Aug. 25, 2013, 14 pages.
Author Unknown, “Interoperable Clouds, A White Paper from the Open Cloud Standards Incubator,” Version 1.0.0, Document No. DSP-IS0101, Nov. 11, 2009, 21 pages.
Author Unknown, “Microsoft Cloud Edge Gateway (MCE) Series Appliance,” Iron Networks, Inc., 2014, 4 pages.
Author Unknown, “Use Cases and Interactions for Managing Clouds, A White Paper from the Open Cloud Standards Incubator,” Version 1.0.0, Document No. DSP-ISO0103, Jun. 16, 2010, 75 pages.
Author Unknown, “Apache Ambari Meetup What's New,” Hortonworks Inc., Sep. 2013, 28 pages.
Author Unknown, “Introduction,” Apache Ambari project, Apache Software Foundation, 2014, 1 page.
Citrix, “Citrix StoreFront 2.0” White Paper, Proof of Concept Implementation Guide, Citrix Systems, Inc., 2013, 48 pages.
Citrix, “CloudBridge for Microsoft Azure Deployment Guide,” 30 pages.
Citrix, “Deployment Practices and Guidelines for NetScaler 10.5 on Amazon Web Services,” White Paper, citrix.com, 2014, 14 pages.
Gedymin, Adam, “Cloud Computing with an emphasis on Google App Engine,” Sep. 2011, 146 pages.
Good, Nathan A., “Use Apache Deltacloud to administer multiple instances with a single API,” Dec. 17, 2012, 7 pages.
Kunz, Thomas, et al., “OmniCloud—The Secure and Flexible Use of Cloud Storage Services,” 2014, 30 pages.
Logan, Marcus, “Hybrid Cloud Application Architecture for Elastic Java-Based Web Applications,” F5 Deployment Guide Version 1.1, 2016, 65 pages.
Lynch, Sean, “Monitoring cache with Claspin” Facebook Engineering, Sep. 19, 2012, 5 pages.
Meireles, Fernando Miguel Dias, “Integrated Management of Cloud Computing Resources,” 2013-2014, 286 pages.
Mu, Shuai, et al., “uLibCloud: Providing High Available and Uniform Accessing to Multiple Cloud Storages,” 2012 IEEE, 8 pages.
Sun, Aobing, et al., “IaaS Public Cloud Computing Platform Scheduling Model and Optimization Analysis,” Int. J. Communications, Network and System Sciences, 2011, 4, 803-811, 9 pages.
Szymaniak, Michal, et al., “Latency-Driven Replica Placement”, vol. 47 No. 8, IPSJ Journal, Aug. 2006, 12 pages.
Toews, Everett, “Introduction to Apache jclouds,” Apr. 7, 2014, 23 pages.
Von Laszewski, Gregor, et al., “Design of a Dynamic Provisioning System for a Federated Cloud and Bare-metal Environment,” 2012, 8 pages.
Ye, Xianglong, et al., “A Novel Blocks Placement Strategy for Hadoop,” 2012 IEEE/ACTS 11th International Conference on Computerand Information Science, 2012 IEEE, 5 pages.
Related Publications (1)
Number Date Country
20190147070 A1 May 2019 US