PEER-TO-PEER REDUNDANT FILE SERVER SYSTEM AND METHODS

• US 20180011874A1
• Filed: 08/02/2017
• Published: 01/11/2018
• Est. Priority Date: 04/29/2008
• Status: Abandoned Application

• Current Assignee: Overland Storage Incorporated (Silicon Valley Technology Partners LLC)
• Original Assignee: Overland Storage Incorporated (Silicon Valley Technology Partners LLC)
• Inventors: Lacapra, Francesco, Steele, Peter Wallace, Sartirana, Bruno, Hua, Ernest Ying Sue, Lin, I Chung Joseph, Li, Samuel Sui-Lun, Diller, Nathanael John, Ramsdell, Thomas Reynold, Nguyen, Don, Tran, Kyle Dinh
• Application Number:
  US15/667,065
• Publication Number:
  US 20180011874A1
• Time in Patent Office: Days
• CPC Class Codes: G06F 16/178 Techniques for file synchronisation in file systems
• CPC Class Codes: G06F 16/1834 implemented based on peer-to-peer networks, e.g. gnutella p2p communication protocols H04L67/104
• 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 67/104 Peer-to-peer [P2P] networks
• 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

Peer-to-peer redundant file server system and methods include clients that determine a target storage provider to contact for a particular storage transaction based on a pathname provided by the filesystem and a predetermined scheme such as a hash function applied to a portion of the pathname. Servers use the same scheme to determine where to store relevant file information so that the clients can locate the file information. The target storage provider may store the file itself and/or may store metadata that identifies one or more other storage providers where the file is stored. A file may be replicated in multiple storage providers, and the metadata may include a list of storage providers from which the clients can select (e.g., randomly) in order to access the file.

Claims

1-46. -46. (canceled)

47. A storage system comprising:

a client;

a storage provider in communication with the client over a communication network, the storage provider including a set of two or more storage nodes implemented on two or more different storage servers, and a distributed queuing mechanism allowing tasks to be queued for processing by one or more of the storage nodes of the set, the tasks comprising one or more resource-intensive tasks,

wherein a storage node of the set of storage nodes processes a task in the distributed queuing mechanism by acquiring a queueing lease on the task in the distributed queuing mechanism, wherein the queuing lease renders the task in the distributed queuing mechanism unavailable to be processed by the remaining storage nodes of the set for a designated duration of time, during which the remaining storage nodes are able to process other tasks queued in the distributed queuing mechanism, and

wherein the one or more resource-intensive tasks in the distributed queuing mechanism are processed when sufficient processing capabilities become available.

48. A storage system according to claim 47, wherein each storage node of the set of storage nodes is managed by a different storage server.

49. A storage system according to claim 48, wherein the set of storage nodes are associated with a multicast address and tasks are queued using the multicast address.

50. A storage system according to claim 47, wherein one of the storage nodes of the set is designated for managing queue operations for the set at any given time, wherein managing queue operations comprises enqueuing one or more tasks in the distributed queuing mechanism.

51. A storage system according to claim 47, wherein the storage nodes are assigned different roles for managing the queue operations, the roles including at least a primary that manages the processing of queued tasks by default and a secondary that manages the queue operations if the primary is unable to do so, wherein managing queue operations comprises managing the enqueuing of one or more tasks in the distributed queuing system.

52. A storage system according to claim 47, wherein each storage node of the set of storage nodes is assigned a color designation, and wherein the storage node is selected to process the task based at least in part upon the assigned color designations.

53. A storage system according to claim 47, wherein the storage node is selected to process the task based at least in part upon a hash performed on at least a portion of the task.

54. A storage system according to claim 51, wherein the storage node is selected to process the task by the primary node.

55. A storage system according to claim 47, wherein a duration of the queuing lease is based at least in part upon a size of the queued task.

56. A storage system according to claim 47, wherein the queuing lease comprises an identification of the task, an identification of the storage node acquiring the lease, a time of the lease, and a lease duration.

57. A storage system according to claim 47, wherein the one or more resource-intensive tasks comprises replicating file data.

58. A storage system according to claim 47, wherein the one or more resource-intensive tasks comprises replicating storage metadata.

59. A storage system according to claim 47, wherein the one or more resource-intensive tasks comprises resolving file data differences to ensure data consistency.