SYNCHRONIZING PEER NODES OF A MULTI-CHASSIS SWITCHING CLUSTER

• US 20160308962A1
• Filed: 04/17/2015
• Published: 10/20/2016
• Est. Priority Date: 04/17/2015
• Status: Active Grant

• Current Assignee: Extreme Networks, Inc.
• Original Assignee: Avaya Incorporated
• Inventors: HEGDE, Ramachandra, GURUSIMHA, Vinay
• Granted Patent: US 10,447,778 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: H04L 67/1095 Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes

Abstract

Implementations generally relate to synchronizing peer nodes in networks. In one embodiment, a method includes generating a data sequence number. The method also includes associating the data sequence number with a data item. The method also includes sending the data item and the data sequence number to each peer node of a plurality of peer nodes. The method also includes determining if an acknowledgment has been received from each peer node, wherein each acknowledgment indicates the peer node that sent the acknowledgment and indicates the data sequence number. The method also includes resending the data item and the data sequence number to one or more peer nodes based on a predetermined policy.

Claims

1. A method comprising:

generating a data sequence number;

associating the data sequence number with a data item;

sending the data item and the data sequence number to each peer node of a plurality of peer nodes;

determining if an acknowledgment has been received from each peer node, wherein each acknowledgment indicates the peer node that sent the acknowledgment and indicates the data sequence number; and

resending the data item and the data sequence number to one or more peer nodes based on a predetermined policy.

2. The method of claim 1, wherein the sending of the data item and the data sequence number is based on a connectivity fault management protocol.

3. The method of claim 1, wherein the predetermined policy comprises resending the data item and the data sequence number to a particular peer node if an acknowledgment from the given particular peer node is not received within a predetermined time period.

4. The method of claim 1, wherein the predetermined policy comprises resending the data item and the data sequence number to a particular peer node in response to receiving a request for the data item from the particular peer node.

5. The method of claim 1, generating a list of data sequence numbers of peer nodes, wherein the list includes a latest data sequence number for each peer node.

6. The method of claim 1, further comprising sending the data sequence number in a type-length-value message.

7. The method of claim 1, wherein the sending of the data item is a part of a synchronization process.

8. A computer program product comprising a computer-readable medium including program instructions to be implemented by a device connected to a communication network, the program instructions for:

generating a data sequence number;

associating the data sequence number with a data item;

sending the data item and the data sequence number to each peer node of a plurality of peer nodes;

determining if an acknowledgment has been received from each peer node, wherein each acknowledgment indicates the peer node that sent the acknowledgment and indicates the data sequence number; and

resending the data item and the data sequence number to one or more peer nodes based on a predetermined policy.

9. The computer program product of claim 8, wherein the sending of the data item and the data sequence number is based on a connectivity fault management protocol.

10. The computer program product of claim 8, wherein the predetermined policy comprises resending the data item and the data sequence number to a particular peer node if an acknowledgment from the given particular peer node is not received within a predetermined time period.

11. The computer program product of claim 8, wherein the predetermined policy comprises resending the data item and the data sequence number to a particular peer node in response to receiving a request for the data item from the particular peer node.

12. The computer program product of claim 8, wherein the program instructions are further implemented for generating a list of data sequence numbers of peer nodes, wherein the list includes a latest data sequence number for each peer node.

13. The computer program product of claim 8, wherein the program instructions are further implemented for sending the data sequence number in a type-length-value message.

14. The computer program product of claim 8, wherein the program instructions are further implemented for sending of the data item is a part of a synchronization process.

15. A device comprising:

a memory; and

at least one processor operative to access the memory and perform operations comprising;

generating a data sequence number;

associating the data sequence number with a data item;

sending the data item and the data sequence number to each peer node of a plurality of peer nodes;

determining if an acknowledgment has been received from each peer node, wherein each acknowledgment indicates the peer node that sent the acknowledgment and indicates the data sequence number; and

resending the data item and the data sequence number to one or more peer nodes based on a predetermined policy.

16. The device of claim 15, wherein the sending of the data item and the data sequence number is based on a connectivity fault management protocol.

17. The device of claim 15, wherein the predetermined policy comprises resending the data item and the data sequence number to a particular peer node if an acknowledgment from the given particular peer node is not received within a predetermined time period.

18. The device of claim 15, wherein the predetermined policy comprises resending the data item and the data sequence number to a particular peer node in response to receiving a request for the data item from the particular peer node.

19. The device of claim 15, wherein the at least one processor is further operative to perform operations comprising generating a list of data sequence numbers of peer nodes, wherein the list includes a latest data sequence number for each peer node.

20. The device of claim 15, wherein the at least one processor is further operative to perform operations comprising sending the data sequence number in a type-length-value message.