# US 2018/0324071 A1 · Automatic shared resource management system and associated methods

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2018/0324071 A1
- Document ID: US20180324071A1
- Status: Published application
- Kind: A1
- Application number: 15/589,767
- Filed: 2017-05-08
- Published: 2018-11-08
- Earliest claimed: 2017-05-08
- Assignees: Datalogic IP Tech S.R.L.
- Applicants: Datalogic IP Tech S.R.L.
- Inventors: Francesco D'Ercoli; Alessandro Brunetta; Giorgio Sanzeni
- Web page: https://patentgrep.com/patent/US20180324071A1

## CPC

- H04L 43/0876: Network utilisation, e.g. volume of load or congestion level
- H04L 41/142: using statistical or mathematical methods
- H04L 67/12: specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
- H04L 67/60: Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources (admission control or resource allocation H04L47/70)
- H04L 67/63: Routing a service request depending on the request content or context
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A system and method for managing a shared resource in a network including a plurality of nodes including, in response to joining the network, broadcasting, by a node, an identification message to the network, and receiving, by the node, a token data structure including computational data including a threshold total resource consumption value of the plurality of nodes, current resource consumption values of respective nodes, and current utility function values of the respective nodes, the computational data being used by the node to adjust consumption of the shared resource by the node.

## Claims

### Claim 1

A method for managing a shared resource in a network including a plurality of nodes, the method comprising:
in response to joining the network, broadcasting, by a node, an identification message to the network; and
receiving, by the node, a token data structure including computational data including a threshold total resource consumption value of the plurality of nodes, current resource consumption values of respective nodes, and current utility function values of the respective nodes, the computational data being used to adjust consumption of the shared resource by the node.

### Claim 2 (depends on 1)

The method according to claim 1, further comprising adjusting, by the node, consumption of the shared resource by the node, the adjusting including:
evaluating performance of the node by comparing a utility function of the node with utility functions of the other nodes with computational data included in the data structure;
measuring a current resource consumption of the node;
determining an actual resource consumption value of the nodes by combining a measured current resource consumption value of the node with stored resource consumption data of the other nodes that is read from the token data structure;
comparing the actual resource consumption value to the threshold total resource consumption value to create a delta resource consumption value being a difference between the actual resource consumption value and the threshold total resource consumption value read from the token data structure;
adjusting resource consumption of the node according to the utility function of the node;
writing a new resource consumption value of the node to the token data structure, the writing including replacing the stored resource consumption data of the node on the token data structure; and
transmitting the token data structure to a second node.

### Claim 3 (depends on 2)

The method according to claim 2, further comprising entering a standby state, by the node, when the measured current resource consumption value of the node falls below a minimum threshold required to operate the node, and wherein entering the standby state includes writing a value of zero for the utility function of the node to the token data structure.

### Claim 4 (depends on 3)

The method according to claim 3, further comprising updating, by the node, the token data structure while in the standby state.

### Claim 5 (depends on 2)

The method according to claim 2, wherein adjusting the resource consumption of the node includes applying a weight to determine an amount of resource consumption adjustment.

### Claim 6 (depends on 2)

The method according to claim 2, wherein adjusting the resource consumption of the node includes regulating at least one of a plurality of components of the node.

### Claim 7 (depends on 2)

The method according to claim 2, wherein adjusting consumption of the shared resource by the node is configured to occur within a designated amount of time.

### Claim 8 (depends on 7)

The method according to claim 7, wherein adjusting the resource consumption includes adjusting the resource consumption by the node once during the designated amount of time.

### Claim 9 (depends on 1)

The method according to claim 1, further comprising waiting for a first predetermined time in which the nodes are broadcasting the identification message, wherein a conclusion of the first predetermined time signals an end to setup time.

### Claim 10 (depends on 9)

The method according to claim 9, further comprising queuing any additional nodes that broadcast the identification message, the conclusion of the predetermined time to be added to the nodes at a second predetermined time.

### Claim 11 (depends on 1)

The method according to claim 1, further comprising adjusting the threshold resource consumption value.

### Claim 12

A node comprising:
an input/output (I/O) unit; and
a processing unit in electronic communication with the I/O unit, the processing unit configured to:
broadcast an identification message inclusive of an address;
receive a token data structure including data;
measure consumption of a shared resource to find a measured consumption; and
adjust consumption of the shared resource using the data and the measured consumption.

### Claim 13 (depends on 12)

The node of claim 12, wherein the processing unit adjusting consumption of the shared resource is based on the measured consumption being different than a target consumption of the shared resource.

### Claim 14 (depends on 12)

The node of claim 12, wherein the processing unit is further configured to:
write a new shared resource consumption value specific to the node to the token data structure; and
indicate to the I/O unit that the token data structure is ready for transmittal, the I/O unit being configured to transmit the token data structure in response to the processing unit.

### Claim 15 (depends on 14)

The node of claim 14, wherein the processing unit indicates to the I/O unit that the token data structure is ready for transmittal at a conclusion of a period of time, the period of time initiated by receiving the token data structure.

### Claim 16 (depends on 12)

The node of claim 12, wherein the shared resource is at least one of power and bandwidth.

### Claim 17 (depends on 12)

The node of claim 12, wherein the processing unit is further configured to transition the node in a standby state in response to the measured consumption of the shared resource by the node reaching a predetermined threshold.

### Claim 18 (depends on 12)

The node of claim 12, wherein the processing unit is further configured to receive at least two token data structures inclusive of different shared resources being managed by the nodes.

### Claim 19 (depends on 12)

The node of claim 12, wherein the processing unit being configured to adjust the resource consumption includes at least one of increasing resource consumption and decreasing resource consumption.