Siemens Aktiengesellschaft

Unify Gmbh Co. Kg

Steffen Rusitschka

Henning Sanneck

Alan Southall

Thomas Hanna

Christian Scheering

Christoph Gerdes

Thorsten Laux

Sebnem Rusitschka

Sebastian Dippl

Stefan Berndt

Michael Berger

Joachim Sokol

Sebnem Öztunali

Dieter Olpp

Michael Niebergall

Sebnem ÖZtunali

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.

Method for operating a local area data 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.

Method for transmitting a message, network node and network

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.

Scalable peer-to-peer network with a directory service

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.

Method for operating a decentralized data network

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.

Monitoring condition of network with distributed components

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.

Method for distributing resources to network nodes in a decentralized data network

Growing community of inventors

Munich, Germany

Steffen Rusitschka