Alcatel Lucent

Nico Schwan

Marco Tomsu

Thomas Strauss

Jurgen Sienel

Marcus Kessler

Shashank Shanbhag

The invention concerns a method of providing a successor list (L) for routing in a peer-to-peer overlay network (N), and a network node and a computer program product to execute this method. The peer-to-peer overlay network (N) comprises a plurality of nodes (). The successor list (L) specifies identifiers of at least two successor nodes () subsequently succeeding a first node () of the plurality of nodes () with regard to a topology structure of the peer-to-peer overlay network. It is determined whether the at least two successor nodes () listed in the successor list (L) run on the same physical hardware. If the at least two successor nodes () run on the same physical hardware, an identifier of at least one additional node () of the plurality of nodes () which succeeds the at least two successor nodes () with regard to the topology structure of the peer-to-peer overlay network (N) and runs on a different physical hardware than the at least two successor nodes () is added to the successor list (L).

Method of providing a successor list

Embodiments of the invention concern a method of redundant data storage in a peer-to-peer overlay network (N), and a network node () and a computer program product to execute said method. The peer-to-peer overlay network (N) comprises a plurality of nodes (). A physical hardware on which a first node () of said plurality of nodes () runs is identified. At least one second node () of said plurality of nodes () which runs on a different physical hardware than the first node () is determined. A replica () of data for which the first node () is responsible is stored on the at least one second node () in addition to or instead of storing a replica () of the data on a next logical node () of the first node, whereby said next logical node () is a node of the plurality of nodes () neighboring the first node () with regard to a topology structure of the peer-to-peer overlay network (N).

Method of redundant data storage

A method for retrieving content of a distributed directory of a telecommunication system comprising a plurality of nodes arranged in a directed ring topology, the method comprising the steps of identifying a storage location of said content by means of a distributed hashing function, where the hashing function maps an element onto a node, where the node is responsible carrying elements with a hash value between the node and its successor node. The invention further concerns a corresponding computer software product, telecommunication device, and a telecommunication system.

Growing community of inventors

Stuttgart, Germany

Nico Schwan