Fault-tolerance mechanism optimized for peer-to-peer network

• US 20090313375A1
• Filed: 06/10/2009
• Published: 12/17/2009
• Est. Priority Date: 06/11/2008
• Status: Active Grant

• Current Assignee: RPX Corporation
• Original Assignee: Alcatel-Lucent SA (Nokia Corporation)
• Inventors: De Rop, Pierre, Tombroff, Dimitri
• Granted Patent: US 9,294,559 B2
• Time in Patent Office: Days
• US Class Current: 709/226
• CPC Class Codes: H04L 41/0893 Assignment of logical groups to network elements
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1046 Joining mechanisms
• CPC Class Codes: H04L 69/40 for recovering from a failure of a protocol instance or entity, e.g. service redundancy protocols, protocol state redundancy or protocol service redirection management of faults, events, alarms or notifications in data switching networks H04L41/06

Abstract

Communication element (E₂) comprising at least one interface with a communication network (N_TEL) containing other communication elements (E₁), and a peer-to-peer network (N_p2p) for processing requests (Req) from the other communication elements, consisting of nodes (N₁, N₂, N₃, N₄, N₅) distributed among a set of processing devices and arranged in a circle. It is associated with a management device comprising admission means to insert a new node within the peer-to-peer network. The communication element is intended so that contextual information used for processing said requests can be stored in the nodes and is characterized in that the admission means are intended to determine a pair of adjacent nodes deployed on a same processing device and to insert the new node between the two nodes of the pair.

Claims

1. Management device for a peer-to-peer network comprising a set of nodes distributed among a set of processing devices and arranged in a circle so that each node has a unique successor node, said management device being configured to insert a new node within said peer-to-peer network, to determine a pair of adjacent nodes deployed on the same processing device and to insert said new node between the two nodes of said pair.

2. Management device according to the previous claim, in which said management device is an admission component implemented by a different device to said nodes.

3. Management device according to claim 1, in which said management device is an admission component implemented by all or some of said nodes.

4. Communication element comprising at least one interface with a communication network containing other communication elements, and a peer-to-peer network for processing requests from said other communication elements, said peer-to-peer network consisting of nodes distributed among a set of processing devices and arranged in a circle so that each node has a unique successor node, and associated with a management device configured to insert a new node within said peer-to-peer network, said communication element being intended to ensure that said nodes store contextual information used to process said requests and characterized in that said management device is also intended to determine a pair of adjacent nodes deployed on the same processing device and to insert said new node between the two nodes of said pair.

5. Communication element according to the previous claim, in which said contextual information is duplicated in the successor nodes.

6. Communication element according to claim 4, in which said management device is an admission component implemented by a different device to said nodes.

7. Communication element according to claim 4, in which said management device is an admission component implemented by all or some of said nodes.

8. Communication element according to claim 4, in which said interface with a communication network is suitable for sending signaling messages compliant with the SIP protocol.

9. Communication network comprising a communication element according to claim 4.