Hyper-scale p2p deduplicated storage system using a distributed ledger

US2021019232A1 · US · A1

Patent metadata
FieldValue
Publication numberUS-2021019232-A1
Application numberUS-201916516109-A
CountryUS
Kind codeA1
Filing dateJul 18, 2019
Priority dateJul 18, 2019
Publication dateJan 21, 2021
Grant date

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

One example method includes receiving from a node, in an HSAN that includes multiple nodes, an ADD_DATA request to add an entry to a distributed ledger of the HSAN, the request comprising a user ID that identifies the node, a hash of a data segment, and a storage location of the data segment at the node, performing a challenge-and-response process with the node to verify that the node has a copy of the data that was the subject of the entry, making a determination that a replication factor X has not been met, and adding the entry to the distributed ledger upon successful conclusion of the challenge-and-response process.

First claim

Opening claim text (preview).

What is claimed is: 1 . A method, comprising: receiving from a node, in an HSAN that includes multiple nodes, an ADD_DATA request to add an entry to a distributed ledger of the HSAN, the request comprising a user ID that identifies the node, a hash of a data segment, and a storage location of the data segment at the node; performing a challenge-and-response process with the node to verify that the node has a copy of the data that was the subject of the entry; making a determination that a replication factor X has not been met; and adding the entry to the distributed ledger upon successful conclusion of the challenge-and-response process. 2 . The method as recited in claim 1 , further comprising splitting backup data into a plurality of data segments that includes the data segment, and hashing the data segment. 3 . The method as recited in claim 1 , wherein the distributed ledger does not permit an HSAN node access to the data segment upon which the entry is based unless that HSAN node has demonstrated possession of a copy of that data segment. 4 . The method as recited in claim 1 , wherein the distributed ledger is a public distributed ledger that permits any HSAN node to access the entry. 5 . The method as recited in claim 1 , wherein the distributed ledger is a public distributed ledger that includes one or more entries that point to public data accessible by all nodes of the HSAN. 6 . The method as recited in claim 1 , further comprising adding a node to the HSAN upon mutual agreement of other nodes of the HSAN. 7 . The method as recited in claim 1 , wherein metadata concerning the data segment identified in the request is omitted from the request. 8 . The method as recited in claim 1 , wherein use of the replication factor X ensures that no more than X copies of a data segment will be stored in the HSAN. 9 . The method as recited in claim 1 , wherein entries are stored in the distributed ledger as a blockchain. 10 . The method as recited in claim 1 , further comprising performing any one or more of the HSAN operations: IS_PRESENT; REF_DATA; GET_DATA; DEREF_DATA; DEL_DATA; CHECK_DATA; and/or REPL_DATA. 11 . A non-transitory storage medium having stored therein instructions that are executable by one or more hardware processors to perform operations comprising: receiving from a node, in an HSAN that includes multiple nodes, an ADD_DATA request to add an entry to a distributed ledger of the HSAN, the request comprising a user ID that identifies the node, a hash of a data segment, and a storage location of the data segment at the node; performing a challenge-and-response process with the node to verify that the node has a copy of the data that was the subject of the entry; making a determination that a replication factor X has not been met; and adding the entry to the distributed ledger upon successful conclusion of the challenge-and-response process. 12 . The non-transitory storage medium as recited in claim 11 , wherein the operations further comprise splitting backup data into a plurality of data segments that includes the data segment, and hashing the data segment. 13 . The non-transitory storage medium as recited in claim 11 , wherein the distributed ledger does not permit an HSAN node access to the data segment upon which the entry is based unless that HSAN node has demonstrated possession of a copy of that data segment. 14 . The non-transitory storage medium as recited in claim 11 , wherein the distributed ledger is a public distributed ledger that permits any HSAN node to access the entry. 15 . The non-transitory storage medium as recited in claim 11 , wherein the distributed ledger is a public distributed ledger that includes one or more entries that point to public data accessible by all nodes of the HSAN. 16 . The non-transitory storage medium as recited in claim 11 , wherein the operations further comprise adding a node to the HSAN upon mutual agreement of other nodes of the HSAN. 17 . The non-transitory storage medium as recited in claim 11 , wherein metadata concerning the data segment identified in the request is omitted from the request. 18 . The non-transitory storage medium as recited in claim 11 , wherein use of the replication factor X ensures that no more than X copies of a data segment will be stored in the HSAN. 19 . The non-transitory storage medium as recited in claim 11 , wherein entries are stored in the distributed ledger as a blockchain. 20 . The non-transitory storage medium as recited in claim 11 , further comprising performing any one or more of the HSAN operations: IS_PRESENT; REF_DATA; GET_DATA; DEREF_DATA; DEL_DATA; CHECK_DATA; and/or REPL_DATA.

Assignees

Inventors

Classifications

  • using hash chains, e.g. blockchains or hash trees · CPC title

  • implemented based on peer-to-peer networks, e.g. gnutella (p2p communication protocols H04L67/104) · CPC title

  • De-duplication implemented within the file system, e.g. based on file segments (de-duplication techniques in storage systems for the management of data blocks G06F3/0641) · CPC title

  • 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] · CPC title

  • using de-duplication of the data · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US2021019232A1 cover?
One example method includes receiving from a node, in an HSAN that includes multiple nodes, an ADD_DATA request to add an entry to a distributed ledger of the HSAN, the request comprising a user ID that identifies the node, a hash of a data segment, and a storage location of the data segment at the node, performing a challenge-and-response process with the node to verify that the node has a cop…
Who is the assignee on this patent?
Emc Ip Holding Co Llc
What technology area does this patent fall under?
Primary CPC classification G06F16/1748. Mapped technology areas include Physics.
When was this patent published?
Publication date Thu Jan 21 2021 00:00:00 GMT+0000 (Coordinated Universal Time) (A1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 2 related publications on this page (citations in our corpus or others sharing the same primary CPC).