# US 2012/0269096 A1 · Self-forming network

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

- Number: US 2012/0269096 A1
- Document ID: US20120269096A1
- Status: Published application
- Kind: A1
- Application number: 13/365,971
- Filed: 2012-02-03
- Published: 2012-10-25
- Earliest claimed: 2005-03-31
- Assignees: James A. Roskind
- Inventors: James Roskind
- Web page: https://patentgrep.com/patent/US20120269096A1

## CPC

- H04L 12/433: with asynchronous transmission, e.g. token ring, register insertion
- H04L 43/04: Processing captured monitoring data, e.g. for logfile generation
- H04L 43/10: Active monitoring, e.g. heartbeat, ping or trace-route
- H04L 67/10: in which an application is distributed across nodes in the network (software deployment G06F8/60; multiprogramming arrangements G06F9/46)
- H04L 67/1061: using node-based peer discovery mechanisms (static access to replicated servers H04L67/1006; service discovery H04L67/51)
- H04L 67/1065: {Discovery involving distributed pre-established resource-based relationships among peers, e.g. based on distributed hash tables [DHT] (pre-configuration of logical or physical connections H04L67/1053)}
- H04L 67/1068: {Discovery involving direct consultation or announcement among potential requesting and potential source peers}
- H04L 41/0803: Configuration setting
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A connected computer may be operated as node by inspecting communications from other nodes that pass through that node. From the communications, two or more pointers may be determined for the given node. These pointers may include a first pointer identified by a default designation that links the given node to a first node in the network, and a second pointer to another node. The second pointer may be identified by a determination that a designated criteria has been satisfied after the given node is placed on the network.

## Claims

### Claim 1

A method for operating a connected computer as a given node of a network, the method comprising:
determining a nodal location and a node classification for the given node;
identifying a nodal location of another node in a default pointer with the given node;
monitoring activity that passes through the node for information corresponding to a nodal path used to handle different communication requests involving other nodes in the network; and
from the activity, identifying at least one other node having a nodal location that satisfies a predefined criteria for a second pointer to the given node on the network, wherein the predefined criteria is used by at least all nodes in the network of the same node classification.

### Claim 2 (depends on 1)

The method of claim 1, wherein each node in the network is sequenced based on the nodal location of each node, and wherein identifying the nodal location of another node includes identifying the nodal location of a node that is next in sequence to the given node.

### Claim 3 (depends on 1)

The method of claim 1, wherein determining the node classification includes determining a node level, wherein the node level indicates a range of values for the nodal location of one or more other nodes in the network that satisfy the predefined criteria.

### Claim 4 (depends on 1)

The method of claim 1, wherein:
determining the nodal location includes determining the nodal location based on a hash value that is between a first limit value and a second limit value, and
determining the node classification includes defining a set of node levels for the network, wherein each node level in the set indicates a range of possible distances between nodes that is less than a distance between the first limit value and the second limit value.

### Claim 5 (depends on 4)

The method of claim 4, wherein determining the node classification includes selecting a node level from the set of node levels, where a size of the set is based on an estimated size of the network.

### Claim 6 (depends on 1)

The method of claim 1, wherein the predefined criteria corresponds to the at least one other node having a nodal location that is separated from the nodal location of the given node by a distance value that is within a given range.

### Claim 7 (depends on 6)

The method of claim 6, wherein the given range is bounded below by a lower bound distance that is the reciprocal of a base raised to the power of the nodal classification of the given node and bounded above by a constant multiple of the lower bound distance.

### Claim 8 (depends on 1)

The method of claim 1, wherein the method further comprises subsequent to identifying a second node having a second nodal location that satisfies the predefined criteria, monitoring the activity that passes through the given node to identify a third node having third nodal location that better satisfies the predefined criteria than the second node.
