Abstract: 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 (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240). The successor list (L) specifies identifiers of at least two successor nodes (211, 223) subsequently succeeding a first node (200) of the plurality of nodes (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240) with regard to a topology structure of the peer-to-peer overlay network. It is determined whether the at least two successor nodes (211, 223) listed in the successor list (L) run on the same physical hardware.

Abstract: In an embodiment of a method of encoding a data identifier, the data identifier is one of a plurality of data identifiers of a data network. Each of the data identifiers includes a string of characters. An occurrence probability table is provided which indicates for defined components of the plurality of data identifiers a frequency of occurrence within the plurality of data identifiers. The components are defined based on one or more characteristics of the plurality of data identifiers. Based on the occurrence probability table, the data identifier is encoded according to a variable length encoding algorithm.

Abstract: A first router sends to neighboring routers an interest packet associated with the at least one service including a service name indicator and a unique interest tag. A second router receives the interest packet, sends the interest packet to a server of the at least two servers and stores the interest tag together with the incoming and outgoing connection port in its interest route table. The server attaches data including load data of the at least one service to the interest packet and sends the interest packet back to the second router. The second router calculates service performance data based on the data attached, stores the service performance data in its service performance table and updates the routing table based on an evaluation of the service performance data, and sends the interest packet via its incoming connection port as associated by the interest route table to the first router.

Abstract: An exemplary communication device includes a node having a processor configured to instantiate a service at the node responsive to the processor determining that the node is a superior instantiation candidate relative to a next upstream node on a downstream path of the service. An exemplary method of communicating includes instantiating a service at a node responsive to the node determining that the node is a superior instantiation candidate relative to a next upstream node on a downstream path of the service.

Abstract: Embodiments of the invention concern a method of redundant data storage in a peer-to-peer overlay network (N), and a network node (211) and a computer program product to execute said method. The peer-to-peer overlay network (N) comprises a plurality of nodes (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240). A physical hardware on which a first node (211) of said plurality of nodes (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240) runs is identified. At least one second node (240) of said plurality of nodes (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240) which runs on a different physical hardware than the first node (211) is determined.

Abstract: 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.

Abstract: 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 (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240). The successor list (L) specifies identifiers of at least two successor nodes (211, 223) subsequently succeeding a first node (200) of the plurality of nodes (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240) with regard to a topology structure of the peer-to-peer overlay network. It is determined whether the at least two successor nodes (211, 223) listed in the successor list (L) run on the same physical hardware.

Abstract: Embodiments of the invention concern a method of redundant data storage in a peer-to-peer overlay network (N), and a network node (211) and a computer program product to execute said method. The peer-to-peer overlay network (N) comprises a plurality of nodes (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240). A physical hardware on which a first node (211) of said plurality of nodes (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240) runs is identified. At least one second node (240) of said plurality of nodes (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240) which runs on a different physical hardware than the first node (211) is determined.

Abstract: The invention concerns a method of determining a routing path in a peer-to-peer overlay network (N), and a network node (20) and a computer program product to execute said method. The peer-to-peer overlay network (N) comprises a plurality of nodes (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240). A physical hardware on which a first node (20) of said plurality of nodes (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240) runs is identified. At least one second node (112, 211) of said plurality of nodes (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240) which runs on the same physical hardware as the first node (20) is identified. A data set specifying an identifier of said at least one second node (112, 211) is generated. Said data set is stored as a zero-path table associated with the first node (20). When determining said routing path, said data set is accessed and a link (ZL1, ZL2) between said first node (20) and said at least one second node (112, 211) based on said zero-path table is selected.

Abstract: 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.

Abstract: A method of self-organizing distributing services of a telecommunication network comprising the steps of invoking a service from a client through the telecommunication network by discovering a server providing the service and serving received requests by the server, the method further comprising the steps of deploying the server inside one or more peers of a distributed peer to peer platform, and discovering and performing a service invocation by means of the peer-to-peer platform. The invention also relates to an apparatus, i.e. service system, and a computer software product therefor.