Domain based congestion management
DCFirst Claim
1. A method of detecting congestion, comprising:
- setting a minimum threshold, a maximum threshold and a feedback threshold for buffer occupancy;
marking outgoing packets when said average queue size is between said minimum threshold and said feedback threshold;
dropping incoming packets and marking said outgoing packets when said average queue size is between said feedback threshold and said maximum threshold; and
dropping, all of said incoming packets when an average queue size exceeds said maximum threshold.
8 Assignments
Litigations
0 Petitions
Accused Products
Abstract
The Domain-based Congestion Management method and apparatus detects and regulates congestion in a Diff-serv network. It use an improvRED method for congestion detection at the core routers and token bucket filters for traffic regulation at the ingress nodes. In addition, improvRED also provides feedback control. ImprovRED uses three thresholds for detecting congestion: a minth, a maxth and a FeedbackThreshold, which lakes a value between the minth and the maxth thresholds. Whenever the average queue size is greater than minth and less than Feedback-Threshold, all outgoing packets are marked appropriately to indicate a potential onset of a congestion period. When the average queue size is greater th FeedbackThreshold (but less than maxth) packets are dropped probabilistically and all the outgoing packets are marked appropriately to denote the dropping phase. When the average queue size is greater than the maximum threshold, all incoming packets are dropped.
-
Citations
42 Claims
-
1. A method of detecting congestion, comprising:
-
setting a minimum threshold, a maximum threshold and a feedback threshold for buffer occupancy;
marking outgoing packets when said average queue size is between said minimum threshold and said feedback threshold;
dropping incoming packets and marking said outgoing packets when said average queue size is between said feedback threshold and said maximum threshold; and
dropping, all of said incoming packets when an average queue size exceeds said maximum threshold. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17)
-
-
18. A method of regulating traffic flow between nodes, comprising:
-
detecting congestion;
sending a message to at least one node;
regulating at least one traffic rate of said at least one node by varying a number of tokens consumed by a data packet by varying the number of tokens consumed by data of unit size, comprising the steps of;
decreasing said data of unit size monotonically if demand increases monotonically during a congestion free period;
further decreasing said data of unit size if an average queue size is greater than a demand threshold;
increasing said data of unit receipt of a message; and
transmitting said packet if a number of tokens consumed by said packet is less than available tokens, wherein said at least one packet is marked deterministically; and
detecting when congestion is clear. - View Dependent Claims (19, 20, 21, 22)
-
-
23. A method of regulating traffic flow between nodes, comprising:
-
detecting congestion;
sending a message to at least one node;
regulating at least one traffic rate of said at least one node, wherein said step of regulating at least one traffic rate of said at least one node, comprises;
varying a number of tokens consumed by a data packet by decreasing data of unit size monotonically if demand increases monotonically during a congestion free period; and
transmitting said packet if a number of tokens consumed by said packet is less than or equal to available tokens; and
detecting when congestion is clear. - View Dependent Claims (27)
-
-
24. A method of regulating traffic flow between nodes, comprising:
-
detecting congestion;
sending a message to at least one node;
regulating at least one traffic rate of said at least one node, wherein said step of regulating at least one traffic rate of said at least one node, comprises;
varying a number of tokens consumed by a data packet by increasing data of unit size upon receipt of a message; and
transmitting said packet if a number of tokens consumed by said packet is less than or equal to available tokens; and
detecting when congestion is clear.
-
-
25. A method of regulating traffic flow between nodes, comprising:
-
detecting congestion;
sending a message to at least one node by marking at one packet, wherein said packet is marked deterministically;
regulating at least one traffic rate of said at least one node; and
detecting when congestion is clear.
-
-
26. A method of regulating traffic flow between nodes comprising:
-
detecting congestion;
sending a message to at least one node by at least one packet wherein said step of marking packets comprises setting at least one bit in at least one of said packets;
regulating at least one traffic rate of said at least one node; and
detecting when congestion is clear. - View Dependent Claims (28)
-
-
29. A method of controlling traffic flow in a differentiated services domain, comprising:
-
determining available bandwidth by calculating an average queue size at token bucket filter;
determining if said average queue size is greater than a demand threshold;
varying a number of tokens consumed by a data packet; and
transmitting said data packet if a number of tokens consumed by said data packet is less than or equal to available tokens. - View Dependent Claims (30, 31, 34, 35, 41)
-
-
32. A method of controlling traffic flow in a differentiated services domain, comprising:
-
varying a number of tokens consumed by a data packet, wherein said step of varying said number of tokens consumed by a data packet comprises a step of decreasing data of unit size monotonically if demand increases monotonically during a congestion free period; and
transmitting said data packet if a number of tokens consumed by said data packet is less than available tokens. - View Dependent Claims (42)
-
-
33. A method of controlling traffic flow in a differentiated services domain, comprising:
-
varying a number of tokens consumed by a data packet, wherein said step of varying said number of tokens comprises a step of increasing data of unit size upon receipt of a message; and
transmitting said data packet if a number of tokens consumed by said data packet is less than available tokens.
-
-
36. A method of controlling traffic flow in a differentiated services domain, comprising:
-
varying a number of tokens consumed by a data packet by varying the number of tokens consumed by data of unit size, wherein a minimum number of tokens consumed by said data of unit size equals a depth of a token bucket filter divided by a min-max fair share of the buffer; and
transmitting said data packet if a number of tokens consumed by said data packet is less than or equal to available tokens.
-
-
37. A method of controlling traffic flow in a differentiated services domain, comprising:
-
varying a number of tokens consumed by a data packet by varying the number of tokens consumed by data of unit size, wherein a minimum number of tokens consumed by said data of unit size equals a depth of a token generation rate divided by a min-max fair share of the bandwidth; and
transmitting said data packet if a number of tokens consumed by said data packet is less than or equal to available tokens.
-
-
38. A method of controlling traffic flow in a differentiated services domain, comprising:
-
varying number of tokens consumed by a data packet by varying the number of tokens consumed by data of unit size, wherein a maximum number of tokens consumed by said data of unit size equals a depth of a token bucket filter divided by a maximum transmission unit; and
transmitting said data packet if a number of tokens consumed by said data packet is less than or equal to available tokens.
-
-
39. A method of controlling traffic flow in a differentiated services domain, comprising:
-
varying a number of tokens consumed by a data packet by varying the number of tokens consumed by data of unit size wherein a maximum member of tokens consumed by said data of unit size equals a token generation rate divided by a minimum data buffer drain rate; and
transmitting said data packet if a number of tokens consumed by said data packet is less than or equal to available tokens.
-
-
40. A method of controlling traffic flow in a differentiated services domain, comprising:
-
varying a number of tokens consumed by a data packet by varying the number of tokens consumed by data of unit size, wherein said step of varying the number of tokens consumed by data of unit size, comprise the steps of;
decreasing said data of unit size monotonically if demand increases monotonically during a congestion free period;
further decreasing said data of unit size if an average queue size is greater than a demand threshold; and
increasing said data of unit size upon receipt of a message, wherein said number of tokens consumed by a data packet is varied based on state and demand; and
transmitting said data packet if a number of tokens consumed by said data packet is less than or equal to available tokens.
-
Specification