Abstract: A system, node and method for location aware mass information distribution to peers. The method includes overlaying a distributed hash table (DHT) network over an existing physical communication network to which the peers are connected, wherein the DHT network is a peer to peer (P2P) network; providing at least one application layer multicast (ALM) protocol over the overlayed DHT network to form an ALM tree topology for the peers, wherein the ALM tree topology is based on location information of the peers; using the ALM tree topology for establishing logical connections within a group, between a leader of the group and peers of the group; and using the overlayed DHT network for establishing connections, between the leader and the peers, to be followed by a message to be distributed to the peers.

Abstract: Methods and nodes for enabling a teleconference involving multiple peer nodes in a P2P network (502). A first peer node (500) appoints a subset of the peer nodes to act as Floor Control Peers, FCPs, (504) in a floor control overlay by handling floor requests from peer nodes to make input to a floor in the teleconference. The first peer node (500) creates a tree structure (506) of the appointed FCPs which is distributed to the P2P network and can be accessed by a joining peer node to discover a primary FCP in the tree and send floor requests to the primary FCP. A floor chair function (508) is also created in the floor control overlay maintaining a floor record (508a) with information about floor utilization which can be provided to the FCPs. Thereby, joining peer nodes are enabled to join the teleconference and find respective primary FCPs in the floor control overlay based on the tree structure, and to make input to the at least one floor of the teleconference depending on the information in the floor record.

Abstract: Methods and nodes for enabling and producing input generated by speech of a user, to an application. When the application has been activated (2:1), an application node (200) detects (2:2) a current context of the user and selects (2:3), from a set of predefined contexts (204a), a predefined context that matches the detected current context. The application node (200) then provides (2:4) keywords associated with the selected predefined context to a speech recognition node (202). When receiving (2:5) speech from the user, the speech recognition node (202) is able to recognize (2:6) any of the keyword in the speech. The recognized keyword is then used (2:7) as input to the application.

Abstract: A method and message server (204) for routing a speech message, received (2:1) from a user equipment (200) of a sending user, to at least one recipient (208, 210) in a communication network. After obtaining (2:2) a text version created by speech recognition (206) of the received speech message, the at least one recipient is identified (2:3) by the message server based on the obtained text version, and the speech message is then routed (2:5) to the identified at least one recipient.

Abstract: System and method for balancing a number of incoming connections of nodes connected to a peer-to-peer network. The method includes receiving at a selecting node information about out-finger candidates. The information includes at least a quantifiable parameter for the out-finger candidates and the out-finger candidates are possible nodes to be connected to the selecting node. The method includes calculating in the selecting node, for each node of the out-finger candidates, a probability value by using a predetermined probability function that uses as input the corresponding quantifiable parameter; and selecting one node from the out-finger candidates to be an out-finger node for the selection node based on the probability value. The probability value is associated with a number of in-finger connections to the selected out-finger node.

Abstract: The present invention relates to the supervision of transactions in peer-to-peer (P2P) overlay networks. A P2P overlay network often consists of peers interconnected via different access technologies having significant different round-trip time (RTT) delays. Current time supervisions of retransmissions and transactions in P2P networks have fixed values. This has the disadvantages that if the timer values are too short, unnecessary retransmissions are performed although a response would be on its way. If the timer values are too long it results in unnecessarily long messaging delays. These disadvantages have been overcome by a method and a peer for adapting the timer values to the conditions in the P2P overlay network.

Abstract: An overlay network node is arranged to provide robust reply routing for requests and replies travelling over the network. Each node comprises first means which forwards each request originating in a source node and destined for destination node. The node comprises second means which redirect replies if the node from which the corresponding requests were received is no long accessible. The reply is, for example, turned into a request containing the reply as its payload and is returned towards the source node according to the rules used for forwarding the requests.

Abstract: A method of managing a ring-based overlay network that is configured to allow routing of messages across an underlying IP network to destinations not specified by an IP address. The method comprises firstly sending a probe message from an initiating node of the overlay network around the ring, with each peer node forwarding the probe message to a successor or predecessor node. Upon detection of a forwarding failure at a node of the ring, a Probe error message is sent from that node to the initiating node. The initiating node represents the final destination for the Probe message.

Abstract: An overlay network, node and application for load balanced service discovery. The application includes the steps of implementing the service discovery mechanism in the DHT P2P overlay network for finding a peer (1100) that provides a desired service; a step of adding to a record structure (50) of the service discovery mechanism a maximum capacity parameter Cmax (54) and a currently used capacity parameter Ccurrent (56); and a step of removing from the tree (10) a record of the peer (1110) that provides the desired service when the currently used capacity reaches a predetermined capacity so that the peer is not contacted by other service clients.

Abstract: Apparatus for relaying packets between a first host and a second host and methods for sending packets between a first and second host are provided. The apparatus includes a memory for registering for the first host the following information: a relayed address of the first host, an address of the second host, and an outbound higher layer identifier and/or an inbound higher layer identifier. The apparatus further includes an outbound packet inspector for inspecting packets received from the first host and addressed to an address of the apparatus to determine whether they contain a registered outbound higher layer identifier and, if so, for forwarding the packets to the address of the second host and/or an inbound packet inspector for inspecting packets received from the second host and addressed to the relayed address to determine whether they contain a registered inbound higher layer identifier and, if so, for forwarding the packets to the address of the first host.

Abstract: A method of maintaining routing tables at nodes of an overlay network, where a routing table of a given node contains, for each of a set of neighboring successor and predecessor nodes, a mapping between an overlay network address of the node and a physical locator of the node. The method comprises, upon or immediately prior to departure of a node from the overlay network, sending a Leave request from the departing node (or one of the neighboring nodes of the departing node aware of the departure) to each neighboring node (or each other neighboring node of the departing node), indicating the departure and containing one or more mappings for nodes not contained within the routing table of the recipient node. Each neighboring node (or each other neighboring node) receives the Leave request and uses said mapping(s) to update its routing table.

Abstract: A system and method for event notification and access control for Distributed Hash Tables (DHTs) using an event triggering mechanism for DHT-based Peer-to-Peer (P2P) overlay networks is described. According to an embodiment of the invention, a user interested in certain event can insert a trigger into the DHT. When the event occurs, the trigger fires and causes a pre-defined action to be executed. According to another embodiment of the invention, a user peer inserts a trigger resource record, which includes instructions to execute a specified action upon occurrence of the event, into the DHT. A monitored resource record, with which the event is or will be associated, is identified. A monitoring peer, responsible for maintaining the monitored resource record, is then identified. The trigger resource record is maintained at the monitoring peer.

Abstract: An overlay network, node and method for adaptive service discovery. The method uses an adaptive service discovery in the overlay network for finding a peer that provides a desired service; generates a tree structure for current peers that provide the desired service; assign the current peers that provide the desired service to different levels of the tree structure; estimate, when a peer intends to register for the desired service with the adaptive service discovery, a number S of actual peers that provide the desired service; and calculates, based on the estimated number of actual peers providing the desired service, an optimal starting level for the peer to register for the desired service.

Abstract: The present invention relates to methods and arrangements for locating services in a structured peer-to-peer distributed hash table, DHT, based, overlay communication network (310). The invention comprises two inter-related methods and nodes. The first method is used by a service node (321) to “advertise” to the overlay network (310) that it is providing a particular service (S1). This is done by distributing instances (351,352,353) of a service object (O1) that are stored in different nodes (331,332,333) in the overlay network (310) and where the instances (351,352,353) comprise an address to the service node (321). The other method is to locate at least one of these instances (351,352,353) with a predetermined probability and with a predetermined number of location request messages (390) from a user node (311) wishing to use the particular service (S1).

Abstract: System and method for balancing a number of incoming connections of nodes connected to a peer-to-peer network. The method includes receiving at a selecting node information about out-finger candidates. The information includes at least a quantifiable parameter for the out-finger candidates and the out-finger candidates are possible nodes to be connected to the selecting node. The method includes calculating in the selecting node, for each node of the out-finger candidates, a probability value by using a predetermined probability function that uses as input the corresponding quantifiable parameter; and selecting one node from the out-finger candidates to be an out-finger node for the selection node based on the probability value. The probability value is associated with a number of in-finger connections to the selected out-finger node.

Abstract: A system, node and method for location aware mass information distribution to peers. The method includes overlaying a distributed hash table (DHT) network over an existing physical communication network to which the peers are connected, wherein the DHT network is a peer to peer (P2P) network; providing at least one application layer multicast (ALM) protocol over the overlayed DHT network to form an ALM tree topology for the peers, wherein the ALM tree topology is based on location information of the peers; using the ALM tree topology for establishing logical connections within a group, between a leader of the group and peers of the group; and using the overlayed DHT network for establishing connections, between the leader and the peers, to be followed by a message to be distributed to the peers.

Abstract: An overlay network, node and method for adaptive service discovery. The method uses an adaptive service discovery in the overlay network for finding a peer that provides a desired service; generates a tree structure for current peers that provide the desired service; assign the current peers that provide the desired service to different levels of the tree structure; estimate, when a peer intends to register for the desired service with the adaptive service discovery, a number S of actual peers that provide the desired service; and calculates, based on the estimated number of actual peers providing the desired service, an optimal starting level for the peer to register for the desired service.

Abstract: The present invention relates to methods and arrangements for locating services in a structured peer-to-peer distributed hash table, DHT, based, overlay communication network (310). The invention comprises two inter-related methods and nodes. The first method is used by a service node (321) to “advertise” to the overlay network (310) that it is providing a particular service (S1). This is done by distributing instances (351,352,353) of a service object (O1) that are stored in different nodes (331,332,333) in the overlay network (310) and where the instances (351,352,353) comprise an address to the service node (321). The other method is to locate at least one of these instances (351,352,353) with a predetermined probability and with a predetermined number of location request messages (390) from a user node (311) wishing to use the particular service (S1).

Abstract: Embodiments herein include a method and apparatus for searching a structured peer-to-peer (P2P) network. A requesting node obtains a search term and generates a Bloom filter using the search term. The Bloom filter is sent to a searching node, which compares the received Bloom filter with at least one further Bloom filter stored at a database accessible by the searching node. The further Bloom filter is associated a further node in the P2P network. In the event that the Bloom filter and the further Bloom filter match, the searching node sends towards the requesting node an identity of the further node. This allows the requesting node to query the further node for the required data.

Abstract: This invention includes a method and a node (302) for locating objects in a structured overlay peer-to-peer network (500). Known distributed hash table DHT algorithms are not well suited for wild card searches. This problem has been solved by the current invention by using a node (302) configured with a finger table (310) and a stochastic selector (503) adapted to perform a stochastic search algorithm. In a preferred embodiment of the invention the stochastic search algorithm uses weighted probability values that are assigned to each established connection (312, 313, 314) between the node (302) and other nodes (303, 304, 305) in the overlay peer-to-peer network (500).