APPARATUS AND METHOD FOR SYNCHRONIZED NETWORKS

• US 20120030360A1
• Filed: 01/25/2011
• Published: 02/02/2012
• Est. Priority Date: 01/26/2010
• Status: Active Grant

• Current Assignee: Ray W. Sanders
• Original Assignee: Ray W. Sanders
• Inventors: Sanders, Ray W.
• Granted Patent: US 8,635,347 B2
• Time in Patent Office: Days
• US Class Current: 709/227
• 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 45/24 Multipath
• CPC Class Codes: H04L 45/245 Link aggregation, e.g. trunking
• CPC Class Codes: H04L 69/22 Parsing or analysis of headers
• 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/321 Interlayer communication protocols or service data unit [SDU] definitions; Interfaces between layers
• CPC Class Codes: H04L 7/0079 Receiver details
• CPC Class Codes: Y02D 30/50 in wire-line communication networks, e.g. low power modes or reduced link rate

Abstract

An apparatus and method for network routing is provided. Synchronized networks are disclosed which enable fast connection set up and release in a tiered hierarchy of circuit switched nodes. Nodes in the network aggregate and disaggregate data according to a transform algorithm allowing for dynamic frame and frame segment sizing. Connections within the network are organized by paired connections performing aggregation and disaggregation according to control vectors.

Claims

1. A method of network routing from a network entry node, comprising

Receiving network communications from a plurality of external devices, each network communication directed to a destination node;

aggregating the network communications into a plurality of paths, each path comprising a portion of the networking communications associated with a single destination node and composed of a plurality of path frames, the path frames synchronized with the single destination node and including a plurality of path cellets composed of path data;

further aggregating the plurality of paths into a plurality of superpaths, each superpath comprising the portion of the plurality of paths associated with a single intermediate node and composed of a plurality of superpath frames, the superpath frames synchronized with the intermediate node and including a plurality of superpath cellets composed of superpath data; and

transporting the plurality of superpaths to a transport node;

wherein the path cellets and superpath cellets may be dynamically sized.

2. The network routing method of claim 1, wherein the path cellets and superpath cellets have different sizes.

3. The networking routing method of claim 2, wherein the path cellets and superpath cellets can be sized at one bit, either alone or simultaneously.

4. The network routing method of claim 2, wherein the plurality of superpaths are transported to the intermediate nodes via a plurality of transmission routes.

5. The network routing method of claim 2, wherein the cellets are dynamically sized by transmitting control vectors indicative of the cellet size and a frame on which the cellet size will be dynamically sized.

6. A method of network data routing at an entry node, comprising

receiving networking communications from an external device, the networking communications designating an exit node,

establishing a paired connection with the exit node by passing control vectors to the exit node, the connection including a bandwidth,

maintaining the paired connection with the exit node, the maintenance including adjusting the bandwidth according to the received networking communications,

aggregating the networking communication from the external device into an aggregated data stream, the aggregated data stream comprising implicitly addressed frames, the implicitly addressed frames synchronized to the exit node,

wherein the control vectors passed to the exit node include data indicative of disaggregating the implicitly addressed frames, such that disaggregation of the aggregated data stream is performed by the paired connection at the exit node.

7. The method of claim 6, wherein the paired connection can have a bandwidth of zero.

8. The method of claim 6, wherein the networking communications comprise packets, each packet including an addressing header, and wherein the aggregating step comprises stripping the addressing header from the networking communications;

and wherein the control vectors include information to reconstitute the addressing header at the exit node.

9. The method of claim 6, wherein the aggregated data stream is one of a plurality of aggregated data streams, each aggregated data stream associated with an exit node and further comprising the steps of

aggregating the plurality of data streams into an intermediate data stream, the intermediate data stream associated with an intermediate data node, wherein the intermediate data node is a parent node of the exit nodes associated with the plurality of data streams,

establishing and maintaining a paired connection with the intermediate data node, the paired connection with the intermediate data node including information indicative of disaggregating the intermediate data stream.

10. A network transit node, comprising

a plurality of links each corresponding to a network entry node of a plurality of network entry nodes, each of the plurality of links transferring a source data stream to the network transit node, the source data stream comprising an aggregation of a plurality of origin superpaths, each origin superpath associated with a destination transit node of a plurality of destination transit nodes, and each origin superpath comprising an aggregation of paths from the network entry node to a plurality of destination exit nodes;

a plurality of source data stream disaggregation switches, each disaggregation switch receiving a source data stream from a link of the plurality of links to network entry nodes, and each source data stream disaggregation switch configured to disaggregate the plurality of origin superpaths from each source data stream;

a plurality of crossconnect switches, each crossconnect switch corresponding to a unique destination transit node of the plurality of destination transit nodes, each crossconnect switch configured to

receive the origin superpaths associated with the destination transit node corresponding to the crossconnect switch,

disaggregate the origin superpaths to recover the paths from the network entry nodes to the destination exit nodes,

aggregate the paths from the network entry nodes to the destination exit nodes to form destination superpaths, each destination superpath comprising paths from a plurality of entry nodes to a single destination node associated with the unique destination transit node;

a plurality of transfer node aggregation switches, each transfer node aggregation switch configured to aggregate a plurality of destination superpaths associated with a destination transit node to form a transit data stream;

a plurality of outbound links configured to transfer each transit data stream to the plurality of destination transit nodes.

11. The network transit node of claim 10, wherein each of the plurality of links receives control vectors from the plurality of entry nodes, the control vectors including data indicative of disaggregation information.

12. The network transit node of claim 11, wherein the control vectors further include information indicative of bandwidth adjustment requests from the entry nodes.

13. The network transit node of claim 10, wherein the network transit node provides synchronization information to the plurality of network entry nodes to synchronize the transit node with the plurality of network entry nodes.

14. The network transit node of claim 10, wherein at least one of the plurality of the transit data streams is transmitted by more than one of the plurality of outbound links.

15. The network transit node of claim 10, wherein the aggregation and disaggregation is performed by a synchronized, implicitly addressed transform algorithm.