POSITION PARAMETERIZED RECURSIVE NETWORK ARCHITECTURE WITH TOPOLOGICAL ADDRESSING

• US 20200136914A1
• Filed: 12/23/2019
• Published: 04/30/2020
• Est. Priority Date: 03/07/2003
• Status: Active Grant

• Current Assignee: TRIA Network Systems, LLC
• Original Assignee: TRIA Network Systems, LLC
• Inventors: Day, John D.
• Granted Patent: US 10,951,481 B2
• Time in Patent Office: Days
• CPC Class Codes: G06F 21/10 Protecting distributed programs or content, e.g. vending or licensing of copyrighted material protection in video systems or pay television H04N7/16 ; Digital rights management [DRM]
• CPC Class Codes: H04L 41/00 Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
• CPC Class Codes: H04L 41/0896 Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities flow or congestion control using dynamic resource allocation, e.g. in-call renegotiation, H04L47/76
• CPC Class Codes: H04L 41/145 involving simulating, designing, planning or modelling of a network
• CPC Class Codes: H04L 41/147 for predicting network behaviour
• CPC Class Codes: H04L 41/5025 by proactively reacting to service quality change, e.g. by reconfiguration after service quality degradation or upgrade
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• CPC Class Codes: H04L 47/12 Avoiding congestion; Recovering from congestion
• CPC Class Codes: H04L 47/193 at the transport layer, e.g. TCP related
• CPC Class Codes: H04L 47/21 using leaky-bucket
• CPC Class Codes: H04L 47/2416 Real-time traffic
• CPC Class Codes: H04L 49/90 Buffering arrangements
• CPC Class Codes: H04L 61/10 of different types
• CPC Class Codes: H04L 61/5061 Pools of addresses
• CPC Class Codes: H04L 61/5084 Providing for device mobility network addressing or numbering for mobility support in wireless networks H04W8/26; mobile IP H04W80/04
• CPC Class Codes: H04L 65/1069 Session establishment or de-establishment
• CPC Class Codes: H04L 65/765 intermediate
• CPC Class Codes: H04L 67/01 Protocols
• CPC Class Codes: H04L 67/306 User profiles
• CPC Class Codes: H04L 67/565 : Conversion or adaptation of application format or content adding application control or application functional data H04L67/561
• CPC Class Codes: H04L 69/06 : Notations for structuring of protocol data, e.g. abstract syntax notation one [ASN.1]
• CPC Class Codes: H04L 69/08 : Protocols for interworking; Protocol conversion
• CPC Class Codes: H04L 69/24 : Negotiation of communication capabilities
• CPC Class Codes: H04L 69/32 : Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
• CPC Class Codes: H04L 69/325 : in the network layer [OSI layer 3], e.g. X.25 H04L69/16 takes precedence
• CPC Class Codes: H04L 69/329 : in the application layer [OSI layer 7]
• CPC Class Codes: H04Q 3/0054 : Service creation techniques
• CPC Class Codes: H04Q 3/0095 : Specification, development or application of network management software, e.g. software re-use
• CPC Class Codes: H04W 40/248 : Connectivity information update
• CPC Class Codes: H04W 8/087 : for preserving data network PoA address despite hand-offs
• CPC Class Codes: H04W 8/26 : Network addressing or numbering for mobility support
• CPC Class Codes: H04W 80/04 : Network layer protocols, e.g. mobile IP [Internet Protocol]
• CPC Class Codes: H05K 999/99 : dummy group

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

1. A method, comprising:

initiating, by a processing system including a processor, a shared state between communicating entities, a data transfer relationship between the communicating entities to represent 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 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, 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 c facilitate a transfer of data, are further operable to be exchanged to coordinate behavior of the communicating entities.