Scalable transport with cluster-consensus rendezvous

• US 9,385,875 B2
• Filed: 12/03/2013
• Issued: 07/05/2016
• Est. Priority Date: 01/23/2013
• Status: Active Grant

• Current Assignee: Nexenta by DDN, Inc.
• Original Assignee: Nexenta Systems Incorporated (DataDirect Networks Incorporated)
• Inventors: Bestler, Caitlin, Novak, Robert E., Aizman, Alexander
• Primary Examiner(s): Daftuar, Saket K
• Application Number:
  US14/095,855
• Publication Number:
  US 20140207850A1
• Time in Patent Office: 945 Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/00 Information retrieval; Database structures therefor; File system structures therefor
• CPC Class Codes: G06F 9/46 Multiprogramming arrangements
• CPC Class Codes: H04L 12/18 for broadcast or conference , e.g. multicast
• CPC Class Codes: H04L 12/185 with management of multicast group membership
• CPC Class Codes: H04L 12/1854 with non-centralised forwarding system, e.g. chaincast
• CPC Class Codes: H04L 12/1877 Measures taken prior to transmission
• CPC Class Codes: H04L 47/15 in relation to multipoint traffic arrangements for broadcast or multicast in data networks H04L12/18
• CPC Class Codes: H04L 67/06 specially adapted for file transfer, e.g. file transfer protocol [FTP]
• 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]
• CPC Class Codes: H04L 69/164 Adaptation or special uses of UDP protocol

Abstract

Embodiments disclosed herein provide advantageous methods and systems that use multicast communications via unreliable datagrams sent on a protected traffic class. These methods and systems provide effectively reliable multicast delivery while avoiding the overhead associated with point-to-point protocols. Rather than an exponential scaling of point-to-point connections (with expensive setup and teardown of the connections), the traffic from one server is bounded by linear scaling of multicast groups. In addition, the multicast rendezvous disclosed herein creates an edge-managed flow control that accounts for the dynamic state of the storage servers in the cluster, without needing centralized control, management or maintenance of state. This traffic shaping avoids the loss of data due to congestion during sustained oversubscription. Other embodiments, aspects and features are also disclosed.

Claims

1. A method of putting a chunk of payload data in a cluster of storage servers using unreliable datagrams, the method comprising:

performing a cryptographic hash of the chunk to generate a content hash identifier for the chunk;

selecting a negotiating group for the chunk by mapping the content hash identifier to a distributed hash allocation table;

multicasting a put proposal from an initiating client to the storage servers in the cluster that are in the negotiating group for the chunk;

in response to the put proposal, multicasting a put accept response from each of the storage servers in the negotiating group to all other storage servers in the negotiating group;

evaluating the put accept responses by each of the storage servers in the negotiating group to determine members of a rendezvous group and select which storage server in the negotiating group is to send a consensus put accept to the initiating client;

receiving the consensus put accept by the initiating client; and

multicasting the payload data of the chunk from the initiating client to the rendezvous group to perform the rendezvous transfer.

2. The method of claim 1, wherein the evaluating is consistent between the storage servers in the negotiating group.

3. The method of claim 1, wherein the rendezvous group is a non-empty subset of the negotiating group.

4. The method of claim 1,

wherein said evaluating of the put accept responses by each storage server in the negotiating group also determines a designated time and a designated transmission rate for the rendezvous transfer, and

wherein the rendezvous transfer is performed by the initiating client muiticasting the payload of the chunk to the rendezvous group at the designated time at the designated transmission rate.

19. The method of claim 1, further comprising:

validating successful transfer of the chunk using the content hash identifier.

5. A method of getting a chunk of payload data from a cluster of storage servers using unreliable datagrams, the method comprising:

performing a cryptographic hash of the chunk to generate a content hash identifier for the chunk;

selecting a negotiating group for the chunk by mapping the content hash identifier to a distributed hash allocation table;

multicasting a get request from an initiating client to the storage servers in the cluster that are in the negotiating group for the chunk;

in response to the get request, multicasting a get response from each of the storage servers in the negotiating group to all other storage servers in the negotiating group; and

evaluating the get responses by each of the storage servers in the negotiating group to determine a designated storage server that is to perform a rendezvous transfer to a rendezvous group;

multicasting a get accept from the initiating client to the negotiating group, wherein the get accept indicates the designated storage server; and

performing the rendezvous transfer by the designated storage server.

6. The method of claim 5, wherein the rendezvous group includes at least the initiating client, which is a chunk sink, that initiated the chunk get transaction.

7. The method of claim 6, wherein the rendezvous group further includes a storage server that volunteers to store the chunk.

8. The method of claim 5, wherein the rendezvous transfer is performed at a designated time at a designated transmission rate.

20. The method of claim 5, further comprising:

validating successful transfer of the chunk using the content hash identifier.

21. The method of claim 5, wherein the chunk is an named chunk, and the get request comprises a name hash identifier to identify the chunk, and the get response comprises both the name hash identifier and the content hash identifier.

22. The method of claim 5, wherein the chunk is an unnamed chunk, and both the get request and the get response each comprises the content hash identifier to identify the chunk.

9. A system that stores a chunk of payload data using unreliable datagrams, the system comprising:

a cluster of storage servers;

a network of non-blocking switches communicatively interconnecting the storage servers of the cluster; and

an initiating client comprising a client system that communicatively interconnects to the network,

wherein the initiating client multicasts a put proposal to the storage servers of the cluster that are in a negotiating group for the chunk, the negotiating group being selected by mapping a content hash identifier to a distributed hash allocation table,

wherein each of the storage servers in the negotiating group multicast put accept responses to the all the other storage servers in the negotiating group,

wherein each of the storage servers in the negotiating group evaluates the put accept responses to determine members of a rendezvous group and select which storage server in the negotiating group is to send a consensus put accept to the initiating client,

wherein the consensus put accept is received by the initiating client, and

wherein the rendezvous transfer is performed by the initiating client multicasting the payload data of the chunk to the rendezvous group.

10. The system of claim 9, wherein the evaluating is consistent between the storage servers in the negotiating group.

11. The system of claim 9, wherein the rendezvous group is a non-empty subset of the negotiating group.

12. The system of claim 9, wherein the put accept responses are evaluated by each storage server in the negotiating group to determine a designated time and a designated transmission rate for the rendezvous transfer.

18. The system of claim 9, wherein at least a portion of the payload data is delivered using bandwidth from a reserved traffic class, and the put proposal specifies a maximum delivery rate.

13. A system that retrieves a chunk of payload data using unreliable datagrams, the system comprising:

a cluster of storage servers;

a network of non-blocking switches communicatively interconnecting the storage servers of the cluster; and

an initiating client comprising a client system that communicatively interconnects to the network,

wherein the initiating client multicasts a get request to the storage servers of the cluster that are in a negotiating group for the chunk, the negotiating group being selected by mapping a content hash identifier to a distributed hash allocation table,

wherein each of the storage servers in the negotiating group multicast get responses to the all the other storage servers in the negotiating group,

wherein each of the storage servers in the negotiating group evaluates the get responses to select a designated storage server in the negotiating group to perform a rendezvous transfer to a rendezvous group, and

wherein the rendezvous transfer is performed by the designated storage server.

14. The system of claim 13, wherein the rendezvous group includes at least the initiating client, which is a chunk sink, that initiated the chunk get transaction.

15. The system of claim 14, wherein the rendezvous group further includes a storage server that volunteers to store the chunk.

16. The system of claim 13, wherein the rendezvous transfer is performed by the designated storage server at a designated time at a designated transmission rate.

17. A method of storing a chunk of payload data by a storage server within a cluster of storage servers using unreliable datagrams, the method comprising:

receiving a multicast put proposal from an initiating client by the storage server of a negotiating group, wherein the negotiating group is determined by mapping a content hash identifier to a distributed hash allocation table;

multicasting a proposal response from the storage server to other storage servers in the negotiating group; and

receiving proposal responses by the storage server from the other storage servers in the negotiating group;

evaluating the proposal responses by the storage server to determine a members of a rendezvous group and select which storage server in the negotiating group is to send a consensus put accept to the initiating client;

sending the consensus put accept to the initiating client if the storage server is selected; and

receiving a multicast of the payload data of the chunk from the initiating client if the storage server is a member of the rendezvous group.