IP Library Granted Patent US 10,951,481
Granted Patent B2
US 10,951,481 · App. 16/725,653 · Granted Mar 16, 2021

Position parameterized recursive network architecture with topological addressing

Inventor: John D. Day (Foxboro, MA)
Assignee: Tria Network Systems, LLC
H04L41/0896H04L29/12311H04L41/00H04L41/145H04L41/147H04L41/5025H04L45/00H04L47/10H04L47/12H04L47/193H04L47/21H04L47/2416H04L49/90H04L61/10H04L61/2061H04L61/2084H04L65/1069H04L65/605H04L69/06H04L69/08H04L69/24H04L69/32H04L69/325H04L69/329H04Q3/0054H04Q3/0095H04W40/248H04W80/04H05K999/99G06F21/10H04L67/2823H04L67/306H04L67/42H04W8/087H04W8/26
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,951,481
App. No.
16/725,653
Granted
Mar 16, 2021
Kind
B2
Abstract

A digital data communications network that supports efficient, scalable routing of data and use of network resources by combining a recursive division of the network into hierarchical sub-networks with repeating parameterized general purpose link communication protocols and an addressing methodology that reflects the physical structure of the underlying network hardware. The sub-division of the network enhances security by reducing the amount of the network visible to an attack and by insulating the network hardware itself from attack. The fixed bandwidth range at each sub-network level allows quality of service to be assured and controlled. The routing of data is aided by a topological addressing scheme that allows data packets to be forwarded towards their destination based on only local knowledge of the network structure, with automatic support for mobility and multicasting. The repeating structures in the network greatly simplify network management and reduce the effort to engineer new network capabilities.

Claims (28)

1. A method, comprising:

initiating, by a processing system including a processor, a shared state between communicating entities, wherein a data transfer relationship between the communicating entities represents an interprocess communication service (IPC) between the communicating entities to facilitate transfer of data, wherein the communicating entities are of a network of entities operable in accordance with a network protocol, wherein each function of the network protocol is separated into a mechanism and a policy that provides a relaying and multiplexing protocol and an error and flow control protocol that facilitate, either alone or in a combination of a layered organization, data transfer services; and

expanding, by the processing system, the network of entities in a repeatable manner to establish a recursive layered structure, wherein a first one of the communicating entities facilitates providing a first IPC resource to a first adjacent layer of the recursive layered structure.

2. The method of claim 1 , wherein the shared state is synchronized between the communicating entities.

3. The method of claim 1 , wherein the policy of each function of the network protocol includes a sending policy and a receiving policy.

4. The method of claim 1 , further comprising determining, by the processing system, instances of policy components of the policy of each function of the network protocol upon initiation of the shared state between the communicating entities.

5. The method of claim 1 , further comprising facilitating, by the processing system, data transfer protocols and application protocols.

6. The method of claim 1 , further comprising separating, by the processing system, functions of applications into mechanism and policy.

7. The method of claim 6 , wherein the functions of applications that are separated are application specific functions in a data transfer portion of a protocol.

8. The method of claim 1 , wherein a plurality of first addresses in a given layer of the recursive layered structure are assigned based on being related to a plurality of second addresses in an immediately adjacent layer of the recursive layered structure using a topological mapping between the given layer and the immediately adjacent layer.

9. The method of claim 1 , wherein separation of the mechanism and the policy facilitates an implementation of a protocol machine comprising a first portion and a second portion that are substantially independent, wherein the first portion contains substantially no policy, and the second portion contains substantially all policy.

10. The method of claim 1 , further comprising facilitating, by the processing system, a connectionless relaying protocol.

11. The method of claim 1 , wherein the relaying and multiplexing protocol comprises tightly bound functions and the error and flow control protocol comprises loosely bound functions.

12. A system, comprising:

a processing system including a processor; and

a memory that stores executable instructions that, when executed by the processing system, facilitate performance of operations, the operations comprising:

initiating a shared state between communicating entities, a data transfer relationship being initiated between the communicating entities in accordance with the shared state, wherein the data transfer relationship between the communicating entities represents an interprocess communication service (IPC) between the communicating entities operable in accordance with a network protocol to facilitate transfer of data, wherein each function of the network protocol is separated into a mechanism and a policy to provide a single relaying and multiplexing protocol and a single error and flow control protocol that facilitate data transfer services; and

repeatedly expanding a network of entities of which the communicating entities are a part to establish a recursive layered structure, wherein a given one of the communicating entities facilitates providing an IPC resource to an adjacent layer of the recursive layered structure.

13. The system of claim 12 , wherein the operations further comprise creating the shared state between the communicating entities.

14. The system of claim 13 , wherein the shared state is synchronized between the communicating entities.

15. The system of claim 12 , wherein instances of policy components are negotiated for each function of the network protocol.

16. The system of claim 12 , wherein the communicating entities are identified as data flow end points.

17. The system of claim 12 , wherein a message, operable to be exchanged between the communicating entities to coordinate behavior of the communicating entities and to facilitate a transfer of data, includes abstract syntax language translated into bit patterns.

18. A method, comprising:

initiating, by a processing system including a processor, a shared state between communicating entities, a data transfer relationship being initiated between the communicating entities in accordance with the shared state and representing an interprocess communication service (IPC) between the communicating entities operable in accordance with a network protocol to facilitate transfer of data, wherein each function of the network protocol is separated into a mechanism and a policy to provide a relaying and multiplexing protocol and an error and flow control protocol that facilitate, either alone or in a combination of a layered organization, data transfer services; and

expanding, by the processing system, a network of entities of which the communicating entities are a part in a repeatable manner to establish a recursive layered structure, wherein a given one of the communicating entities facilitates providing an IPC resource to an adjacent layer of the recursive layered structure.

19. The method of claim 18 , further comprising creating, by the processing system, the shared state between the communicating entities, wherein the communicating entities are identified as data flow end points.

20. The method of claim 18 , wherein one or more messages, operable to be exchanged between the communicating entities to facilitate a transfer of data, are further operable to be exchanged to coordinate behavior of the communicating entities.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 15, 2025
From: TRIA NETWORK SYSTEMS, LLC
To: CALIBRATE NETWORKS LLC
Reel/Frame 072576/0205 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 22, 2020
From: NETNOSTICS, INC.
To: TRIA NETWORK SYSTEMS, LLC
Reel/Frame 051582/0625 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 22, 2020
From: DAY, JOHN
To: NETNOSTICS, INC.
Reel/Frame 051665/0143 →
Continuity (9)
Continuation 16151697 · Oct 4, 2018
Continuation 15678721 · Aug 16, 2017
Continuation 15015531 · Feb 4, 2016
Continuation 14281051 · May 19, 2014
Continuation 13723654 · Dec 21, 2012
Continuation 13329724 · Dec 19, 2011
Continuation 10546018
Provisional Application 60452812 · Mar 7, 2003
Related Publication 20200136914A1 · Apr 30, 2020