Edge-to-edge traffic control for the internet

• US 20040037223A1
• Filed: 04/18/2003
• Published: 02/26/2004
• Est. Priority Date: 02/28/2001
• Status: Abandoned Application

• Current Assignee: Rensselaer Polytechnic Institute
• Original Assignee: Rensselaer Polytechnic Institute
• Inventors: Bagal, Prasad, Ramakrishanan, Sthanunathan, Kalyanaraman, Shiykumar, Harrison, David
• Application Number:
  US10/204,222
• Publication Number:
  US 20040037223A1
• Time in Patent Office: Days
• US Class Current: 370/235
• CPC Class Codes: H04L 45/50 using label swapping, e.g. multi-protocol label switch [MPLS]
• 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/18 End to end
• CPC Class Codes: H04L 47/21 using leaky-bucket
• CPC Class Codes: H04L 47/2408 for supporting different services, e.g. a differentiated services [DiffServ] type of service
• CPC Class Codes: H04L 47/30 in combination with information about buffer occupancy at either end or at transit nodes
• CPC Class Codes: H04L 47/31 by tagging of packets, e.g. using discard eligibility [DE] bits

Abstract

A new overlay apparatus and method to augment best-effort congestion control and Quality of Service in the Internet called edge-to-edge traffic control (FIG. 3) is disclosed. The basic architecture works at the network layer and involves pushing congestion back from the interior of a network, distributing across edge nodes (202, 206, FIG. 3) where the smaller congestion problems can be handled with flexible, sophisticated and cheaper methods. The edge-to-edge traffic trucking building blocks thus created can be used as basis of the several applications. These applicaitons include controlling TCP and non-TCP flows, improving buffer management scalability, developing simple differentiated services, and isolating bandwidth-based denial-of-service attacks. The methods are flexible, combinable with other protocols (like MPLS and diff-serv), require no standardization and can be quickly deployed.

Claims

1. A method for improving distributing traffic congestion at a node, said method comprising:

determining a congestion epoch occurring at a node by measuring the queue length at said node; and

redistributing congestion at said node to at least one other node at an edge of said node when said measured queue length at said node exceeds a predetermined threshold value in response to an output of an ingress node.

2. The method of claim 1, wherein said node determines said occurrence of said congestion epoch.

3. The method of claim 2, wherein said node marks a congestion bit on at least one packet when said measured queue length at said node exceeds a predetermined threshold value.

4. The method of claim 1, wherein said node determines an end to said occurrence of said congestion epoch.

5. The method of claim 1, wherein said node sends at least one control signal to one or more of said at least one other nodes to redistribute the congestion at said node.

6. The method of claim 5, wherein said other nodes comprise ingress edge nodes.

7. The method of claim 1, wherein said node is an interior node.

8. The method of claim 1, wherein said interior node is a router.

9. The method of claim 1, wherein a plurality of said other nodes on an edge of said node collectively detect said occurrence of said congestion epoch.

10. The method of claim 9, wherein said plurality of other nodes comprise egress nodes.

11. The method of claim 9, wherein a plurality of said other nodes collectively detect said occurrence of said congestion epoch when a prediction of said measured queue length at said node exceeds a predetermined threshold value of accumulation at all of said ingress edges.

12. The method of claim 11, wherein said plurality of other nodes comprise egress nodes.

13. The method of claim 1, wherein a plurality of said other nodes determine an end to said occurrence of said congestion epoch.

14. The method of claim 13, wherein said plurality of other nodes comprise egress nodes.

15. The method of claim 9, wherein said plurality of other nodes send at least one control signal to one or more of said ingress nodes to redistribute the congestion at said node.

16. The method of claim 15, wherein said plurality of other nodes comprise egress nodes.

17. A method for improving distributing traffic congestion at a network node for applying stateful mechanisms at the edges, said method comprising:

determining a congestion epoch occurring at a interior node of a network by measuring a queue length at said interior node; and

redistributing congestion at said interior node to at least one other node at an edge of said network when said measured queue length at said interior node exceeds a predetermined threshold value of said interior node in response to an output of an ingress node.

18. The method of claim 17, wherein said interior node determines said occurrence of said congestion epoch.

19. The method of claim 18, wherein said interior node marks a congestion bit on at least one packet when said measured queue length at said interior node exceeds a predetermined threshold value.

20. The method of claim 17, wherein said interior node determines an end to said occurrence of said congestion epoch.

21. The method of claim 17, wherein said interior node sends at least one control signal to one or more of said other nodes to redistribute the congestion at said interior node.

22. The method of claim 18, wherein said other nodes comprise ingress edge nodes.

23. The method of claim 17 wherein said interior node is an interior router.

24. The method of claim 17, wherein a plurality of said other nodes on an edge of said network collectively detect said occurrence of said congestion epoch at said interior node.

25. The method of claim 24, wherein said plurality of other nodes comprise egress nodes.

26. The method of claim 17, wherein a plurality of said other nodes collectively detect said occurrence of said congestion epoch when a prediction of said measured queue length at said interior node exceeds a predetermined threshold value of accumulation at all of said ingress edges.

27. The method of claim 26, wherein said plurality of other nodes comprise egress nodes.

28. The method of claim 17, wherein a plurality of said other nodes determine an end to said occurrence of said congestion epoch.

29. The method of claim 28, wherein said plurality of other nodes comprise egress nodes.

30. The method of claim 17 wherein said plurality of other nodes send at least one control signal to one or more of said ingress nodes to redistribute the congestion at said node.

31. The method of claim 30, wherein said plurality of other nodes comprise egress nodes.

32. An apparatus for improving distributing traffic congestion, said apparatus comprising:

means for determining a congestion epoch occurring at a node by measuring the queue length at said node; and

means for redistributing congestion at said node to at least one other node at an edge of said node when said measured queue length at said node exceeds a predetermined threshold value in response to an output of an ingress node.

33. The apparatus of claim 32, wherein said means for determining a congestion epoch comprises marking a congestion bit on at least one packet when said measured queue length at said node exceeds a predetermined threshold value.

34. The apparatus of claim 32, wherein said means for determining a congestion epoch comprises determining an end to said occurrence of said congestion epoch.

35. The apparatus of claim 32, wherein said means for redistributing congestion comprises sending at least one control signal to one or more of said at least one other nodes to redistribute the congestion at said node.

36. The apparatus of claim 35, wherein said other nodes comprise ingress edge nodes.

37. The apparatus of claim 32, wherein said node is an interior node.

38. The apparatus of claim 32, wherein said interior node is a router.

39. The apparatus of claim 32, wherein said means for determining a congestion epoch comprises collectively detecting said occurrence of said congestion epoch by a plurality of said other nodes on an edge of said node.

40. The apparatus of claim 39, wherein said plurality of other nodes comprise egress nodes.

41. The apparatus of claim 32, wherein said means for determining a congestion epoch comprises collectively detecting said occurrence of said congestion epoch by a plurality of said other nodes on an edge of said node when a prediction of said measured queue length at said node exceeds a predetermined threshold value of accumulation at all of said ingress edges.

42. The apparatus of claim 41, wherein said plurality of other nodes comprise egress nodes.

43. The apparatus of claim 32, wherein said means for determining a congestion epoch comprises determining an end to said occurrence of said congestion epoch by a plurality of said other nodes on an edge of said node.

44. The apparatus of claim 43, wherein said plurality of other nodes comprise egress nodes.

45. The apparatus of claim 32, wherein said means for redistributing said congestion comprises sending at least one control signal by said plurality of other nodes to one or more of said ingress nodes to redistribute the congestion at said node.

46. The apparatus of claim 45, wherein said plurality of other nodes comprise egress nodes.