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

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

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

Abstract: A method for creates a directory service in a scalable peer-to-peer-network, which is distributed to groups having at least one peer. In order to release a resource and to start a search enquiry for a resource, allocation values are formed using an allocation instruction according to the resource allocation values from a predefined address area. Only one group is responsible for each allocation value and the release of a resource or search enquiry for a resource is transmitted to the responsible group only.

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

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

Abstract: A method is disclosed for distribution of resources to network nodes in a decentralized data network. In at least one embodiment of the method keywords, which are allocated to digital resources, are mapped onto digital bit sequences. These bit sequences are modified, with the subsequent bits after a predetermined bit position, preferably being replaced by random bits. A mapping onto bit sequences is then undertaken with these modified bit sequences, with each network node being responsible for a specific range of values of indices. The resource will then be allocated the index which is produced by the mapping. The mapping in this case can be selected so that a wildcard search according to keywords is guaranteed. The outstanding feature of the method is that the resources are distributed evenly in the decentralized network and at the same time a fast wildcard search according to truncated keywords is made possible.

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

Abstract: A method for data transmission between a first peer device (P1) in a first peer-to-peer network (P2P1) and a target peer device (P2?) in a second peer-to-peer network (P2P2), where each peer device (P1, P1?, P2?) has a node address (NID1, NID1?, NID2?) in its respective peer-to-peer network (P2P1, P2P2) and a network address (IP1, IP1?, IP2?) in a superordinate communication network (IN), with a search request (S1) for the target peer device (P2?) being sent from the first peer-to-peer network (P2P1) to at least one second peer device (P1?) in the second peer-to-peer network (P2P2) with a statement indicating the network address (IP1) C of the first peer device (P1).

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

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

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

Abstract: A method is disclosed for distribution of resources to network nodes in a decentralized data network. In at least one embodiment of the method keywords, which are allocated to digital resources, are mapped onto digital bit sequences. These bit sequences are modified, with the subsequent bits after a predetermined bit position, preferably being replaced by random bits. A mapping onto bit sequences is then undertaken with these modified bit sequences, with each network node being responsible for a specific range of values of indices. The resource will then be allocated the index which is produced by the mapping. The mapping in this case can be selected so that a wildcard search according to keywords is guaranteed. The outstanding feature of the method is that the resources are distributed evenly in the decentralized network and at the same time a fast wildcard search according to truncated keywords is made possible.

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

Abstract: A method initializes and/or updates a data network, particularly a peer-to-peer network, with a number of computers. A computer identity is assigned to each computer and each computer is able to establish a data link to another computer. One or more keywords are stored in each computer that characterize the data stored on the respective computer.

Abstract: The invention relates to a method and an arrangement for registering a terminal device (EG1, EG2) on a communications node (KN1, KN2) in a communications network. A plurality of communications nodes (KN1, KN2) are disposed in the communications network, and the terminal device (EG1, EG2) is registered with one of the communications nodes (KN1, KN2). In a first step, the communications nodes (KN1, KN2) and their access parameters are registered in an information memory (DB). The terminal device (EG1, EG2) then accesses the information memory (DB), whereupon the transfer of the access parameters of at least one of the communications nodes (KN1, KN2) to the terminal device (EG1, EG2) takes place. Finally, the terminal device (EG1, EG2) is registered using the obtained access parameters with the one of these communications nodes (KN1, KN2).

Abstract: A method is for controlling an exchange in a data transmission system, in which information demand data from information demanders and information supply data representing information which can be supplied by various information suppliers are compared in order to ascertain corresponding information demand data and information supply data. After a successful preliminary comparison for particular minimum matches, the information demand data in question are first transmitted to a data comparison device associated with the information supplier in question for the purpose of a more detailed comparison with the information represented by the information supply data. Upon receipt of positive comparison result data from the data comparison device, indicating that the information which can be supplied matches the information demand data, the exchange then transmits corresponding search result data to a terminal belonging to the information demander.