Pessimistic data reading in a dispersed storage network
View Patent ↗A method begins by a processing module receiving a data retrieval request and determining a read threshold number of dispersed storage (DS). The method continues with the processing module sending read request messages to DS units and receiving encoded data slices to produce received encoded data slices. The method continues with the processing module determining an incremental number of encoded data slices based on the number of received encoded data slices, determining an incremental number of DS units, and sending a read request message to each of the incremental number of DS units when the number of received encoded data slices compares unfavorably to a decode threshold number. The method continues with the processing module dispersed storage error decoding the received encoded data slices to produce data when the number of received encoded data slices compares favorably to the decode threshold number of encoded data slices.
1. A method comprises:
receiving a data retrieval request;
determining a read threshold number of dispersed storage (DS) units of a DS unit storage set in response to the data retrieval request;
sending read request messages to the read threshold number of DS units;
entering a loop, wherein the loop includes:
receiving encoded data slices within a time period to produce received encoded data slices;
when the number of received encoded data slices compares unfavorably to a decode threshold number:
determining an incremental number of encoded data slices as at least one of:
the difference between the decode threshold number and the number of received encoded data slices;
the difference between the read threshold number and the number of received encoded data slices; and
the difference between a pillar width number and the number of received encoded data slices;
determining an incremental number of DS units of the DS unit storage set;
sending a read request message to each of the incremental number of DS units; and
repeating the loop; and
when the number of received encoded data slices compares favorably to the decode threshold number of encoded data slices, exiting the loop; and
dispersed storage error decoding the received encoded data slices to produce data.
2. The method of claim 1 , wherein the read threshold number comprises at least one of:
the read threshold number is equal to the decode threshold; and
the read threshold number is greater than the decode threshold and less than the pillar width.
3. The method of claim 1 , wherein the determining of the read threshold number of DS units is based on at least one of:
a read threshold number;
a data identifier (ID);
a user ID;
error coding dispersal storage function parameters;
a DS unit capability;
a DS unit performance history;
a DS unit query;
a virtual dispersed storage network (DSN) address to physical location table lookup;
a list;
a vault lookup;
a command;
a predetermination;
a message;
a source name; and
a slice name.
4. The method of claim 1 , wherein the time period comprises:
a dynamic time duration that is based on at least one of a list, a performance indicator, and a reliability indicator.
5. The method of claim 1 , wherein the determining of the incremental number of DS units is based on at least one of:
the incremental number of encoded data slices;
the received encoded data slices;
identifying a previously responding DS unit;
identifying a previously non-responding DS unit;
identifying a DS unit associated with a timeout indication;
identifying a DS unit that was not identified as a DS unit of the read threshold number of DS units of the DS unit storage set;
elapsed time since sending the read threshold number of read request messages to the read threshold number of DS units;
a comparison of the elapsed time to a total elapsed time threshold;
a data identifier (ID);
a user ID;
error coding dispersal storage function parameters;
a DS unit capability;
a DS unit performance history;
a DS unit query;
a virtual dispersed storage network (DSN) address to physical location table lookup;
a list;
a vault lookup;
a command;
a predetermination;
a message;
a source name; and
a slice name.
6. A computer comprises:
an interface; and
a processing module operable to:
receive, via the interface, a data retrieval request;
determine a read threshold number of dispersed storage (DS) units of a DS unit storage set in response to the data retrieval request;
send, via the interface, read request messages to the read threshold number of DS units;
enter a loop, wherein the loop includes:
receiving, via the interface, encoded data slices within a time period to produce received encoded data slices;
when the number of received encoded data slices compares unfavorably to a decode threshold number:
determining an incremental number of encoded data slices as at least one of:
the difference between the decode threshold number and the number of received encoded data slices;
the difference between the read threshold number and the number of received encoded data slices; and
the difference between a pillar width number and the number of received encoded data slices;
determining an incremental number of DS units of the DS unit storage set;
sending, via the interface, a read request message to each of the incremental number of DS units; and
repeating the loop; and
when the number of received encoded data slices compares favorably to the decode threshold number of encoded data slices, exiting the loop; and
dispersed storage error decode the received encoded data slices to produce data.
7. The computer of claim 6 , wherein the read threshold number comprises at least one of:
the read threshold number is equal to the decode threshold; and
the read threshold number is greater than the decode threshold and less than the pillar width.
8. The computer of claim 6 , wherein the processing module further functions to determine the read threshold number of DS units based on at least one of:
a read threshold number;
a data identifier (ID);
a user ID;
error coding dispersal storage function parameters;
a DS unit capability;
a DS unit performance history;
a DS unit query;
a virtual dispersed storage network (DSN) address to physical location table lookup;
a list;
a vault lookup;
a command;
a predetermination;
a message;
a source name; and
a slice name.
9. The computer of claim 6 , wherein the time period comprises:
a dynamic time duration that is based on at least one of a list, a performance indicator, and a reliability indicator.
10. The computer of claim 6 , wherein the processing module determining of the incremental number of DS units is based on at least one of:
the incremental number of encoded data slices;
the received encoded data slices;
identifying a previously responding DS unit;
identifying a previously non-responding DS unit;
identifying a DS unit associated with a timeout indication;
identifying a DS unit that was not identified as a DS unit of the read threshold number of DS units of the DS unit storage set;
elapsed time since sending the read threshold number of read request messages to the read threshold number of DS units;
a comparison of the elapsed time to a total elapsed time threshold;
a data identifier (ID);
a user ID;
error coding dispersal storage function parameters;
a DS unit capability;
a DS unit performance history;
a DS unit query;
a virtual dispersed storage network (DSN) address to physical location table lookup;
a list;
a vault lookup;
a command;
a predetermination;
a message;
a source name; and
a slice name.