Patent application number | Description | Published |
20100226289 | FLOOR CONTROL IN TELECOMMUNICATIONS CONFERENCE CALLS - A method of enabling a user terminal to participate in floor control operations in a telecommunications conference operating a Binary Floor Control Protocol, BFCP. The method includes sending a first message from the user terminal to a gateway node. The first message includes information relating to floor control operations in the conference. The first message is inter-worked at the gateway node to generate a corresponding BFCP message. The BFCP message is forwarded to a Floor Control function. | 09-09-2010 |
20100329268 | Overlay Network Node And Overlay Networks - An overlay network node ( | 12-30-2010 |
20110110269 | Maintaining Distributed Hash Tables In An Overlay Network - 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 neighbouring 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 neighbouring nodes of the departing node aware of the departure) to each neighbouring node (or each other neighbouring 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 neighbouring node (or each other neighbouring node) receives the Leave request and uses said mapping(s) to update its routing table. | 05-12-2011 |
20110205949 | Routing Mechanism for Distributed Hash Table Based Overlay Networks - A node for use within an overlay network, such as a Distributed Hash Table based overlay network, and which is configured to route packets across the overlay network. The node comprises means for making a routing decision based upon a knowledge of the power consumption levels and/or power availability of a set of peer nodes in the overlay network. | 08-25-2011 |
20120099599 | Method and Apparatus for Relaying Packets - 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. | 04-26-2012 |
20120158756 | Searching in Peer to Peer Networks - 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. | 06-21-2012 |
20120197962 | METHOD AND ARRANGEMENT FOR LOCATING SERVICES IN A PEER-TO-PEER NETWORK - 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 ( | 08-02-2012 |
20120198051 | Adaptive Service Discovery in Structured Peer-to-Peer Overlay Networks and Method - 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. | 08-02-2012 |
20120271895 | LOCATION AWARE MASS INFORMATION DISTRIBUTION SYSTEM AND METHOD - 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. | 10-25-2012 |
20130064090 | Load Balancing Method and System for Peer-To-Peer Networks - 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. | 03-14-2013 |