Patent application number | Description | Published |
20080261521 | Monitoring Condition of Network with Distributed Components - In a system having distributed components arranged in a logical ring structure, each component monitors only their respective neighboring component in the structure and the condition of the neighboring component is determined. If a component determines a condition of its neighboring component that corresponds to a predefinable condition, the component informs the other components of the system of the predefined condition of the neighboring component. | 10-23-2008 |
20080313317 | Network Management Using Peer-to-Peer Protocol - A method operates a network management system comprising nodes which are used as manager and/or agent nodes. At least one node communicates with at least one other node using a peer-to-peer protocol. A network management system and a node in a management network system are used to carry out said method. | 12-18-2008 |
20080320163 | Method for Transmitting a Message, Network Node and Network - A method allows message transmission in a peer-to-peer network using chord topology, in which some of the nodes have access protection which allows reception of messages only from those network addresses to which a message has previously been sent. A network such as this is dependent on each node maintaining a list with further nodes, referred to in general as a finger list. In order to allow communication despite access protection, each node sends a request at fixed time intervals to the nodes in its list, to send it a message. This makes it possible for each node to send messages to the nodes in its list. A search request for a file is passed on via intermediate nodes in the network such that the searching node is provided with access to a destination node which can offer the file, and the access protection of the destination node is cancelled. | 12-25-2008 |
20090028165 | Method for Operating a Decentralized Data Network - A decentralized data network contains a plurality of network nodes. The network nodes are able to direct requests into the data network with the aid of checking values. The network nodes are each assigned one or more table entries in a value table distributed between the network nodes, with each table entry containing a checking value and the data associated with the checking value. Each of the plurality of network nodes are monitored to determine the frequency with which requests for the checking values assigned to a respective network node are directed to the respective network nodes. If it is found that the frequency of the requests for one or more checking values to a respective network node exceeds a predetermined threshold value, at least the table entry or entries for this or these checking values is or are assigned to at least one other network node. | 01-29-2009 |
20090119386 | METHOD AND ARRANGEMENT FOR DATA TRANSMISSION BETWEEN PEER-TO-PEER NETWORKS - A method for data transmission between a first peer device (P | 05-07-2009 |
20100281165 | METHOD FOR THE LOAD DISTRIBUTION IN A PEER-TO-PEER-OVERLAY NETWORK - A method provides for the even load distribution in a peer-to-peer-overlay network having a plurality of peers, each having an associated keyword region. A data resource to be stored, the keyword thereof being within the keyword region of a peer, is only stored with said peer if the number of data resources stored there has not reached a resource threshold limit. | 11-04-2010 |
20120331143 | Method For Operating a Local Area Data Network - A method for operating a local area data network with a plurality of network nodes is disclosed, wherein the network nodes send requests to the data network using request values and each of the network nodes has an associated explicit identifier from a key space. A plurality of network nodes respectively has an associated one or more table entries in a value table distributed over the network nodes. In this case each table entry includes a request value having data associated with the key space and with the request value, the network node being responsible for a request value whose identifier is less than or equal to the request value. For the plurality of network nodes, the frequency with which requests for the request values associated with a respective network node are sent to the respective network node is respectively monitored. If it occurs that the frequency of the requests for one or more request values to a respective network node exceeds a predetermined threshold value then at least the table entry or entries for this or these request values are assigned to at least one other network node which is situated in a request path for the request. | 12-27-2012 |