Alcatel Lucent

Dimitri Tombroff

Jean-François Rey

Pierre De Rop

Thierry Godfroid

Stephane Coste

Yves Millon

François Leygues

Communication element (E) comprising at least one interface with a communication network (N) containing other communication elements (E), and a peer-to-peer network (N) 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.

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

A peer-to-peer network including a set of nodes distributed among a set of processing devices and arranged in a circular form in such a way that each node has a unique successor node. Each node has a memory to store data associated with keys and, on reception of a request containing a key, provides data associated with the key. Each data item stored in the memory of a first node is duplicated in the memory of a second node, different from said first node. The second node is chosen from among the nodes deployed on the set of processing devices different from the processing device on which the first node is deployed.

A method for restarting a set of nodes forming a peer-to-peer network. The method includes determining a first node of the set of nodes to be restarted and a subset of nodes known to the first node. Each node in the set of nodes to be restarted, prior to restarting, is configured to select a node and transmitting a message to the known nodes, containing an identifier of the selected node. Upon receiving the message, each known node is configured to back up duplicate sessions by determining sessions duplicated between the known node and the node in the set of nodes to be restarted and duplicating the sessions determined to be duplicate and verifying whether the known node is the next node, based on the message's content, and if the known node is the next node selecting the known node as a next node to be restarted.

Growing community of inventors

Nozay, France

Dimitri Tombroff