×

Expanding information dispersal algorithm width without rebuilding through imposter slices

  • US 10,241,864 B2
  • Filed: 09/30/2016
  • Issued: 03/26/2019
  • Est. Priority Date: 10/30/2015
  • Status: Active Grant
First Claim
Patent Images

1. A method of accessing data in a dispersed storage network, the dispersed storage network including an initial set of dispersed storage units comprising:

  • at a first time, storing in each respective dispersed storage unit of the initial set of dispersed storage units a respective encoded data slice of a set of encoded data slices;

    at a second time detecting an expansion of the initial set of dispersed storage units to include new dispersed storage units, the expansion resulting in an expanded set of dispersed storage units, wherein the expansion of the initial set of dispersed storage units is based on increasing an information dispersal algorithm (IDA) width;

    identifying primary storage units of the expanded set of dispersed storage units; and

    for each respective primary storage unit of the expanded set of dispersed storage units that is one of the new dispersed storage units, storing the respective encoded data slice of one of the respective dispersed storage units of the initial set of dispersed storage units that is not one of the primary storage units.

View all claims
  • 4 Assignments
Timeline View
Assignment View
    ×
    ×