Parameterized recursive network architecture with topological addressing

• US 8,769,077 B2
• Filed: 12/21/2012
• Issued: 07/01/2014
• Est. Priority Date: 03/07/2003
• Status: Expired due to Term

• Current Assignee: TRIA Network Systems, LLC
• Original Assignee: TRIA Network Systems, LLC
• Inventors: Day, John D.
• Primary Examiner(s): Shin, Kyung H
• Application Number:
  US13/723,654
• Publication Number:
  US 20130097301A1
• Time in Patent Office: 557 Days
• Field of Search: 709/223, 709/230, 709/248, 340/389, 340/400, 340/469
• US Class Current: 709/223
• 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]

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:

defining, by a system including a processor, an address space comprising a set of strings having a topological structure;

defining, by the system, a mapping function with a range of the address space and a domain of a group of entities; and

assigning, by the system, respective addresses to the group of entities based on the mapping function, wherein the addresses assigned to the set of entities are topologically dependent,

wherein the group of entities is expandable in a repeatable manner to establish a recursive layered structure,

wherein the group of entities provides interprocess communication service resources to an adjacent layer of the recursive layered structure,

wherein the group of entities is partitioned into subsets of entities,

wherein a first entity in a first subset of the subsets of entities communicates with a second entity in the first subset using an address that is selected from the address space,

wherein the first entity in the first subset is assigned an address from the address space that is unique within the first subset,

wherein the mapping function includes assigning addresses corresponding to nodes of a tree structure to addressable entities, and

wherein a composition of each address uniquely identifies a position of a node in the tree structure.

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

3. The method of claim 1, wherein the mapping function is based on a topology having a distance function d(a, b), where d is the distance function, and a and b are assigned addresses having the following properties:

d(a, b)≧

0 for all values of a and b;

d(a, b)=0 if and only if a=b;

d(a, b), d(b, a); and

d(a, c)≦

d(a, b)+d(b, c).

4. The method of claim 3, wherein an orientation is associated with the address spaces.

5. The method of claim 1, wherein the recursive layered structure includes outgoing communications links operable to carry messages, and wherein the addresses comprise destination addresses, and further comprising:

generating a table of addresses to be assigned, wherein all messages to be sent to a group of destination addresses in proximity to each other are routed on a same outgoing link.

6. The method of claim 5, further comprising storing routes associated with messages and destinations, and wherein a number of the routes that need to be stored is reduced to only a group of routes of a local sub-network.

7. The method of claim 6, further comprising determining the routes based on knowledge of topologically-dependent addresses.

8. The method of claim 1, wherein an upper layer of the recursive layered structure obtains interprocess communication services from a lower layer of the recursive layered structure without utilizing knowledge of addresses of the lower layer and further comprising:

maintaining, by the system, routing information to be constant in a core subnet associated with the recursive layered structure unless a failure is detected.

9. The method of claim 1, wherein a number of addressable elements within the subsets of entities remains substantially constant as a number of the network entities increases due to network expansion.

10. A non-transitory computer-readable storage medium comprising computer instructions which, responsive to being executed by a processor, cause the processor to perform operations comprising:

defining a mapping function, wherein the mapping function is defined with a range of an address space and a domain of a group of entities; and

assigning addresses to the group of entities based on the mapping function, wherein the addresses assigned to the group of entities are topologically dependent,

wherein the group of entities is expandable in a repeatable manner to establish a recursive layered structure,

wherein the group of entities provides interprocess communication service resources to an adjacent layer of the recursive layered structure,

wherein the group of entities is partitioned into subsets of entities, wherein a first entity of a first subset of the subsets of entities communicates with other entities in the first subset using an address that is selected from the address space,

wherein each entity in the first subset is assigned an address from the address space that is unique within the first subset,

wherein the subsets of entities represents layers of the recursive layered structure,

wherein first addresses in a first layer of the recursive layered structure are assigned based on being related to second addresses in an immediately adjacent second layer of the recursive layered structure using a topological mapping between the first and second layers, and

wherein the mapping function includes assigning addresses corresponding to a geographical location to addressable entities, and

wherein a composition of each address uniquely identifies a location associated with an addressable entity.

11. The non-transitory computer-readable storage medium of claim 10, wherein the operations further comprise:

defining the address space that comprises a set of strings having a topological structure.

12. The non-transitory computer-readable storage medium of claim 10, wherein the defining of the mapping function further comprises defining the mapping function to include the properties of a topology between address spaces in adjoining layers, such that the upper layer forms a covering of a collection of lower subnets or layers.

13. The non-transitory computer-readable storage medium of claim 10, wherein an orientation is associated with the address space and wherein a number of addressable elements within the subsets of entities remains substantially constant as a number of the group of entities increases due to network expansion.

14. The non-transitory computer-readable storage medium of claim 10, wherein an upper layer of the recursive layered structure obtains interprocess communication services from a lower layer of the recursive layered structure without utilizing knowledge of addresses of the lower layer.

15. The non-transitory computer-readable storage medium of claim 10, wherein the mapping function is based on a table containing a plurality of addresses in the first and second layers and including connectivity information and is performed utilizing a mathematical relationship that preserves a direction property.

16. A system comprising:

a memory comprising computer instructions; and

a controller coupled with the memory, wherein the controller, responsive to executing the computer instructions, performs operations comprising;

defining an address space comprising a set of strings having a topological structure;

defining a mapping function, wherein the mapping function is based on a range of the address space and a domain of a group of entities; and

assigning addresses to the group of entities based on the mapping function, wherein the addresses assigned to the group of entities are topologically dependent,

wherein the group of entities is expandable in a repeatable manner to establish a recursive layered structure,

wherein the group of entities provides interprocess communication service resources to an adjacent layer of the recursive layered structure,

wherein the group of entities is partitioned into subsets of entities, wherein each entity in a first subset communicates with other entities in the first subset using an address that is selected from the address space,

wherein each entity in the first subset is assigned an address from the address space that is unique within the first subset,

wherein the subsets of entities represent layers of the recursive layered structure, and

wherein the mapping function includes assigning addresses corresponding to nodes of a tree structure to addressable entities, and

wherein a composition of each address uniquely identifies a position of a node in the tree structure.

17. The system of claim 16, wherein first addresses in a first layer of the recursive layered structure are assigned based on being related to second addresses in an immediately adjacent second layer of the recursive layered structure using a topological mapping between the first and second layers, and wherein a number of addressable elements within the subsets of entities remains substantially constant as a number of the entities increases due to network expansion.

18. The system of claim 17, wherein the mapping function is based on a table containing addresses in the first and second layers and including connectivity information and is performed utilizing a mathematical relationship that preserves a direction property for some nodes of a network.

19. The system of claim 16, wherein an orientation is associated with the address space.

20. The system of claim 16, wherein an upper layer of the recursive layered structure obtains interprocess communication services from a lower layer of the recursive layered structure without utilizing knowledge of addresses of the lower layer.