# US 2020/0351187 A1 · Systems and methods of monitoring network devices

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

- Number: US 2020/0351187 A1
- Document ID: US20200351187A1
- Status: Published application
- Kind: A1
- Application number: 16/398,337
- Filed: 2019-04-30
- Published: 2020-11-05
- Earliest claimed: 2019-04-30
- Assignees: Google Inc.
- Applicants: Google LLC
- Inventors: Igor Naverniouk; Andre Knabben
- Web page: https://patentgrep.com/patent/US20200351187A1

## CPC

- H04L 43/0817: by checking functioning
- H04L 41/0893: Assignment of logical groups to network elements
- H04L 43/04: Processing captured monitoring data, e.g. for logfile generation
- H04L 43/0811: by checking connectivity
- H04L 43/10: Active monitoring, e.g. heartbeat, ping or trace-route
- H04L 43/14: {using software, i.e. software packages (network security related monitoring H04L63/1408)}
- H04L 43/16: Threshold monitoring
- H04L 61/3015: Name registration, generation or assignment
- H04L 63/1408: {by monitoring network traffic (monitoring network traffic per se H04L43/00)}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Implementations of the disclosed subject matter provide systems and methods of assigning, at a server, a unique identifier to each of a plurality of devices communicatively coupled to one another and the server via a communications network. Each unique identifier may be converted to a device hash key by applying a hash function. A range of device hash keys of the plurality of devices may be split into N approximately equal sectors, where N is a prime number and each sector includes 1/N of the device hash keys of the plurality of the devices. K monitoring workers provided by the server may monitor the plurality of devices in an order based on the respective device hash key, where K is an integer.

## Claims

### Claim 1

A method comprising:
assigning, at a server, a unique identifier to each of a plurality of devices, the plurality of devices being communicatively coupled to one another and to the server via a communications network;
converting, at the server, each unique identifier to a device hash key by applying a hash function;
splitting, at the server, a range of device hash keys of the plurality of devices into N approximately equal sectors, where N is a prime number and each sector includes 1/N of the device hash keys of the plurality of the devices;
providing, at the server, K monitoring workers to monitor the plurality of devices in an order based on the respective device hash key, where K is an integer.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
performing, by at least one of the K monitoring workers, a status check of one or more devices included in at least one of the N sectors.

### Claim 3 (depends on 2)

The method of claim 2, further comprising:
initiating a status check of the next device in the one of the N sectors before the completion of a status check of a current device of the plurality of devices when it is determined that the current device is inaccessible via the communications network or responding below a predetermined threshold.

### Claim 4 (depends on 2)

The method of claim 2, further comprising:
storing, at a database system communicatively coupled to the communications network, the determined state of the one or more devices.

### Claim 5 (depends on 4)

The method of claim 4, wherein the storing comprises:
storing the determined state of each of the plurality of devices to the database system when the determined state has changed from a previously-stored state.

### Claim 6 (depends on 2)

The method of claim 2, further comprising:
determining, using one of the K workers, which of the N sectors to perform the status checks.

### Claim 7 (depends on 6)

The method of claim 6, wherein the N sectors range from 0 to N−1, with the jth sector starting at hash key (2**64)/N*j+min(j,(2**64)% N) and includes (2**64)/N+j<(2**64)% N)) hash keys, wherein ** operator is a to the power of operator, min(x,y) is the minimum of two integers, a % operator is a remainder after division, a/operator is truncating integer division, and <operator is less than, which evaluates to 0 or 1, and
wherein the device hash keys are 64-bit integers.

### Claim 8 (depends on 7)

The method of claim 7, wherein a difference in size between a largest sector and a smallest sector of the N sectors is no greater than 1.

### Claim 9 (depends on 6)

The method of claim 6, wherein a frequency of the state checks performed by one of K workers for each device of the plurality of devices is P, which is a measure of time.

### Claim 10 (depends on 9)

The method of claim 9, wherein a number of K workers is from 0 to K−1, and
performing, at any given time t with worker number 0, the status checks of devices of sector number (t % (P*K))*N/(P*K), wherein % operator is a remainder after division.

### Claim 11 (depends on 10)

The method of claim 10, further comprising:
performing, using workers other than worker number 0, the status checks on sector number (t % ((P*i)*K))*N/((P*i)*K), where i is the worker number between 0 and K−1.

### Claim 12 (depends on 1)

The method of claim 1, wherein at least one of the plurality of devices is a gamelet virtual machine, the status of which is monitored by at least one of the K workers.

### Claim 13

A system comprising:
a plurality of devices communicatively coupled to one another via a communications network, wherein at least one device of the plurality of devices is a hardware device;
a server, communicatively coupled to the communications network, to assign a unique identifier to each of the plurality of devices, convert each unique identifier to a device hash key by applying a hash function, split a range of device hash keys of the plurality of devices into N approximately equal sectors, where N is a prime number and each sector includes 1/N of the device hash keys of the plurality of the devices, and provide K monitoring workers to monitor the plurality of devices in an order based on the respective device hash key, where K is an integer.

### Claim 14 (depends on 13)

The system of claim 13, wherein at least one of the K monitoring workers performs a status check of one or more devices included in at least one of the N sectors.

### Claim 15 (depends on 14)

The system of claim 14, further comprising:
initiating a status check of the next device in the one of the N sectors before the completion of a status check of a current device of the plurality of devices when it is determined that the current device is inaccessible via the communications network or responding below a predetermined threshold.

### Claim 16 (depends on 14)

The system claim 14, further comprising:
a database system, communicatively coupled to the communications network, to store the determined state of the one or more devices.

### Claim 17 (depends on 16)

The system of claim 16, wherein the determined state of each of the plurality of devices is stored in the database system when the determined state has changed from a previously-stored state.

### Claim 18 (depends on 14)

The system of claim 14, wherein one of the K workers determines which of the N sectors to perform the status checks.

### Claim 19 (depends on 18)

The system of claim 18, wherein the N sectors range from O to N−1, with the jth sector starting at hash key (2**64)/N*j+min (j,(2**64)% N) and includes (2**64)/N+(j<(2**64)% N)) hash keys, wherein ** operator is a to the power of operator, min(x,y) is the minimum of two integers, a % operator is a remainder after division, a/operator is truncating integer division, and <operator is less than, which evaluates to 0 or 1, and
wherein the device hash keys are 64-bit integers.

### Claim 20 (depends on 19)

The system of claim 19, wherein a difference in size between a largest sector and a smallest sector of the N sectors is no greater than 1.

### Claim 21 (depends on 18)

The system of claim 18, wherein a frequency of the state checks performed by one of K workers for each device of the plurality of devices is P, which is a measure of time.

### Claim 22 (depends on 21)

The system of claim 21, wherein a number of K workers is from 0 to K−1, and at any given time t, worker number 0 performs the status checks of devices of sector number (t % (P*K))*N/(P*K), wherein % operator is a remainder after division.

### Claim 23 (depends on 22)

The system of claim 22, wherein workers other than worker number 0 perform the status checks on sector number (t % ((P*i)*K))*N/((P*i)*K), where i is the worker number between O and K−1.

### Claim 24 (depends on 13)

The system of claim 13, wherein at least one of the plurality of devices is a gamelet virtual machine, the status of which is monitored by at least one of the K work\
