Next generation network for providing diverse data types

• US 20070104096A1
• Filed: 05/25/2006
• Published: 05/10/2007
• Est. Priority Date: 05/25/2005
• Status: Abandoned Application

• Current Assignee: LGA Partnership
• Original Assignee: LGA Partnership
• Inventors: Ribera, Patrick
• Application Number:
  US11/440,454
• Publication Number:
  US 20070104096A1
• Time in Patent Office: Days
• US Class Current: 370/229
• CPC Class Codes: H04L 12/1881 with schedule organisation, e.g. priority, sequence management
• CPC Class Codes: H04L 2101/604 Address structures or formats
• CPC Class Codes: H04L 43/0817 by checking functioning
• 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/16 Multipoint routing
• CPC Class Codes: H04L 45/22 Alternate routing
• CPC Class Codes: H04L 45/28 using route fault recovery
• CPC Class Codes: H04L 45/302 Route determination based on requested QoS
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• CPC Class Codes: H04L 47/11 Identifying congestion
• CPC Class Codes: H04L 47/12 Avoiding congestion; Recovering from congestion
• CPC Class Codes: H04L 47/122 by diverting traffic away from congested entities
• CPC Class Codes: H04L 47/15 in relation to multipoint traffic arrangements for broadcast or multicast in data networks H04L12/18
• CPC Class Codes: H04L 47/2408 for supporting different services, e.g. a differentiated services [DiffServ] type of service
• CPC Class Codes: H04L 47/2416 Real-time traffic
• CPC Class Codes: H04L 47/2458 Modification of priorities while in transit
• CPC Class Codes: H04L 61/35 involving non-standard use of addresses for implementing network functionalities, e.g. coding subscription information within the address or functional addressing, i.e. assigning an address to a function
• CPC Class Codes: H04L 61/5069 for group communication, multicast communication or broadcast communication

Abstract

A data-processing network based on a new Internet protocol features a modified addressing system, a novel routing method, resolution of congestion problems in the routers, differentiated transport of data, real-time videos and communications, a multicast system to distribute real-time videos, and data transport with quality of services. The network uses homogeneous network protocol to transport multi-cast, real-time stream, and file data over the same network and to provide multiple qualities of service. Multi-packets may be unpacked at any node for predictive and reactive congestion control and dynamic packet routing. Specifically, a network node updating adjacent nodes with its congestion status, so that each node dynamically routes data away from any congested nodes and prioritizes higher quality of service traffic. In routing data, paths not stored in data packets, but instead, paths are dynamically recomputed around congestion or failed nodes and multicast data is routed using bread crumb trail techniques.

Claims

1. An improved method for transporting data packets of multi-cast, real-time stream, and file data over a computer network comprising a plurality of nodes, the improvement comprising the step of defining a homogeneous network protocol and defining distinct qualities of service, respectively, to the multi-cast, the real-time stream, and the file data.

2. The improved method of claim 1 further comprising the step of unpacking multi-packets at each nodes in the computer network.

3. The improved method of claim 1 further comprising the step of dynamic data packet routing between the nodes.

4. The improved method of claim 3 further comprising the step of employing congestion control.

5. The improved method of claim 4, where in the congestion control comprises each of the nodes forwarding a congestion status to adjacent nodes, and each of nodes routing received data away from a congested node.

6. The improved method of claim 5 wherein the nodes prioritizes higher quality of service traffic during the employing of the congestion control.

7. The improved method of claim 3 wherein a data path is not stored in data packets.

8. The improved method of claim 7 wherein the data path is dynamically recomputed around congestion or failed nodes.

9. The improved method of claim 1 further comprising the step of Multicast data routing using a bread crumb trail.

10. A method of dynamic congestion control on computer network comprising a plurality of nodes, the method comprising each of the node forwarding an associated congestion status to adjacent nodes, and each of nodes routing data away from any nodes having a positive congestion status.

11. The method of claim 10 further comprising the steps of defining a homogeneous network protocol and defining distinct qualities of service, respectively, to the multi-cast, the real-time stream, and the file data.

12. The method of claim 11 wherein the nodes prioritizes higher quality of service traffic during the employing of the congestion control.

13. The method of claim 11 wherein a data path is not stored in data packets.

14. The method of claim 13 wherein the data path is dynamically recomputed around congestion or failed nodes.

15. The method of claim 13 further comprising the step of Multicast data routing using a bread crumb trail.

16. The method of claim 13 further comprising the step of unpacking multi-packets unpacked nodes in the computer network.

17. The method of claim 16 further comprising the step of dynamic data packet routing between the nodes.

18. An improved network data packet header comprising a data type field.

19. The improved network data packet header of claim 18 further comprising a quality of service field.

20. The improved network data packet header of claim 18 further comprising a sub-type field.

21. The improved network data packet header of claim 18 further comprising a next area type field.

22. The improved network data packet header of claim 18 further comprising a maximum hops field.