US 9,003,034 B2Granted

Method for operating a local area data network

AssigneeUnify GmbH & Co. KG

InventorsMichael Niebergall, Steffen Rusitschka, Alan Southall, Sebnem Rusitschka

Life of this patent

Estimating the term…

Loading patent…

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

Claims20

Dependent claims

A method for operating a network having a plurality of nodes, the nodes comprising a first node, a second node, a third node, and a fourth node, the first node being aware of a first subset of a topology of the network such that the first node knows less than all of the nodes of the network, the first subset comprising the second node, the second node being aware of a second subset of the topology of the network such that the second node knows less than all of the nodes of the network, the second subset comprising the third node, the third node being aware of a third subset of the topology of the network such that the third node knows less than all of the nodes of the network, the third subset comprising the fourth node, the method comprising:

searching the first subset, by the first node, to identify an identifier of a node within the first subset that is closest to a checking value of a resource;
determining, by the first node, that the identifier of the second node within the first subset is closest to the checking value;
sending a first request, by the first node, to the second node to request publication of the resource;
receiving, by the first node, a first response sent by the second node in response to the first request, the first response identifying the third node, the third node having an identifier that is closest to the checking value within the second subset;
sending a second request, by the first node, to the third node to request publication of the resource, the second request being sent after the first node receives the first response;
receiving, by the first node, a second response sent by the third node in response to the second request, the second response identifying the fourth node, the fourth node having an identifier within the third subset that is closest to the checking value;
sending a third request, by the first node, to the fourth node to request publication of the resource, the third request being sent after the first node receives the second response;
receiving, by the first node, a third response sent by the fourth node in response to the third request, the third response identifying the fourth node as having exceeded a threshold value for requests for publication of the resource;
sending a fourth request, by the first node, to the third node, the fourth request being sent after the first node receives the third response, the fourth request allocating the resource to the third node to publish the resource to the third node.

6 more elements

A network comprising:

a plurality of nodes that are communicatively connectable, the nodes comprising a first node, a second node, a third node, and a fourth node;
the first node being aware of a first subset of a topology of the network, the first subset comprising the second node;
the second node being aware of a second subset of the topology of the network, the second subset comprising the third node;
the third node being aware of a third subset of the topology of the network, the third subset comprising the fourth node;
the first node searching the first subset to identify an identifier of a node within the first subset that is closest to a checking value for a resource and determining that an identifier of the second node within the first subset is closest to the checking value;
the first node sending a first request to the second node to request publication of the resource;
the second node searching the second subset to identify an identifier of a node within the second subset that is closest to the checking value in response to the first request and determining that an identifier of the third node within the second subset is closest to the checking value, the second node sending a first response to the first node that identifies the third node,
the first node receiving the first response from the second node;
the first node sending a second request to the third node to request publication of the resource, the second request being sent after the first node receives the first response;
the third node searching the third subset to identify an identifier of a node within the third subset that is closest to the checking value in response to the second request and determining that the identifier of the fourth node within the third subset is closest to the checking value and the third node sending a second response to the first node that identifies the fourth node;
the first node receiving the second response;
the first node sending a third request to the fourth node to request publication of the resource, the third request being sent after the first node receives the second response;
the first node receiving a third response sent by the fourth node in response to the third request, the third response identifying the fourth node as having exceeded a threshold value for requests for publication of the resource;
the first node sending a fourth request to the third node, the fourth request being sent after the first node receives the third response, the fourth request allocating the resource to the third node to publish the resource to the third node.

11 more elements

A communication system comprising:

a plurality of nodes that are communicatively connectable, the nodes comprising a first node, a second node, a third node, and a fourth node;
the first node being aware of a first subset of a topology of the network, the first subset comprising the second node;
the second node being aware of a second subset of the topology of the network, the second subset comprising the third node;
the third node being aware of a third subset of the topology of the network, the third subset comprising the fourth node;
the first node configured to search the first subset to identify an identifier of a node within the first subset that is closest to a checking value for a resource and determine that an identifier of the second node within the first subset is closest to the checking value;
the first node configured to send a first request to the second node to request publication of the resource;
the second node configured to search the second subset to identify an identifier of a node within the second subset that is closest to the checking value in response to the first request and determine that an identifier of the third node within the second subset is closest to the checking value, the second node configured to send a first response to the first node that identifies the third node based on search results of the search of the second subset,
the first node configured to receive the first response from the second node;
the first node configured to send a second request to the third node to request publication of the resource, the second request to be sent after the first node receives the first response;
the third node configured to search the third subset to identify an identifier of a node within the third subset that is closest to the checking value in response to the second request and determine that the identifier of the fourth node within the third subset is closest to the checking value and the third node configured to send a second response to the first node that identifies the fourth node;
the first node configured to receive the second response;
the first node configured to send a third request to the fourth node to request publication of the resource, the third request to be sent after the first node receives the second response;
the first node configured to receive a third response sent by the fourth node in response to the third request, the third response identifying the fourth node as having exceeded a threshold value for requests for publication of the resource;
the first node configured to send a fourth request to the third node, the fourth request to be sent after the first node receives the third response, the fourth request allocating the resource to the third node to publish the resource to the third node.

11 more elements

Dependencies are inferred from the claim text.

Facts

Application: 12/309,546Filed 23 Jul 2007
Priority: DE 10 2006 034 15524 Jul 2006
Published: US 2012/0331143 A127 Dec 2012
Granted: 7 Apr 2015
Term ends: Not estimatedThe source records don’t support an estimate.

Classification12 codes

H04L 47/783
Architectures of resource allocation: distributed allocation of resources, e.g. bandwidth brokers
H04L 12/56
Store-and-forward switching systems: packet switching systems
H04L 67/10
Protocols: in which an application is distributed across nodes in the network
H04L 67/1008
Server selection for load balancing: based on parameters of servers, e.g. available memory or workload