DATA MANAGEMENT SYSTEMS AND METHODS

• US 20130151653A1
• Filed: 06/08/2012
• Published: 06/13/2013
• Est. Priority Date: 06/22/2007
• Status: Abandoned Application

• Current Assignee: Tenoware R&D Limited
• Original Assignee: Antoni Sawicki, Tomasz Nowak
• Inventors: Sawicki, Antoni, Nowak, Tomasz, Murphy, Kelly
• Application Number:
  US13/492,633
• Publication Number:
  US 20130151653A1
• Time in Patent Office: Days
• US Class Current: 709/216
• CPC Class Codes: G06F 11/1076 Parity data used in redundant arrays of independent storages, e.g. in RAID systems
• CPC Class Codes: G06F 11/1425 by reconfiguration of node membership
• CPC Class Codes: G06F 11/1443 Transmit or communication errors
• CPC Class Codes: G06F 11/16 Error detection or correction of the data by redundancy in hardware
• CPC Class Codes: G06F 11/1662 the resynchronized component or unit being a persistent storage device re-synchronization of failed mirror storage G06F11/2082; rebuild or reconstruction of parity RAID storage G06F11/1008
• CPC Class Codes: G06F 11/2094 Redundant storage or storage space G06F11/2056 takes precedence
• CPC Class Codes: G06F 15/17331 Distributed shared memory [DSM], e.g. remote direct memory access [RDMA]
• CPC Class Codes: G06F 16/176 Support for shared access to files; File sharing support
• CPC Class Codes: G06F 2201/815 Virtual
• CPC Class Codes: G06F 2211/104 Metadata, i.e. metadata associated with RAID systems with parity
• CPC Class Codes: G06F 3/0607 by facilitating the process of upgrading existing storage systems, e.g. for improving compatibility between host and storage device
• CPC Class Codes: G06F 3/0619 in relation to data integrity, e.g. data losses, bit errors
• CPC Class Codes: G06F 3/0644 Management of space entities, e.g. partitions, extents, pools
• CPC Class Codes: G06F 3/065 Replication mechanisms
• CPC Class Codes: G06F 3/0659 Command handling arrangements, e.g. command buffers, queues, command scheduling
• CPC Class Codes: G06F 3/067 Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
• CPC Class Codes: H04L 1/1809 Selective-repeat protocols
• CPC Class Codes: H04L 67/1097 for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]

Abstract

Example data management systems and methods are described. In one implementation, a method restores data on a first data storage node that is part of a data storage system including multiple storage nodes. The method marks multiple data entries stored in the first data storage node as dirty. A data index associated with the data storage system is received from a quorum of the data storage nodes in the data storage system. The data index is compared with data entries stored in the first data storage node. Data entries that are not contained in the data index are deleted from the first data storage node. Data entries stored in the first data storage nodes are modified to match corresponding data entries in the data storage system based on the data index.

Claims

1. A computer-implemented method comprising:

receiving a first data packet communicated from a sending device, the first data packet having an associated first sequence number;

receiving a second data packet from the sending device, the second data packet having an associated second sequence number;

determining, using one or more processors, whether the second sequence number is a next number in sequence following the first sequence number; and

responsive to determining that the second sequence number is not the next number in sequence following the first sequence number;

identifying at least one intervening sequence number between the first sequence number and the second sequence number;

determining whether at least one data packet associated with the at least one intervening sequence number is stored in a buffer; and

communicating a request to the sending device to re-send the second data packet responsive to determining that the at least one data packet associated with the at least one intervening sequence number is not stored in the buffer.

2. A method as recited in claim 1, further comprising waiting a predetermined time period for receipt of the at least one data packet associated with the at least one intervening sequence number before communicating the request to the sending device to re-send the second data packet.

3. A method as recited in claim 1, further comprising, prior to communicating the request to the sending device to re-send the second data packet, re-checking the buffer after a time period for the at least one data packet associated with the at least one intervening sequence number.

4. A method as recited in claim 1, further comprising receiving the at least one data packet associated with the intervening sequence numbers not stored in the buffer responsive to communicating the request to the sending device to re-send the second data packet.

5. A method as recited in claim 1, the receiving of the first data packet and the second data packet being performed without acknowledging receipt of the first data packet or the second data packet to the sending device.

6. A computer-implemented method of restoring data on a first data storage node that is part of a data storage system including a plurality of storage nodes, the method comprising:

marking a plurality of data entries stored in the first data storage node as dirty;

receiving a data index associated with the data storage system from a quorum of the data storage nodes in the data storage system;

comparing, using one or more processors, the data index with data entries stored in the first data storage node;

deleting data entries from the first data storage node that are not contained in the data index; and

modifying data entries stored in the first data storage node to match corresponding data entries in the data storage system based on the data index.

7. A method as recited in claim 6, the modifying of the data entries stored in the first data storage node further comprising marking each modified data entry as clean.

8. A method as recited in claim 6, the method performed responsive to initializing the first data storage node.

9. A method as recited in claim 6, the method performed responsive to restarting the first data storage node.

10. A method as recited in claim 6, the comparing of the data index with data entries stored in the first data storage node further comprising comparing at least one of a file name, a file size, a date of creation, a date of last modification, a data attribute, data content, and a security descriptor.

11. A method as recited in claim 6, the modifying of the data entries stored in the first data storage node including retrieving data from the quorum of data storage nodes.

12. A method as recited in claim 6, the quorum of data storage nodes excluding the first data storage node.

13. A method as recited in claim 6, the modifying of the data entries stored in the first data storage node managed by a virtual storage controller.

14. An apparatus comprising:

a memory to store received data packets; and

one or more processors coupled to the memory, the one or more processors configured to;

mark a plurality of data entries stored in a first data storage node as dirty;

receive a data index associated with a data storage system that includes a plurality of storage nodes, the data index received from a quorum of the data storage nodes in the data storage system;

compare the data index with data entries stored in the first data storage node;

delete data entries from the first data storage node that are not contained in the data index; and

modify data entries stored in the first data storage node to match corresponding data entries in the data storage system based on the data index.

15. The apparatus of claim 14, the one or more processors further configured to mark each modified data entry as clean.

16. The apparatus of claim 14, the data entries being modified responsive to initializing the apparatus.

17. The apparatus of claim 14, the data entries modified responsive to restarting the apparatus after a period of time being disconnected from the data storage system.

18. The apparatus of claim 14, the data index compared with the data entries by comparing at least one of a file name, a file size, a date of creation, a date of last modification, a data attribute, data content, and a security descriptor.

19. The apparatus of claim 14, the one or more processors further configured to retrieve current data from the quorum of data storage nodes.

20. The apparatus of claim 14, the quorum of data storage nodes excluding the first data storage node.