SYSTEMS AND METHODS FOR SECURING DATA IN MOTION
First Claim
1. A method for reading and writing a set of data, comprising:
- splitting the set of data into one or more data shares using an information dispersal algorithm;
storing the one or more data shares in share locations;
determining that at least one of the share locations is unavailable for data storage operations; and
storing incoming data storage operations associated with each of the unavailable share locations in respective journaling queues unique to each of the unavailable share locations;
4 Assignments
0 Petitions
Accused Products
Abstract
Systems and methods for reading and writing a set of data using a journaling service are provided. The journaling service may be used to identify and record data storage operations associated with one or more shares of data stored in one or more share locations. The journaling service may use logs to record each of the read and write requests to the share locations. In some embodiments, the log may be a queue data structure that stores information associated with failed data storage operations. In some embodiments, the journaling service may leverage both memory and disk storage in order to maintain the journaling queue. In some embodiments, the journaling queue may maintain information associated with the state of each share location. In some embodiments, this information may be used by the journaling service to determine when to monitor and record information regarding data storage operations associated with the share locations.
88 Citations
22 Claims
-
1. A method for reading and writing a set of data, comprising:
-
splitting the set of data into one or more data shares using an information dispersal algorithm; storing the one or more data shares in share locations; determining that at least one of the share locations is unavailable for data storage operations; and storing incoming data storage operations associated with each of the unavailable share locations in respective journaling queues unique to each of the unavailable share locations; - View Dependent Claims (2, 3, 4, 5)
-
-
6. A method for reading and writing a set of data, comprising:
-
splitting the set of data into one or more data shares using an information dispersal algorithm; storing the one or more data shares in share locations; establishing a maximum number of failed data storage operations; storing failed incoming data storage operations associated with each of the share locations in respective journaling queues; determining that the failed incoming data storage operations stored in at least one of the journaling queues exceeds the established maximum number; and discarding the failed incoming data storage operations stored in the at least one of the journaling queues that exceeds the established maximum number. - View Dependent Claims (7, 8)
-
-
9. A method for reading and writing a set of data, comprising:
-
splitting the set of data into one or more data shares using an information dispersal algorithm; storing the one or more data shares in share locations, wherein at least one of share locations is rebuilding; receiving a request to perform a data storage operation on a file associated with one of the share locations that is rebuilding; determining that the file is restored in the one of the share location that is rebuilding; and based on the determination, storing the data storage operation in a journaling queue associated with the one of the share locations that is rebuilding. - View Dependent Claims (10, 11)
-
-
12. A system for reading and writing a set of data, the system comprising processing circuitry configured to:
-
split the set of data into one or more data shares using an information dispersal algorithm; store the one or more data shares in share locations; determine that at least one of the share locations is unavailable for data storage operations; and store incoming data storage operations associated with each of the unavailable share locations in respective journaling queues unique to each of the unavailable share locations; - View Dependent Claims (13, 14, 15, 16)
-
-
17. A system for reading and writing a set of data, the system comprising processing circuitry configured to:
-
split the set of data into one or more data shares using an information dispersal algorithm; store the one or more data shares in share locations; establish a maximum number of failed data storage operations; store failed incoming data storage operations associated with each of the share locations in respective journaling queues; determine that the failed incoming data storage operations stored in at least one of the journaling queues exceeds the established maximum number; and discard the failed incoming data storage operations stored in the at least one of the journaling queues that exceeds the established maximum number. - View Dependent Claims (18, 19)
-
-
20. A system for reading and writing a set of data, the system comprising processing circuitry configured to:
-
split the set of data into one or more data shares using an information dispersal algorithm; store the one or more data shares in share locations, wherein at least one of share locations is rebuilding; receive a request to perform a data storage operation on a file associated with one of the share locations that is rebuilding; determine that the file is restored in the one of the share location that is rebuilding; and based on the determination, store the data storage operation in a journaling queue associated with the one of the share locations that is rebuilding. - View Dependent Claims (21, 22)
-
Specification